<h2>LIPIcs, Volume 250, FSTTCS 2022</h2>
<ul>
<li>
<span class="authors">Anuj Dawar and Venkatesan Guruswami</span>
<span class="title">LIPIcs, Volume 250, FSTTCS 2022, Complete Volume</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2022">10.4230/LIPIcs.FSTTCS.2022</a>
</li>
<li>
<span class="authors">Anuj Dawar and Venkatesan Guruswami</span>
<span class="title">Front Matter, Table of Contents, Preface, Conference Organization</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2022.0">10.4230/LIPIcs.FSTTCS.2022.0</a>
</li>
<li>
<span class="authors">Anupam Gupta</span>
<span class="title">Algorithms for Uncertain Environments: Going Beyond the Worst-Case (Invited Talk)</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2022.1">10.4230/LIPIcs.FSTTCS.2022.1</a>
</li>
<li>
<span class="authors">Rahul Santhanam</span>
<span class="title">Why MCSP Is a More Important Problem Than SAT (Invited Talk)</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2022.2">10.4230/LIPIcs.FSTTCS.2022.2</a>
</li>
<li>
<span class="authors">Patricia Bouyer, Mickael Randour, and Pierre Vandenhove</span>
<span class="title">The True Colors of Memory: A Tour of Chromatic-Memory Strategies in Zero-Sum Games on Graphs (Invited Talk)</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2022.3">10.4230/LIPIcs.FSTTCS.2022.3</a>
</li>
<li>
<span class="authors">Irit Dinur</span>
<span class="title">Expanders in Higher Dimensions (Invited Talk)</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2022.4">10.4230/LIPIcs.FSTTCS.2022.4</a>
</li>
<li>
<span class="authors">Jasine Babu, R. Krithika, and Deepak Rajendraprasad</span>
<span class="title">Packing Arc-Disjoint 4-Cycles in Oriented Graphs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2022.5">10.4230/LIPIcs.FSTTCS.2022.5</a>
</li>
<li>
<span class="authors">Calvin Beideman, Karthekeyan Chandrasekaran, Chandra Chekuri, and Chao Xu</span>
<span class="title">Approximate Representation of Symmetric Submodular Functions via Hypergraph Cut Functions</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2022.6">10.4230/LIPIcs.FSTTCS.2022.6</a>
</li>
<li>
<span class="authors">Gianfranco Bilardi and Lorenzo De Stefani</span>
<span class="title">The DAG Visit Approach for Pebbling and I/O Lower Bounds</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2022.7">10.4230/LIPIcs.FSTTCS.2022.7</a>
</li>
<li>
<span class="authors">Arijit Bishnu, Arijit Ghosh, Gopinath Mishra, and Manaswi Paraashar</span>
<span class="title">Counting and Sampling from Substructures Using Linear Algebraic Queries</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2022.8">10.4230/LIPIcs.FSTTCS.2022.8</a>
</li>
<li>
<span class="authors">Pranav Bisht and Nitin Saxena</span>
<span class="title">Derandomization via Symmetric Polytopes: Poly-Time Factorization of Certain Sparse Polynomials</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2022.9">10.4230/LIPIcs.FSTTCS.2022.9</a>
</li>
<li>
<span class="authors">Pranav Bisht and Ilya Volkovich</span>
<span class="title">On Solving Sparse Polynomial Factorization Related Problems</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2022.10">10.4230/LIPIcs.FSTTCS.2022.10</a>
</li>
<li>
<span class="authors">Krishnendu Chatterjee, Rasmus Ibsen-Jensen, Ismaël Jecker, and Jakub Svoboda</span>
<span class="title">Complexity of Spatial Games</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2022.11">10.4230/LIPIcs.FSTTCS.2022.11</a>
</li>
<li>
<span class="authors">Arkadev Chattopadhyay, Utsab Ghosal, and Partha Mukhopadhyay</span>
<span class="title">Robustly Separating the Arithmetic Monotone Hierarchy via Graph Inner-Product</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2022.12">10.4230/LIPIcs.FSTTCS.2022.12</a>
</li>
<li>
<span class="authors">Jaehoon Chung, Sang Won Bae, Chan-Su Shin, Sang Duk Yoon, and Hee-Kap Ahn</span>
<span class="title">Inscribing or Circumscribing a Histogon to a Convex Polygon</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2022.13">10.4230/LIPIcs.FSTTCS.2022.13</a>
</li>
<li>
<span class="authors">Joshua Cook</span>
<span class="title">More Verifier Efficient Interactive Protocols for Bounded Space</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2022.14">10.4230/LIPIcs.FSTTCS.2022.14</a>
</li>
<li>
<span class="authors">Arjan Cornelissen, Nikhil S. Mande, and Subhasree Patro</span>
<span class="title">Improved Quantum Query Upper Bounds Based on Classical Decision Trees</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2022.15">10.4230/LIPIcs.FSTTCS.2022.15</a>
</li>
<li>
<span class="authors">Radu Curticapean, Nutan Limaye, and Srikanth Srinivasan</span>
<span class="title">On the VNP-Hardness of Some Monomial Symmetric Polynomials</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2022.16">10.4230/LIPIcs.FSTTCS.2022.16</a>
</li>
<li>
<span class="authors">Minati De, Saksham Jain, Sarat Varma Kallepalli, and Satyam Singh</span>
<span class="title">Online Piercing of Geometric Objects</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2022.17">10.4230/LIPIcs.FSTTCS.2022.17</a>
</li>
<li>
<span class="authors">Nandhana Duraisamy, Hannah Miller Hillberg, Ramesh K. Jallu, Erik Krohn, Anil Maheshwari, Subhas C. Nandy, and Alex Pahlow</span>
<span class="title">Half-Guarding Weakly-Visible Polygons and Terrains</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2022.18">10.4230/LIPIcs.FSTTCS.2022.18</a>
</li>
<li>
<span class="authors">Rohith Reddy Gangam, Tung Mai, Nitya Raju, and Vijay V. Vazirani</span>
<span class="title">A Structural and Algorithmic Study of Stable Matching Lattices of "Nearby" Instances, with Applications</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2022.19">10.4230/LIPIcs.FSTTCS.2022.19</a>
</li>
<li>
<span class="authors">Fulvio Gesmundo, Purnata Ghosal, Christian Ikenmeyer, and Vladimir Lysikov</span>
<span class="title">Degree-Restricted Strength Decompositions and Algebraic Branching Programs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2022.20">10.4230/LIPIcs.FSTTCS.2022.20</a>
</li>
<li>
<span class="authors">Utkarsh Joshi, Saladi Rahul, and Josson Joe Thoppil</span>
<span class="title">A Simple Polynomial Time Algorithm for Max Cut on Laminar Geometric Intersection Graphs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2022.21">10.4230/LIPIcs.FSTTCS.2022.21</a>
</li>
<li>
<span class="authors">Telikepalli Kavitha</span>
<span class="title">Stable Matchings with One-Sided Ties and Approximate Popularity</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2022.22">10.4230/LIPIcs.FSTTCS.2022.22</a>
</li>
<li>
<span class="authors">Arindam Khan, Eklavya Sharma, and K. V. N. Sreenivas</span>
<span class="title">Geometry Meets Vectors: Approximation Algorithms for Multidimensional Packing</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2022.23">10.4230/LIPIcs.FSTTCS.2022.23</a>
</li>
<li>
<span class="authors">Pascal Koiran and Subhayan Saha</span>
<span class="title">Black Box Absolute Reconstruction for Sums of Powers of Linear Forms</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2022.24">10.4230/LIPIcs.FSTTCS.2022.24</a>
</li>
<li>
<span class="authors">Oded Lachish, Felix Reidl, and Chhaya Trehan</span>
<span class="title">When You Come at the King You Best Not Miss</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2022.25">10.4230/LIPIcs.FSTTCS.2022.25</a>
</li>
<li>
<span class="authors">Ramita Maharjan and Thomas Watson</span>
<span class="title">Complexity of Fault Tolerant Query Complexity</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2022.26">10.4230/LIPIcs.FSTTCS.2022.26</a>
</li>
<li>
<span class="authors">Neeldhara Misra, Manas Mulpuri, Prafullkumar Tale, and Gaurav Viramgami</span>
<span class="title">Romeo and Juliet Meeting in Forest like Regions</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2022.27">10.4230/LIPIcs.FSTTCS.2022.27</a>
</li>
<li>
<span class="authors">Vijay V. Vazirani</span>
<span class="title">New Characterizations of Core Imputations of Matching and b-Matching Games</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2022.28">10.4230/LIPIcs.FSTTCS.2022.28</a>
</li>
<li>
<span class="authors">Ali Ahmadi, Krishnendu Chatterjee, Amir Kafshdar Goharshady, Tobias Meggendorfer, Roodabeh Safavi, and Ðorđe Žikelić</span>
<span class="title">Algorithms and Hardness Results for Computing Cores of Markov Chains</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2022.29">10.4230/LIPIcs.FSTTCS.2022.29</a>
</li>
<li>
<span class="authors">Guy Avni and Suman Sadhukhan</span>
<span class="title">Computing Threshold Budgets in Discrete-Bidding Games</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2022.30">10.4230/LIPIcs.FSTTCS.2022.30</a>
</li>
<li>
<span class="authors">Dylan Bellier, Sophie Pinchinat, and François Schwarzentruber</span>
<span class="title">Dependency Matrices for Multiplayer Strategic Dependencies</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2022.31">10.4230/LIPIcs.FSTTCS.2022.31</a>
</li>
<li>
<span class="authors">Nathalie Bertrand, Nicolas Markey, Suman Sadhukhan, and Ocan Sankur</span>
<span class="title">Semilinear Representations for Series-Parallel Atomic Congestion Games</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2022.32">10.4230/LIPIcs.FSTTCS.2022.32</a>
</li>
<li>
<span class="authors">Benjamin Bordais, Patricia Bouyer, and Stéphane Le Roux</span>
<span class="title">Playing (Almost-)Optimally in Concurrent Büchi and Co-Büchi Games</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2022.33">10.4230/LIPIcs.FSTTCS.2022.33</a>
</li>
<li>
<span class="authors">Olivier Carton</span>
<span class="title">Ambiguity Through the Lens of Measure Theory</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2022.34">10.4230/LIPIcs.FSTTCS.2022.34</a>
</li>
<li>
<span class="authors">Abhishek De, Farzad Jafarrahmani, and Alexis Saurin</span>
<span class="title">Phase Semantics for Linear Logic with Least and Greatest Fixed Points</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2022.35">10.4230/LIPIcs.FSTTCS.2022.35</a>
</li>
<li>
<span class="authors">Rüdiger Ehlers and Sven Schewe</span>
<span class="title">Natural Colors of Infinite Words</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2022.36">10.4230/LIPIcs.FSTTCS.2022.36</a>
</li>
<li>
<span class="authors">Bernd Finkbeiner and Noemi Passing</span>
<span class="title">Synthesizing Dominant Strategies for Liveness</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2022.37">10.4230/LIPIcs.FSTTCS.2022.37</a>
</li>
<li>
<span class="authors">Moses Ganardi, Louis Jachiet, Markus Lohrey, and Thomas Schwentick</span>
<span class="title">Low-Latency Sliding Window Algorithms for Formal Languages</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2022.38">10.4230/LIPIcs.FSTTCS.2022.38</a>
</li>
<li>
<span class="authors">Mohit Garg and Suneel Sarswat</span>
<span class="title">The Design and Regulation of Exchanges: A Formal Approach</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2022.39">10.4230/LIPIcs.FSTTCS.2022.39</a>
</li>
<li>
<span class="authors">Shibashis Guha, Ismaël Jecker, Karoliina Lehtinen, and Martin Zimmermann</span>
<span class="title">Parikh Automata over Infinite Words</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2022.40">10.4230/LIPIcs.FSTTCS.2022.40</a>
</li>
<li>
<span class="authors">Florent Koechlin</span>
<span class="title">New Analytic Techniques for Proving the Inherent Ambiguity of Context-Free Languages</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2022.41">10.4230/LIPIcs.FSTTCS.2022.41</a>
</li>
<li>
<span class="authors">Orna Kupferman and Ofer Leshkowitz</span>
<span class="title">Synthesis of Privacy-Preserving Systems</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2022.42">10.4230/LIPIcs.FSTTCS.2022.42</a>
</li>
<li>
<span class="authors">Thomas Place and Marc Zeitoun</span>
<span class="title">A Generic Polynomial Time Approach to Separation by First-Order Logic Without Quantifier Alternation</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2022.43">10.4230/LIPIcs.FSTTCS.2022.43</a>
</li>
<li>
<span class="authors">K. S. Thejaswini, Pierre Ohlmann, and Marcin Jurdziński</span>
<span class="title">A Technique to Speed up Symmetric Attractor-Based Algorithms for Parity Games</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2022.44">10.4230/LIPIcs.FSTTCS.2022.44</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