Table of Contents

• Reinforcement Planning for Effective ε-Optimal Policies in Dense Time with DiscontinuitiesLéo Henry, Blaise Genest, Alexandre Drewery. [doi]
• A Class of Rational Trace Relations Closed Under CompositionDietrich Kuske. [doi]
• Monotone Classes Beyond VNPPrerona Chatterjee, Kshitij Gajjar, Anamay Tengse. [doi]
• Perfect Matchings and Popularity in the Many-To-Many SettingTelikepalli Kavitha, Kazuhisa Makino. [doi]
• Randomized and Quantum Query Complexities of Finding a King in a TournamentNikhil S. Mande, Manaswi Paraashar, Nitin Saurabh. [doi]
• Regular Separators for VASS Coverability LanguagesChris Köcher, Georg Zetzsche. [doi]
• Robust Positivity Problems for Linear Recurrence Sequences: The Frontiers of Decidability for Explicitly Given NeighbourhoodsMihir Vahanwala. [doi]
• Algorithms in the Presence of Biased Inputs (Invited Talk)Nisheeth K. Vishnoi. [doi]
• Online Facility Location with Weights and CongestionArghya Chakraborty, Rahul Vaze. [doi]
• Nash Equilibria of Two-Player Matrix Games Repeated Until CollisionAniket Murhekar, Eklavya Sharma. [doi]
• Approximate Maximum Rank Aggregation: Beyond the Worst-CaseAlvin Yan Hong Yao, Diptarka Chakraborty. [doi]
• Computational and Information-Theoretic Questions from Causal Inference (Invited Talk)Leonard J. Schulman. [doi]
• FPT Approximations for Packing and Covering Problems Parameterized by Elimination Distance and Even LessTanmay Inamdar 0002, Lawqueen Kanesh, Madhumita Kundu, M. S. Ramanujan 0001, Saket Saurabh 0001. [doi]
• Parameterized Complexity of Biclique Contraction and Balanced Biclique ContractionR. Krithika 0001, V. K. Kutty Malu, Roohani Sharma, Prafullkumar Tale. [doi]
• New Lower Bounds for Reachability in Vector Addition SystemsWojciech Czerwinski, Ismaël Jecker, Slawomir Lasota 0001, Jérôme Leroux, Lukasz Orlikowski. [doi]
• Solving Odd-Fair Parity GamesIrmak Saglam, Anne-Kathrin Schmuck. [doi]
• Tight Bounds for the Randomized and Quantum Communication Complexities of Equality with Small ErrorOlivier Lalonde, Nikhil S. Mande, Ronald de Wolf. [doi]
• Listing 4-CyclesAmir Abboud, Seri Khoury, Oree Leibowitz, Ron Safier. [doi]
• Counter Machines with Infrequent ReversalsAlain Finkel, Shankara Narayanan Krishna, Khushraj Madnani, Rupak Majumdar, Georg Zetzsche. [doi]
• Decision Tree Complexity Versus Block Sensitivity and DegreeRahul Chugh, Supartha Podder, Swagato Sanyal. [doi]
• Bandwidth of Timed Automata: 3 ClassesEugene Asarin, Aldric Degorre, Catalin Dima, Bernardo Jacobo Inclán. [doi]
• Acyclic Petri and Workflow Nets with ResetsDmitry Chistikov 0001, Wojciech Czerwinski, Piotr Hofman, Filip Mazowiecki, Henry Sinclair-Banks. [doi]
• Towards Identity Testing for Sums of Products of Read-Once and Multilinear Bounded-Read FormulaePranav Bisht, Nikhil Gupta 0012, Ilya Volkovich. [doi]
• Synchronized CTL over One-Counter AutomataShaull Almagor, Daniel Assa, Udi Boker. [doi]
• Reachability Games and Friends: A Journey Through the Lens of Memory and Complexity (Invited Talk)Thomas Brihaye, Aline Goeminne, James C. A. Main, Mickael Randour. [doi]
• Approximately Interpolating Between Uniformly and Non-Uniformly Polynomial KernelsAkanksha Agrawal, M. S. Ramanujan 0001. [doi]
• On Measuring Average Case Complexity via Sum-Of-Squares Degree (Invited Talk)Prasad Raghavendra. [doi]
• Hardness of Learning Boolean Functions from Label ProportionsVenkatesan Guruswami, Rishi Saket. [doi]
• Towards a Practical, Budget-Oblivious Algorithm for the Adwords Problem Under Small BidsVijay V. Vazirani. [doi]
• Monotonicity Characterizations of Regular LanguagesYoav Feinstein, Orna Kupferman. [doi]
• Front Matter, Table of Contents, Preface, Conference Organization [doi]
• An Optimal Algorithm for Sorting in TreesJishnu Roychoudhury, Jatin Yadav. [doi]
• Revisiting Mulmuley: Simple Proof That Maxflow Is Not in the Algebraic Version of NCUlysse Léchine. [doi]
• From Concept Learning to SAT-Based Invariant Inference (Invited Talk)Sharon Shoham. [doi]
• Leakage Resilience, Targeted Pseudorandom Generators, and Mild Derandomization of Arthur-Merlin ProtocolsDieter van Melkebeek, Nicollas M. Sdroievski. [doi]
• A Generalized Quantum Branching ProgramDebajyoti Bera, SAPV Tharrmashastha. [doi]
• Comparing Infinitary Systems for Linear Logic with Fixed PointsAnupam Das 0002, Abhishek De 0001, Alexis Saurin. [doi]
• Bounded Simultaneous MessagesAndrej Bogdanov, Krishnamoorthy Dinesh 0001, Yuval Filmus, Yuval Ishai, Avi Kaplan, Sruthi Sekar. [doi]
• Parameterized Complexity of Incomplete Connected Fair DivisionHarmender Gahlawat, Meirav Zehavi. [doi]
• Constraint LTL with Remote AccessAshwin Bhaskar, M. Praveen. [doi]
• Weighted One-Deterministic-Counter AutomataPrince Mathew 0001, Vincent Penelle, Prakash Saivasan, A. V. Sreejith. [doi]
• Languages Given by Finite Automata over the Unary AlphabetWojciech Czerwinski, Maciej Debski, Tomasz Gogasz, Gordon Hoi, Sanjay Jain 0001, Michal Skrzypczak, Frank Stephan 0001, Christopher Tan. [doi]
• Interval Selection in Data Streams: Weighted Intervals and the Insertion-Deletion SettingJacques Dark, Adithya Diddapur, Christian Konrad 0001. [doi]
• Dependency Schemes in CDCL-Based QBF Solving: A Proof-Theoretic StudyAbhimanyu Choudhury, Meena Mahajan. [doi]