LIPIcs, Volume 284, FSTTCS 2023

• Patricia Bouyer and Srikanth Srinivasan LIPIcs, Volume 284, FSTTCS 2023, Complete Volume 10.4230/LIPIcs.FSTTCS.2023
• Patricia Bouyer and Srikanth Srinivasan Front Matter, Table of Contents, Preface, Conference Organization 10.4230/LIPIcs.FSTTCS.2023.0
• Thomas Brihaye, Aline Goeminne, James C. A. Main, and Mickael Randour Reachability Games and Friends: A Journey Through the Lens of Memory and Complexity (Invited Talk) 10.4230/LIPIcs.FSTTCS.2023.1
• Prasad Raghavendra On Measuring Average Case Complexity via Sum-Of-Squares Degree (Invited Talk) 10.4230/LIPIcs.FSTTCS.2023.2
• Leonard J. Schulman Computational and Information-Theoretic Questions from Causal Inference (Invited Talk) 10.4230/LIPIcs.FSTTCS.2023.3
• Sharon Shoham From Concept Learning to SAT-Based Invariant Inference (Invited Talk) 10.4230/LIPIcs.FSTTCS.2023.4
• Nisheeth K. Vishnoi Algorithms in the Presence of Biased Inputs (Invited Talk) 10.4230/LIPIcs.FSTTCS.2023.5
• Arghya Chakraborty and Rahul Vaze Online Facility Location with Weights and Congestion 10.4230/LIPIcs.FSTTCS.2023.6
• Jishnu Roychoudhury and Jatin Yadav An Optimal Algorithm for Sorting in Trees 10.4230/LIPIcs.FSTTCS.2023.7
• R. Krithika, V. K. Kutty Malu, Roohani Sharma, and Prafullkumar Tale Parameterized Complexity of Biclique Contraction and Balanced Biclique Contraction 10.4230/LIPIcs.FSTTCS.2023.8
• Pranav Bisht, Nikhil Gupta, and Ilya Volkovich Towards Identity Testing for Sums of Products of Read-Once and Multilinear Bounded-Read Formulae 10.4230/LIPIcs.FSTTCS.2023.9
• Eugene Asarin, Aldric Degorre, Cătălin Dima, and Bernardo Jacobo Inclán Bandwidth of Timed Automata: 3 Classes 10.4230/LIPIcs.FSTTCS.2023.10
• Prerona Chatterjee, Kshitij Gajjar, and Anamay Tengse Monotone Classes Beyond VNP 10.4230/LIPIcs.FSTTCS.2023.11
• Yan Hong Yao Alvin and Diptarka Chakraborty Approximate Maximum Rank Aggregation: Beyond the Worst-Case 10.4230/LIPIcs.FSTTCS.2023.12
• Léo Henry, Blaise Genest, and Alexandre Drewery Reinforcement Planning for Effective ε-Optimal Policies in Dense Time with Discontinuities 10.4230/LIPIcs.FSTTCS.2023.13
• Harmender Gahlawat and Meirav Zehavi Parameterized Complexity of Incomplete Connected Fair Division 10.4230/LIPIcs.FSTTCS.2023.14
• Chris Köcher and Georg Zetzsche Regular Separators for VASS Coverability Languages 10.4230/LIPIcs.FSTTCS.2023.15
• Dmitry Chistikov, Wojciech Czerwiński, Piotr Hofman, Filip Mazowiecki, and Henry Sinclair-Banks Acyclic Petri and Workflow Nets with Resets 10.4230/LIPIcs.FSTTCS.2023.16
• Mihir Vahanwala Robust Positivity Problems for Linear Recurrence Sequences: The Frontiers of Decidability for Explicitly Given Neighbourhoods 10.4230/LIPIcs.FSTTCS.2023.17
• Aniket Murhekar and Eklavya Sharma Nash Equilibria of Two-Player Matrix Games Repeated Until Collision 10.4230/LIPIcs.FSTTCS.2023.18
• Shaull Almagor, Daniel Assa, and Udi Boker Synchronized CTL over One-Counter Automata 10.4230/LIPIcs.FSTTCS.2023.19
• Dietrich Kuske A Class of Rational Trace Relations Closed Under Composition 10.4230/LIPIcs.FSTTCS.2023.20
• Vijay V. Vazirani Towards a Practical, Budget-Oblivious Algorithm for the Adwords Problem Under Small Bids 10.4230/LIPIcs.FSTTCS.2023.21
• Wojciech Czerwiński, Maciej Dębski, Tomasz Gogasz, Gordon Hoi, Sanjay Jain, Michał Skrzypczak, Frank Stephan, and Christopher Tan Languages Given by Finite Automata over the Unary Alphabet 10.4230/LIPIcs.FSTTCS.2023.22
• Andrej Bogdanov, Krishnamoorthy Dinesh, Yuval Filmus, Yuval Ishai, Avi Kaplan, and Sruthi Sekar Bounded Simultaneous Messages 10.4230/LIPIcs.FSTTCS.2023.23
• Jacques Dark, Adithya Diddapur, and Christian Konrad Interval Selection in Data Streams: Weighted Intervals and the Insertion-Deletion Setting 10.4230/LIPIcs.FSTTCS.2023.24
• Amir Abboud, Seri Khoury, Oree Leibowitz, and Ron Safier Listing 4-Cycles 10.4230/LIPIcs.FSTTCS.2023.25
• Yoav Feinstein and Orna Kupferman Monotonicity Characterizations of Regular Languages 10.4230/LIPIcs.FSTTCS.2023.26
• Rahul Chugh, Supartha Podder, and Swagato Sanyal Decision Tree Complexity Versus Block Sensitivity and Degree 10.4230/LIPIcs.FSTTCS.2023.27
• Tanmay Inamdar, Lawqueen Kanesh, Madhumita Kundu, M. S. Ramanujan, and Saket Saurabh FPT Approximations for Packing and Covering Problems Parameterized by Elimination Distance and Even Less 10.4230/LIPIcs.FSTTCS.2023.28
• Dieter van Melkebeek and Nicollas Mocelin Sdroievski Leakage Resilience, Targeted Pseudorandom Generators, and Mild Derandomization of Arthur-Merlin Protocols 10.4230/LIPIcs.FSTTCS.2023.29
• Nikhil S. Mande, Manaswi Paraashar, and Nitin Saurabh Randomized and Quantum Query Complexities of Finding a King in a Tournament 10.4230/LIPIcs.FSTTCS.2023.30
• Debajyoti Bera and Tharrmashastha SAPV A Generalized Quantum Branching Program 10.4230/LIPIcs.FSTTCS.2023.31
• Olivier Lalonde, Nikhil S. Mande, and Ronald de Wolf Tight Bounds for the Randomized and Quantum Communication Complexities of Equality with Small Error 10.4230/LIPIcs.FSTTCS.2023.32
• Ulysse Léchine Revisiting Mulmuley: Simple Proof That Maxflow Is Not in the Algebraic Version of NC 10.4230/LIPIcs.FSTTCS.2023.33
• Irmak Sağlam and Anne-Kathrin Schmuck Solving Odd-Fair Parity Games 10.4230/LIPIcs.FSTTCS.2023.34
• Wojciech Czerwiński, Ismaël Jecker, Sławomir Lasota, Jérôme Leroux, and Łukasz Orlikowski New Lower Bounds for Reachability in Vector Addition Systems 10.4230/LIPIcs.FSTTCS.2023.35
• Akanksha Agrawal and M. S. Ramanujan Approximately Interpolating Between Uniformly and Non-Uniformly Polynomial Kernels 10.4230/LIPIcs.FSTTCS.2023.36
• Venkatesan Guruswami and Rishi Saket Hardness of Learning Boolean Functions from Label Proportions 10.4230/LIPIcs.FSTTCS.2023.37
• Abhimanyu Choudhury and Meena Mahajan Dependency Schemes in CDCL-Based QBF Solving: A Proof-Theoretic Study 10.4230/LIPIcs.FSTTCS.2023.38
• Prince Mathew, Vincent Penelle, Prakash Saivasan, and A.V. Sreejith Weighted One-Deterministic-Counter Automata 10.4230/LIPIcs.FSTTCS.2023.39
• Anupam Das, Abhishek De, and Alexis Saurin Comparing Infinitary Systems for Linear Logic with Fixed Points 10.4230/LIPIcs.FSTTCS.2023.40
• Ashwin Bhaskar and M. Praveen Constraint LTL with Remote Access 10.4230/LIPIcs.FSTTCS.2023.41
• Alain Finkel, Shankara Narayanan Krishna, Khushraj Madnani, Rupak Majumdar, and Georg Zetzsche Counter Machines with Infrequent Reversals 10.4230/LIPIcs.FSTTCS.2023.42
• Telikepalli Kavitha and Kazuhisa Makino Perfect Matchings and Popularity in the Many-To-Many Setting 10.4230/LIPIcs.FSTTCS.2023.43