<h2>LIPIcs, Volume 182, FSTTCS 2020</h2>
<ul>
<li>
<span class="authors">Nitin Saxena and Sunil Simon</span>
<span class="title">LIPIcs, Volume 182, FSTTCS 2020, Complete Volume</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2020">10.4230/LIPIcs.FSTTCS.2020</a>
</li>
<li>
<span class="authors">Nitin Saxena and Sunil Simon</span>
<span class="title">Front Matter, Table of Contents, Preface, Conference Organization</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2020.0">10.4230/LIPIcs.FSTTCS.2020.0</a>
</li>
<li>
<span class="authors">Sanjeev Arora</span>
<span class="title">The Quest for Mathematical Understanding of Deep Learning (Invited Talk)</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2020.1">10.4230/LIPIcs.FSTTCS.2020.1</a>
</li>
<li>
<span class="authors">Albert Atserias</span>
<span class="title">Proofs of Soundness and Proof Search (Invited Talk)</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2020.2">10.4230/LIPIcs.FSTTCS.2020.2</a>
</li>
<li>
<span class="authors">Yin Tat Lee</span>
<span class="title">Convex Optimization and Dynamic Data Structure (Invited Talk)</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2020.3">10.4230/LIPIcs.FSTTCS.2020.3</a>
</li>
<li>
<span class="authors">Joël Ouaknine</span>
<span class="title">Holonomic Techniques, Periods, and Decision Problems (Invited Talk)</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2020.4">10.4230/LIPIcs.FSTTCS.2020.4</a>
</li>
<li>
<span class="authors">Sanjit A. Seshia</span>
<span class="title">Algorithmic Improvisation for Dependable Intelligent Autonomy (Invited Talk)</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2020.5">10.4230/LIPIcs.FSTTCS.2020.5</a>
</li>
<li>
<span class="authors">Amir Shpilka</span>
<span class="title">On Some Recent Advances in Algebraic Complexity (Invited Talk)</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2020.6">10.4230/LIPIcs.FSTTCS.2020.6</a>
</li>
<li>
<span class="authors">Isolde Adler and Polly Fahey</span>
<span class="title">Faster Property Testers in a Variation of the Bounded Degree Model</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2020.7">10.4230/LIPIcs.FSTTCS.2020.7</a>
</li>
<li>
<span class="authors">Pankaj K. Agarwal, Hsien-Chih Chang, Kamesh Munagala, Erin Taylor, and Emo Welzl</span>
<span class="title">Clustering Under Perturbation Stability in Near-Linear Time</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2020.8">10.4230/LIPIcs.FSTTCS.2020.8</a>
</li>
<li>
<span class="authors">Emmanuel Arrighi, Henning Fernau, Mateus de Oliveira Oliveira, and Petra Wolf</span>
<span class="title">Width Notions for Ordering-Related Problems</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2020.9">10.4230/LIPIcs.FSTTCS.2020.9</a>
</li>
<li>
<span class="authors">Niranka Banerjee, Venkatesh Raman, and Saket Saurabh</span>
<span class="title">Optimal Output Sensitive Fault Tolerant Cuts</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2020.10">10.4230/LIPIcs.FSTTCS.2020.10</a>
</li>
<li>
<span class="authors">Aaron Bernstein and Aditi Dudeja</span>
<span class="title">Online Matching with Recourse: Random Edge Arrivals</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2020.11">10.4230/LIPIcs.FSTTCS.2020.11</a>
</li>
<li>
<span class="authors">Olaf Beyersdorff, Joshua Blinkhorn, Meena Mahajan, Tomáš Peitl, and Gaurav Sood</span>
<span class="title">Hard QBFs for Merge Resolution</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2020.12">10.4230/LIPIcs.FSTTCS.2020.12</a>
</li>
<li>
<span class="authors">Anup Bhattacharya, Dishant Goyal, Ragesh Jaiswal, and Amit Kumar</span>
<span class="title">On Sampling Based Algorithms for k-Means</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2020.13">10.4230/LIPIcs.FSTTCS.2020.13</a>
</li>
<li>
<span class="authors">Philip Bille, Inge Li Gørtz, Max Rishøj Pedersen, Eva Rotenberg, and Teresa Anna Steiner</span>
<span class="title">String Indexing for Top-k Close Consecutive Occurrences</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2020.14">10.4230/LIPIcs.FSTTCS.2020.14</a>
</li>
<li>
<span class="authors">Davide Bilò, Tobias Friedrich, Pascal Lenzner, Anna Melnichenko, and Louise Molitor</span>
<span class="title">Fair Tree Connection Games with Topology-Dependent Edge Cost</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2020.15">10.4230/LIPIcs.FSTTCS.2020.15</a>
</li>
<li>
<span class="authors">Alexander R. Block, Jeremiah Blocki, Elena Grigorescu, Shubhang Kulkarni, and Minshen Zhu</span>
<span class="title">Locally Decodable/Correctable Codes for Insertions and Deletions</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2020.16">10.4230/LIPIcs.FSTTCS.2020.16</a>
</li>
<li>
<span class="authors">Édouard Bonnet, Nicolas Grelier, and Tillmann Miltzow</span>
<span class="title">Maximum Clique in Disk-Like Intersection Graphs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2020.17">10.4230/LIPIcs.FSTTCS.2020.17</a>
</li>
<li>
<span class="authors">Pratibha Choudhary, Lawqueen Kanesh, Daniel Lokshtanov, Fahad Panolan, and Saket Saurabh</span>
<span class="title">Parameterized Complexity of Feedback Vertex Sets on Hypergraphs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2020.18">10.4230/LIPIcs.FSTTCS.2020.18</a>
</li>
<li>
<span class="authors">Joshua Cook</span>
<span class="title">Size Bounds on Low Depth Circuits for Promise Majority</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2020.19">10.4230/LIPIcs.FSTTCS.2020.19</a>
</li>
<li>
<span class="authors">Pavel Dvořák and Bruno Loff</span>
<span class="title">Lower Bounds for Semi-adaptive Data Structures via Corruption</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2020.20">10.4230/LIPIcs.FSTTCS.2020.20</a>
</li>
<li>
<span class="authors">Karthik Gajulapalli, James A. Liu, Tung Mai, and Vijay V. Vazirani</span>
<span class="title">Stability-Preserving, Time-Efficient Mechanisms for School Choice in Two Rounds</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2020.21">10.4230/LIPIcs.FSTTCS.2020.21</a>
</li>
<li>
<span class="authors">Prantar Ghosh</span>
<span class="title">New Verification Schemes for Frequency-Based Functions on Data Streams</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2020.22">10.4230/LIPIcs.FSTTCS.2020.22</a>
</li>
<li>
<span class="authors">Anupam Gupta, Ravishankar Krishnaswamy, Amit Kumar, and Sahil Singla</span>
<span class="title">Online Carpooling Using Expander Decompositions</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2020.23">10.4230/LIPIcs.FSTTCS.2020.23</a>
</li>
<li>
<span class="authors">Sushmita Gupta, Pallavi Jain, Sanjukta Roy, Saket Saurabh, and Meirav Zehavi</span>
<span class="title">On the (Parameterized) Complexity of Almost Stable Marriage</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2020.24">10.4230/LIPIcs.FSTTCS.2020.24</a>
</li>
<li>
<span class="authors">Telikepalli Kavitha</span>
<span class="title">Min-Cost Popular Matchings</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2020.25">10.4230/LIPIcs.FSTTCS.2020.25</a>
</li>
<li>
<span class="authors">Lidiya Khalidah binti Khalil and Christian Konrad</span>
<span class="title">Constructing Large Matchings via Query Access to a Maximal Matching Oracle</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2020.26">10.4230/LIPIcs.FSTTCS.2020.26</a>
</li>
<li>
<span class="authors">Yash Khanna and Anand Louis</span>
<span class="title">Planted Models for the Densest k-Subgraph Problem</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2020.27">10.4230/LIPIcs.FSTTCS.2020.27</a>
</li>
<li>
<span class="authors">Kishore Kothapalli, Shreyas Pai, and Sriram V. Pemmaraju</span>
<span class="title">Sample-And-Gather: Fast Ruling Set Algorithms in the Low-Memory MPC Model</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2020.28">10.4230/LIPIcs.FSTTCS.2020.28</a>
</li>
<li>
<span class="authors">Nikhil S. Mande and Swagato Sanyal</span>
<span class="title">On Parity Decision Trees for Fourier-Sparse Boolean Functions</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2020.29">10.4230/LIPIcs.FSTTCS.2020.29</a>
</li>
<li>
<span class="authors">Nils Morawietz, Niels Grüttemeier, Christian Komusiewicz, and Frank Sommer</span>
<span class="title">Colored Cut Games</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2020.30">10.4230/LIPIcs.FSTTCS.2020.30</a>
</li>
<li>
<span class="authors">Dana Moshkovitz, Justin Oh, and David Zuckerman</span>
<span class="title">Randomness Efficient Noise Stability and Generalized Small Bias Sets</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2020.31">10.4230/LIPIcs.FSTTCS.2020.31</a>
</li>
<li>
<span class="authors">Shreyas Pai and Sriram V. Pemmaraju</span>
<span class="title">Connectivity Lower Bounds in Broadcast Congested Clique</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2020.32">10.4230/LIPIcs.FSTTCS.2020.32</a>
</li>
<li>
<span class="authors">Omer Wasim and Valerie King</span>
<span class="title">Fully Dynamic Sequential and Distributed Algorithms for MAX-CUT</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2020.33">10.4230/LIPIcs.FSTTCS.2020.33</a>
</li>
<li>
<span class="authors">C. Aiswarya and Paul Gastin</span>
<span class="title">Weighted Tiling Systems for Graphs: Evaluation Complexity</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2020.34">10.4230/LIPIcs.FSTTCS.2020.34</a>
</li>
<li>
<span class="authors">Shaull Almagor</span>
<span class="title">Process Symmetry in Probabilistic Transducers</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2020.35">10.4230/LIPIcs.FSTTCS.2020.35</a>
</li>
<li>
<span class="authors">Christel Baier, Florian Funke, Simon Jantsch, Toghrul Karimov, Engel Lefaucheux, Joël Ouaknine, Amaury Pouly, David Purser, and Markus A. Whiteland</span>
<span class="title">Reachability in Dynamical Systems with Rounding</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2020.36">10.4230/LIPIcs.FSTTCS.2020.36</a>
</li>
<li>
<span class="authors">A. R. Balasubramanian</span>
<span class="title">Parameterized Complexity of Safety of Threshold Automata</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2020.37">10.4230/LIPIcs.FSTTCS.2020.37</a>
</li>
<li>
<span class="authors">Rebecca Bernemann, Benjamin Cabrera, Reiko Heckel, and Barbara König</span>
<span class="title">Uncertainty Reasoning for Probabilistic Petri Nets via Bayesian Networks</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2020.38">10.4230/LIPIcs.FSTTCS.2020.38</a>
</li>
<li>
<span class="authors">Nathalie Bertrand, Patricia Bouyer, and Anirban Majumdar</span>
<span class="title">Synthesizing Safe Coalition Strategies</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2020.39">10.4230/LIPIcs.FSTTCS.2020.39</a>
</li>
<li>
<span class="authors">Nathalie Bertrand, Nicolas Markey, Suman Sadhukhan, and Ocan Sankur</span>
<span class="title">Dynamic Network Congestion Games</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2020.40">10.4230/LIPIcs.FSTTCS.2020.40</a>
</li>
<li>
<span class="authors">Udi Boker, Denis Kuperberg, Karoliina Lehtinen, and Michał Skrzypczak</span>
<span class="title">On the Succinctness of Alternating Parity Good-For-Games Automata</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2020.41">10.4230/LIPIcs.FSTTCS.2020.41</a>
</li>
<li>
<span class="authors">Peter Chini and Prakash Saivasan</span>
<span class="title">A Framework for Consistency Algorithms</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2020.42">10.4230/LIPIcs.FSTTCS.2020.42</a>
</li>
<li>
<span class="authors">Oscar Darwin and Stefan Kiefer</span>
<span class="title">Equivalence of Hidden Markov Models with Continuous Observations</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2020.43">10.4230/LIPIcs.FSTTCS.2020.43</a>
</li>
<li>
<span class="authors">Manfred Droste, Sven Dziadek, and Werner Kuich</span>
<span class="title">Nivat-Theorem and Logic for Weighted Pushdown Automata on Infinite Words</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2020.44">10.4230/LIPIcs.FSTTCS.2020.44</a>
</li>
<li>
<span class="authors">Henning Fernau and Petra Wolf</span>
<span class="title">Synchronization of Deterministic Visibly Push-Down Automata</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2020.45">10.4230/LIPIcs.FSTTCS.2020.45</a>
</li>
<li>
<span class="authors">Emmanuel Filiot, Christof Löding, and Sarah Winter</span>
<span class="title">Synthesis from Weighted Specifications with Partial Domains over Finite Words</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2020.46">10.4230/LIPIcs.FSTTCS.2020.46</a>
</li>
<li>
<span class="authors">Paul Gastin, Sayan Mukherjee, and B Srivathsan</span>
<span class="title">Reachability for Updatable Timed Automata Made Faster and More Effective</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2020.47">10.4230/LIPIcs.FSTTCS.2020.47</a>
</li>
<li>
<span class="authors">Stefan Haar, Serge Haddad, Stefan Schwoon, and Lina Ye</span>
<span class="title">Active Prediction for Discrete Event Systems</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2020.48">10.4230/LIPIcs.FSTTCS.2020.48</a>
</li>
<li>
<span class="authors">Stefan Kiefer and Qiyi Tang</span>
<span class="title">Comparing Labelled Markov Decision Processes</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2020.49">10.4230/LIPIcs.FSTTCS.2020.49</a>
</li>
<li>
<span class="authors">Michal Konečný, Florian Steinberg, and Holger Thies</span>
<span class="title">Computable Analysis for Verified Exact Real Computation</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2020.50">10.4230/LIPIcs.FSTTCS.2020.50</a>
</li>
<li>
<span class="authors">Orna Kupferman and Noam Shenwald</span>
<span class="title">Perspective Games with Notifications</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2020.51">10.4230/LIPIcs.FSTTCS.2020.51</a>
</li>
<li>
<span class="authors">Roland Meyer and Sören van der Wall</span>
<span class="title">On the Complexity of Multi-Pushdown Games</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2020.52">10.4230/LIPIcs.FSTTCS.2020.52</a>
</li>
<li>
<span class="authors">Paweł Parys</span>
<span class="title">Higher-Order Nonemptiness Step by Step</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2020.53">10.4230/LIPIcs.FSTTCS.2020.53</a>
</li>
<li>
<span class="authors">Dominique Perrin and Andrew Ryzhikov</span>
<span class="title">The Degree of a Finite Set of Words</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2020.54">10.4230/LIPIcs.FSTTCS.2020.54</a>
</li>
<li>
<span class="authors">M. Praveen</span>
<span class="title">What You Must Remember When Transforming Datawords</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2020.55">10.4230/LIPIcs.FSTTCS.2020.55</a>
</li>
<li>
<span class="authors">Sven Schewe</span>
<span class="title">Minimising Good-For-Games Automata Is NP-Complete</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2020.56">10.4230/LIPIcs.FSTTCS.2020.56</a>
</li>
<li>
<span class="authors">Rishi Tulsyan, Rekha Pai, and Deepak D'Souza</span>
<span class="title">Static Race Detection for RTOS Applications</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2020.57">10.4230/LIPIcs.FSTTCS.2020.57</a>
</li>
<li>
<span class="authors">Petra Wolf</span>
<span class="title">Synchronization Under Dynamic Constraints</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.FSTTCS.2020.58">10.4230/LIPIcs.FSTTCS.2020.58</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