<h2>LIPIcs, Volume 213, FSTTCS 2021</h2>
<ul>
<li>
<span class="authors">Mikołaj Bojańczyk and Chandra Chekuri</span>
<span class="title">LIPIcs, Volume 213, FSTTCS 2021, Complete Volume</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2021">10.4230/LIPIcs.FSTTCS.2021</a>
</li>
<li>
<span class="authors">Mikołaj Bojańczyk and Chandra Chekuri</span>
<span class="title">Front Matter, Table of Contents, Preface, Conference Organization</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2021.0">10.4230/LIPIcs.FSTTCS.2021.0</a>
</li>
<li>
<span class="authors">Scott Aaronson</span>
<span class="title">BQP After 28 Years (Invited Talk)</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2021.1">10.4230/LIPIcs.FSTTCS.2021.1</a>
</li>
<li>
<span class="authors">Javier Esparza</span>
<span class="title">State Complexity of Population Protocols (Invited Talk)</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2021.2">10.4230/LIPIcs.FSTTCS.2021.2</a>
</li>
<li>
<span class="authors">Leslie Ann Goldberg</span>
<span class="title">Approximately Counting Graph Homomorphisms and Retractions (Invited Talk)</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2021.3">10.4230/LIPIcs.FSTTCS.2021.3</a>
</li>
<li>
<span class="authors">Huijia (Rachel) Lin</span>
<span class="title">Indistinguishability Obfuscation from Well-Founded Assumptions (Invited Talk)</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2021.4">10.4230/LIPIcs.FSTTCS.2021.4</a>
</li>
<li>
<span class="authors">Rahul Savani</span>
<span class="title">The Complexity of Gradient Descent (Invited Talk)</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2021.5">10.4230/LIPIcs.FSTTCS.2021.5</a>
</li>
<li>
<span class="authors">Susanne Albers and Maximilian Janke</span>
<span class="title">Scheduling in the Secretary Model</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2021.6">10.4230/LIPIcs.FSTTCS.2021.6</a>
</li>
<li>
<span class="authors">Eric Allender, Mahdi Cheraghchi, Dimitrios Myrisiotis, Harsha Tirumala, and Ilya Volkovich</span>
<span class="title">One-Way Functions and a Conditional Variant of MKTP</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2021.7">10.4230/LIPIcs.FSTTCS.2021.7</a>
</li>
<li>
<span class="authors">Shashwat Banchhor, Rishikesh Gajjala, Yogish Sabharwal, and Sandeep Sen</span>
<span class="title">Generalizations of Length Limited Huffman Coding for Hierarchical Memory Settings</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2021.8">10.4230/LIPIcs.FSTTCS.2021.8</a>
</li>
<li>
<span class="authors">Sylvia Boyd, Joseph Cheriyan, Arash Haddadan, and Sharat Ibrahimpur</span>
<span class="title">Approximation Algorithms for Flexible Graph Connectivity</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2021.9">10.4230/LIPIcs.FSTTCS.2021.9</a>
</li>
<li>
<span class="authors">Sourav Chakraborty, Nikhil S. Mande, Rajat Mittal, Tulasimohan Molli, Manaswi Paraashar, and Swagato Sanyal</span>
<span class="title">Tight Chang’s-Lemma-Type Bounds for Boolean Functions</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2021.10">10.4230/LIPIcs.FSTTCS.2021.10</a>
</li>
<li>
<span class="authors">Diptarka Chakraborty, Debarati Das, and Robert Krauthgamer</span>
<span class="title">Approximate Trace Reconstruction via Median String (In Average-Case)</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2021.11">10.4230/LIPIcs.FSTTCS.2021.11</a>
</li>
<li>
<span class="authors">Diptarka Chakraborty, Kshitij Gajjar, and Agastya Vibhuti Jha</span>
<span class="title">Approximating the Center Ranking Under Ulam</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2021.12">10.4230/LIPIcs.FSTTCS.2021.12</a>
</li>
<li>
<span class="authors">Arkadev Chattopadhyay, Ankit Garg, and Suhail Sherif</span>
<span class="title">Towards Stronger Counterexamples to the Log-Approximate-Rank Conjecture</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2021.13">10.4230/LIPIcs.FSTTCS.2021.13</a>
</li>
<li>
<span class="authors">Suryajith Chillara</span>
<span class="title">Functional Lower Bounds for Restricted Arithmetic Circuits of Depth Four</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2021.14">10.4230/LIPIcs.FSTTCS.2021.14</a>
</li>
<li>
<span class="authors">Yogesh Dahiya and Meena Mahajan</span>
<span class="title">On (Simple) Decision Tree Rank</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2021.15">10.4230/LIPIcs.FSTTCS.2021.15</a>
</li>
<li>
<span class="authors">Samir Datta, Chetan Gupta, Rahul Jain, Anish Mukherjee, Vimal Raj Sharma, and Raghunath Tewari</span>
<span class="title">Reachability and Matching in Single Crossing Minor Free Graphs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2021.16">10.4230/LIPIcs.FSTTCS.2021.16</a>
</li>
<li>
<span class="authors">Yang Du and Ilya Volkovich</span>
<span class="title">Approximating the Number of Prime Factors Given an Oracle to Euler’s Totient Function</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2021.17">10.4230/LIPIcs.FSTTCS.2021.17</a>
</li>
<li>
<span class="authors">Franziska Eberle, Nicole Megow, Lukas Nölke, Bertrand Simon, and Andreas Wiese</span>
<span class="title">Fully Dynamic Algorithms for Knapsack Problems with Polylogarithmic Update Time</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2021.18">10.4230/LIPIcs.FSTTCS.2021.18</a>
</li>
<li>
<span class="authors">Taekang Eom, Seungjun Lee, and Hee-Kap Ahn</span>
<span class="title">Largest Similar Copies of Convex Polygons in Polygonal Domains</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2021.19">10.4230/LIPIcs.FSTTCS.2021.19</a>
</li>
<li>
<span class="authors">Andre Esser, Robert Kübler, and Floyd Zweydinger</span>
<span class="title">A Faster Algorithm for Finding Closest Pairs in Hamming Metric</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2021.20">10.4230/LIPIcs.FSTTCS.2021.20</a>
</li>
<li>
<span class="authors">Fedor V. Fomin, Petr A. Golovach, Tanmay Inamdar, and Saket Saurabh</span>
<span class="title">ETH Tight Algorithms for Geometric Intersection Graphs: Now in Polynomial Space</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2021.21">10.4230/LIPIcs.FSTTCS.2021.21</a>
</li>
<li>
<span class="authors">Jugal Garg, Pooja Kulkarni, and Aniket Murhekar</span>
<span class="title">On Fair and Efficient Allocations of Indivisible Public Goods</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2021.22">10.4230/LIPIcs.FSTTCS.2021.22</a>
</li>
<li>
<span class="authors">Chetan Gupta, Rahul Jain, and Raghunath Tewari</span>
<span class="title">Time Space Optimal Algorithm for Computing Separators in Bounded Genus Graphs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2021.23">10.4230/LIPIcs.FSTTCS.2021.23</a>
</li>
<li>
<span class="authors">Akhil Jalan and Dana Moshkovitz</span>
<span class="title">Near-Optimal Cayley Expanders for Abelian Groups</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2021.24">10.4230/LIPIcs.FSTTCS.2021.24</a>
</li>
<li>
<span class="authors">Telikepalli Kavitha</span>
<span class="title">Matchings, Critical Nodes, and Popular Solutions</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2021.25">10.4230/LIPIcs.FSTTCS.2021.25</a>
</li>
<li>
<span class="authors">Georgiy Klimenko and Benjamin Raichel</span>
<span class="title">Fast and Exact Convex Hull Simplification</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2021.26">10.4230/LIPIcs.FSTTCS.2021.26</a>
</li>
<li>
<span class="authors">Xin Li and Yu Zheng</span>
<span class="title">Lower Bounds and Improved Algorithms for Asymmetric Streaming Edit Distance and Longest Common Subsequence</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2021.27">10.4230/LIPIcs.FSTTCS.2021.27</a>
</li>
<li>
<span class="authors">Daniel Lokshtanov, Saket Saurabh, Subhash Suri, and Jie Xue</span>
<span class="title">An ETH-Tight Algorithm for Multi-Team Formation</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2021.28">10.4230/LIPIcs.FSTTCS.2021.28</a>
</li>
<li>
<span class="authors">Daniel Lokshtanov and Vaishali Surianarayanan</span>
<span class="title">Dominating Set in Weakly Closed Graphs is Fixed Parameter Tractable</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2021.29">10.4230/LIPIcs.FSTTCS.2021.29</a>
</li>
<li>
<span class="authors">Meghana Nasre, Prajakta Nimbhorkar, Keshav Ranjan, and Ankita Sarkar</span>
<span class="title">Popular Matchings in the Hospital-Residents Problem with Two-Sided Lower Quotas</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2021.30">10.4230/LIPIcs.FSTTCS.2021.30</a>
</li>
<li>
<span class="authors">Jaikumar Radhakrishnan and Aravind Srinivasan</span>
<span class="title">Property B: Two-Coloring Non-Uniform Hypergraphs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2021.31">10.4230/LIPIcs.FSTTCS.2021.31</a>
</li>
<li>
<span class="authors">Eklavya Sharma</span>
<span class="title">Harmonic Algorithms for Packing d-Dimensional Cuboids into Bins</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2021.32">10.4230/LIPIcs.FSTTCS.2021.32</a>
</li>
<li>
<span class="authors">S. Akshay, Blaise Genest, Loïc Hélouët, S. Krishna, and Sparsa Roychowdhury</span>
<span class="title">Resilience of Timed Systems</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2021.33">10.4230/LIPIcs.FSTTCS.2021.33</a>
</li>
<li>
<span class="authors">Emmanuel Arrighi, Henning Fernau, Stefan Hoffmann, Markus Holzer, Ismaël Jecker, Mateus de Oliveira Oliveira, and Petra Wolf</span>
<span class="title">On the Complexity of Intersection Non-emptiness for Star-Free Language Classes</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2021.34">10.4230/LIPIcs.FSTTCS.2021.34</a>
</li>
<li>
<span class="authors">A. R. Balasubramanian</span>
<span class="title">Complexity of Coverability in Bounded Path Broadcast Networks</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2021.35">10.4230/LIPIcs.FSTTCS.2021.35</a>
</li>
<li>
<span class="authors">Bartosz Bednarczyk, Maja Orłowska, Anna Pacanowska, and Tony Tan</span>
<span class="title">On Classical Decidable Logics Extended with Percentage Quantifiers and Arithmetics</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2021.36">10.4230/LIPIcs.FSTTCS.2021.36</a>
</li>
<li>
<span class="authors">Nicolas Bedon</span>
<span class="title">Branching Automata and Pomset Automata</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2021.37">10.4230/LIPIcs.FSTTCS.2021.37</a>
</li>
<li>
<span class="authors">Udi Boker and Karoliina Lehtinen</span>
<span class="title">History Determinism vs. Good for Gameness in Quantitative Automata</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2021.38">10.4230/LIPIcs.FSTTCS.2021.38</a>
</li>
<li>
<span class="authors">Benedikt Bollig, Arnaud Sangnier, and Olivier Stietel</span>
<span class="title">Local First-Order Logic with Two Data Values</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2021.39">10.4230/LIPIcs.FSTTCS.2021.39</a>
</li>
<li>
<span class="authors">Filippo Bonchi, Alessandro Di Giorgio, and Paweł Sobociński</span>
<span class="title">Diagrammatic Polyhedral Algebra</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2021.40">10.4230/LIPIcs.FSTTCS.2021.40</a>
</li>
<li>
<span class="authors">Benjamin Bordais, Patricia Bouyer, and Stéphane Le Roux</span>
<span class="title">From Local to Global Determinacy in Concurrent Graph Games</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2021.41">10.4230/LIPIcs.FSTTCS.2021.41</a>
</li>
<li>
<span class="authors">Krishnendu Chatterjee, Rasmus Ibsen-Jensen, and Andreas Pavlogiannis</span>
<span class="title">Quantitative Verification on Product Graphs of Small Treewidth</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2021.42">10.4230/LIPIcs.FSTTCS.2021.42</a>
</li>
<li>
<span class="authors">Emmanuel Filiot and Sarah Winter</span>
<span class="title">Synthesizing Computable Functions from Rational Specifications over Infinite Words</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2021.43">10.4230/LIPIcs.FSTTCS.2021.43</a>
</li>
<li>
<span class="authors">Raúl Gutiérrez, Salvador Lucas, and Miguel Vítores</span>
<span class="title">Confluence of Conditional Rewriting in Logic Form</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2021.44">10.4230/LIPIcs.FSTTCS.2021.44</a>
</li>
<li>
<span class="authors">Raveendra Holla, Nabarun Deka, and Deepak D'Souza</span>
<span class="title">On the Expressive Equivalence of TPTL in the Pointwise and Continuous Semantics</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2021.45">10.4230/LIPIcs.FSTTCS.2021.45</a>
</li>
<li>
<span class="authors">Christopher Hugenroth</span>
<span class="title">Separating Regular Languages over Infinite Words with Respect to the Wagner Hierarchy</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2021.46">10.4230/LIPIcs.FSTTCS.2021.46</a>
</li>
<li>
<span class="authors">Liam Jordon and Philippe Moser</span>
<span class="title">Normal Sequences with Non-Maximal Automatic Complexity</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2021.47">10.4230/LIPIcs.FSTTCS.2021.47</a>
</li>
<li>
<span class="authors">Stefan Kiefer and Qiyi Tang</span>
<span class="title">Approximate Bisimulation Minimisation</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2021.48">10.4230/LIPIcs.FSTTCS.2021.48</a>
</li>
<li>
<span class="authors">Kentaro Kikuchi and Takahito Aoto</span>
<span class="title">Simple Derivation Systems for Proving Sufficient Completeness of Non-Terminating Term Rewriting Systems</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2021.49">10.4230/LIPIcs.FSTTCS.2021.49</a>
</li>
<li>
<span class="authors">Sławomir Lasota and Mohnish Pattathurajan</span>
<span class="title">Parikh Images of Register Automata</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2021.50">10.4230/LIPIcs.FSTTCS.2021.50</a>
</li>
<li>
<span class="authors">Dongho Lee, Valentin Perrelle, Benoît Valiron, and Zhaowei Xu</span>
<span class="title">Concrete Categorical Model of a Quantum Circuit Description Language with Measurement</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2021.51">10.4230/LIPIcs.FSTTCS.2021.51</a>
</li>
<li>
<span class="authors">Jonni Virtema, Jana Hofmann, Bernd Finkbeiner, Juha Kontinen, and Fan Yang</span>
<span class="title">Linear-Time Temporal Logic with Team Semantics: Expressivity and Complexity</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2021.52">10.4230/LIPIcs.FSTTCS.2021.52</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