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