LIPIcs, Volume 213, FSTTCS 2021

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