default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID43rd FSTTCS 2023: Hyderabad, India
- Patricia Bouyer
, Srikanth Srinivasan:
43rd IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2023, IIIT Hyderabad, Telangana, India, December 18-20, 2023. LIPIcs 284, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2023, ISBN 978-3-95977-304-1 - Front Matter, Table of Contents, Preface, Conference Organization. 0:1-0:16
- Thomas Brihaye, Aline Goeminne, James C. A. Main, Mickael Randour:
Reachability Games and Friends: A Journey Through the Lens of Memory and Complexity (Invited Talk). 1:1-1:26 - Prasad Raghavendra:
On Measuring Average Case Complexity via Sum-Of-Squares Degree (Invited Talk). 2:1-2:1 - Leonard J. Schulman:
Computational and Information-Theoretic Questions from Causal Inference (Invited Talk). 3:1-3:1 - Sharon Shoham:
From Concept Learning to SAT-Based Invariant Inference (Invited Talk). 4:1-4:1 - Nisheeth K. Vishnoi:
Algorithms in the Presence of Biased Inputs (Invited Talk). 5:1-5:2 - Arghya Chakraborty, Rahul Vaze:
Online Facility Location with Weights and Congestion. 6:1-6:22 - Jishnu Roychoudhury, Jatin Yadav:
An Optimal Algorithm for Sorting in Trees. 7:1-7:14 - R. Krithika, V. K. Kutty Malu, Roohani Sharma, Prafullkumar Tale:
Parameterized Complexity of Biclique Contraction and Balanced Biclique Contraction. 8:1-8:18 - Pranav Bisht, Nikhil Gupta, Ilya Volkovich:
Towards Identity Testing for Sums of Products of Read-Once and Multilinear Bounded-Read Formulae. 9:1-9:23 - Eugene Asarin, Aldric Degorre, Catalin Dima, Bernardo Jacobo Inclán:
Bandwidth of Timed Automata: 3 Classes. 10:1-10:17 - Prerona Chatterjee, Kshitij Gajjar, Anamay Tengse:
Monotone Classes Beyond VNP. 11:1-11:23 - Alvin Yan Hong Yao, Diptarka Chakraborty:
Approximate Maximum Rank Aggregation: Beyond the Worst-Case. 12:1-12:21 - Léo Henry, Blaise Genest, Alexandre Drewery:
Reinforcement Planning for Effective ε-Optimal Policies in Dense Time with Discontinuities. 13:1-13:18 - Harmender Gahlawat, Meirav Zehavi:
Parameterized Complexity of Incomplete Connected Fair Division. 14:1-14:18 - Chris Köcher, Georg Zetzsche:
Regular Separators for VASS Coverability Languages. 15:1-15:19 - Dmitry Chistikov, Wojciech Czerwinski, Piotr Hofman, Filip Mazowiecki, Henry Sinclair-Banks:
Acyclic Petri and Workflow Nets with Resets. 16:1-16:18 - Mihir Vahanwala:
Robust Positivity Problems for Linear Recurrence Sequences: The Frontiers of Decidability for Explicitly Given Neighbourhoods. 17:1-17:21 - Aniket Murhekar, Eklavya Sharma:
Nash Equilibria of Two-Player Matrix Games Repeated Until Collision. 18:1-18:17 - Shaull Almagor, Daniel Assa, Udi Boker:
Synchronized CTL over One-Counter Automata. 19:1-19:22 - Dietrich Kuske:
A Class of Rational Trace Relations Closed Under Composition. 20:1-20:20 - Vijay V. Vazirani:
Towards a Practical, Budget-Oblivious Algorithm for the Adwords Problem Under Small Bids. 21:1-21:14 - Wojciech Czerwinski, Maciej Debski, Tomasz Gogasz, Gordon Hoi, Sanjay Jain, Michal Skrzypczak, Frank Stephan, Christopher Tan:
Languages Given by Finite Automata over the Unary Alphabet. 22:1-22:20 - Andrej Bogdanov, Krishnamoorthy Dinesh, Yuval Filmus, Yuval Ishai, Avi Kaplan, Sruthi Sekar:
Bounded Simultaneous Messages. 23:1-23:17 - Jacques Dark, Adithya Diddapur, Christian Konrad:
Interval Selection in Data Streams: Weighted Intervals and the Insertion-Deletion Setting. 24:1-24:17 - Amir Abboud, Seri Khoury, Oree Leibowitz, Ron Safier:
Listing 4-Cycles. 25:1-25:16 - Yoav Feinstein, Orna Kupferman:
Monotonicity Characterizations of Regular Languages. 26:1-26:19 - Rahul Chugh, Supartha Podder, Swagato Sanyal:
Decision Tree Complexity Versus Block Sensitivity and Degree. 27:1-27:23 - Tanmay Inamdar, Lawqueen Kanesh, Madhumita Kundu, M. S. Ramanujan, Saket Saurabh:
FPT Approximations for Packing and Covering Problems Parameterized by Elimination Distance and Even Less. 28:1-28:16 - Dieter van Melkebeek, Nicollas M. Sdroievski:
Leakage Resilience, Targeted Pseudorandom Generators, and Mild Derandomization of Arthur-Merlin Protocols. 29:1-29:22 - Nikhil S. Mande, Manaswi Paraashar, Nitin Saurabh:
Randomized and Quantum Query Complexities of Finding a King in a Tournament. 30:1-30:19 - Debajyoti Bera, Tharrmashastha SAPV:
A Generalized Quantum Branching Program. 31:1-31:21 - Olivier Lalonde, Nikhil S. Mande, Ronald de Wolf:
Tight Bounds for the Randomized and Quantum Communication Complexities of Equality with Small Error. 32:1-32:18 - Ulysse Léchine:
Revisiting Mulmuley: Simple Proof That Maxflow Is Not in the Algebraic Version of NC. 33:1-33:12 - Irmak Saglam, Anne-Kathrin Schmuck:
Solving Odd-Fair Parity Games. 34:1-34:24 - Wojciech Czerwinski, Ismaël Jecker, Slawomir Lasota, Jérôme Leroux, Lukasz Orlikowski:
New Lower Bounds for Reachability in Vector Addition Systems. 35:1-35:22 - Akanksha Agrawal, M. S. Ramanujan:
Approximately Interpolating Between Uniformly and Non-Uniformly Polynomial Kernels. 36:1-36:17 - Venkatesan Guruswami, Rishi Saket:
Hardness of Learning Boolean Functions from Label Proportions. 37:1-37:15 - Abhimanyu Choudhury, Meena Mahajan:
Dependency Schemes in CDCL-Based QBF Solving: A Proof-Theoretic Study. 38:1-38:18 - Prince Mathew, Vincent Penelle, Prakash Saivasan, A. V. Sreejith:
Weighted One-Deterministic-Counter Automata. 39:1-39:23 - Anupam Das, Abhishek De, Alexis Saurin:
Comparing Infinitary Systems for Linear Logic with Fixed Points. 40:1-40:17 - Ashwin Bhaskar, M. Praveen:
Constraint LTL with Remote Access. 41:1-41:21 - Alain Finkel, Shankara Narayanan Krishna, Khushraj Madnani, Rupak Majumdar, Georg Zetzsche:
Counter Machines with Infrequent Reversals. 42:1-42:17 - Telikepalli Kavitha, Kazuhisa Makino:
Perfect Matchings and Popularity in the Many-To-Many Setting. 43:1-43:16
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2026-03-15 21:55 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
