LIPIcs, Volume 182, FSTTCS 2020

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