default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID40th FSTTCS 2020: Goa, India (Virtual Conference)
- Nitin Saxena
, Sunil Simon:
40th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2020, BITS Pilani, K K Birla Goa Campus, Goa, India (Virtual Conference), December 14-18, 2020. LIPIcs 182, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2020, ISBN 978-3-95977-174-0 - Front Matter, Table of Contents, Preface, Conference Organization. 0:1-0:16
- Sanjeev Arora:
The Quest for Mathematical Understanding of Deep Learning (Invited Talk). 1:1-1:1 - Albert Atserias:
Proofs of Soundness and Proof Search (Invited Talk). 2:1-2:1 - Yin Tat Lee:
Convex Optimization and Dynamic Data Structure (Invited Talk). 3:1-3:1 - Joël Ouaknine:
Holonomic Techniques, Periods, and Decision Problems (Invited Talk). 4:1-4:3 - Sanjit A. Seshia:
Algorithmic Improvisation for Dependable Intelligent Autonomy (Invited Talk). 5:1-5:3 - Amir Shpilka:
On Some Recent Advances in Algebraic Complexity (Invited Talk). 6:1-6:1 - Isolde Adler, Polly Fahey:
Faster Property Testers in a Variation of the Bounded Degree Model. 7:1-7:15 - Pankaj K. Agarwal, Hsien-Chih Chang, Kamesh Munagala, Erin Taylor, Emo Welzl:
Clustering Under Perturbation Stability in Near-Linear Time. 8:1-8:16 - Emmanuel Arrighi, Henning Fernau, Mateus de Oliveira Oliveira, Petra Wolf:
Width Notions for Ordering-Related Problems. 9:1-9:18 - Niranka Banerjee, Venkatesh Raman, Saket Saurabh:
Optimal Output Sensitive Fault Tolerant Cuts. 10:1-10:19 - Aaron Bernstein, Aditi Dudeja:
Online Matching with Recourse: Random Edge Arrivals. 11:1-11:16 - Olaf Beyersdorff, Joshua Blinkhorn, Meena Mahajan, Tomás Peitl, Gaurav Sood:
Hard QBFs for Merge Resolution. 12:1-12:15 - Anup Bhattacharya, Dishant Goyal, Ragesh Jaiswal, Amit Kumar:
On Sampling Based Algorithms for k-Means. 13:1-13:17 - Philip Bille, Inge Li Gørtz, Max Rishøj Pedersen, Eva Rotenberg, Teresa Anna Steiner:
String Indexing for Top-k Close Consecutive Occurrences. 14:1-14:17 - Davide Bilò, Tobias Friedrich, Pascal Lenzner, Anna Melnichenko, Louise Molitor:
Fair Tree Connection Games with Topology-Dependent Edge Cost. 15:1-15:15 - Alexander R. Block, Jeremiah Blocki, Elena Grigorescu, Shubhang Kulkarni, Minshen Zhu:
Locally Decodable/Correctable Codes for Insertions and Deletions. 16:1-16:17 - Édouard Bonnet, Nicolas Grelier, Tillmann Miltzow:
Maximum Clique in Disk-Like Intersection Graphs. 17:1-17:18 - Pratibha Choudhary, Lawqueen Kanesh, Daniel Lokshtanov, Fahad Panolan, Saket Saurabh:
Parameterized Complexity of Feedback Vertex Sets on Hypergraphs. 18:1-18:15 - Joshua Cook:
Size Bounds on Low Depth Circuits for Promise Majority. 19:1-19:14 - Pavel Dvorák, Bruno Loff:
Lower Bounds for Semi-adaptive Data Structures via Corruption. 20:1-20:15 - Karthik Gajulapalli, James A. Liu, Tung Mai, Vijay V. Vazirani:
Stability-Preserving, Time-Efficient Mechanisms for School Choice in Two Rounds. 21:1-21:15 - Prantar Ghosh:
New Verification Schemes for Frequency-Based Functions on Data Streams. 22:1-22:15 - Anupam Gupta, Ravishankar Krishnaswamy, Amit Kumar, Sahil Singla:
Online Carpooling Using Expander Decompositions. 23:1-23:14 - Sushmita Gupta, Pallavi Jain, Sanjukta Roy, Saket Saurabh, Meirav Zehavi:
On the (Parameterized) Complexity of Almost Stable Marriage. 24:1-24:17 - Telikepalli Kavitha:
Min-Cost Popular Matchings. 25:1-25:17 - Lidiya Khalidah binti Khalil, Christian Konrad:
Constructing Large Matchings via Query Access to a Maximal Matching Oracle. 26:1-26:15 - Yash Khanna, Anand Louis:
Planted Models for the Densest k-Subgraph Problem. 27:1-27:18 - Kishore Kothapalli, Shreyas Pai, Sriram V. Pemmaraju:
Sample-And-Gather: Fast Ruling Set Algorithms in the Low-Memory MPC Model. 28:1-28:18 - Nikhil S. Mande, Swagato Sanyal:
On Parity Decision Trees for Fourier-Sparse Boolean Functions. 29:1-29:16 - Nils Morawietz, Niels Grüttemeier, Christian Komusiewicz, Frank Sommer:
Colored Cut Games. 30:1-30:17 - Dana Moshkovitz, Justin Oh, David Zuckerman:
Randomness Efficient Noise Stability and Generalized Small Bias Sets. 31:1-31:16 - Shreyas Pai, Sriram V. Pemmaraju:
Connectivity Lower Bounds in Broadcast Congested Clique. 32:1-32:17 - Omer Wasim, Valerie King:
Fully Dynamic Sequential and Distributed Algorithms for MAX-CUT. 33:1-33:19 - C. Aiswarya, Paul Gastin:
Weighted Tiling Systems for Graphs: Evaluation Complexity. 34:1-34:17 - Shaull Almagor:
Process Symmetry in Probabilistic Transducers. 35:1-35:14 - Christel Baier, Florian Funke, Simon Jantsch, Toghrul Karimov, Engel Lefaucheux, Joël Ouaknine, Amaury Pouly, David Purser, Markus A. Whiteland:
Reachability in Dynamical Systems with Rounding. 36:1-36:17 - A. R. Balasubramanian:
Parameterized Complexity of Safety of Threshold Automata. 37:1-37:15 - Rebecca Bernemann, Benjamin Cabrera, Reiko Heckel, Barbara König:
Uncertainty Reasoning for Probabilistic Petri Nets via Bayesian Networks. 38:1-38:17 - Nathalie Bertrand, Patricia Bouyer, Anirban Majumdar:
Synthesizing Safe Coalition Strategies. 39:1-39:17 - Nathalie Bertrand, Nicolas Markey, Suman Sadhukhan, Ocan Sankur:
Dynamic Network Congestion Games. 40:1-40:16 - Udi Boker, Denis Kuperberg, Karoliina Lehtinen, Michal Skrzypczak:
On the Succinctness of Alternating Parity Good-For-Games Automata. 41:1-41:13 - Peter Chini, Prakash Saivasan:
A Framework for Consistency Algorithms. 42:1-42:17 - Oscar Darwin, Stefan Kiefer:
Equivalence of Hidden Markov Models with Continuous Observations. 43:1-43:14 - Manfred Droste, Sven Dziadek, Werner Kuich:
Nivat-Theorem and Logic for Weighted Pushdown Automata on Infinite Words. 44:1-44:14 - Henning Fernau, Petra Wolf:
Synchronization of Deterministic Visibly Push-Down Automata. 45:1-45:15 - Emmanuel Filiot, Christof Löding, Sarah Winter:
Synthesis from Weighted Specifications with Partial Domains over Finite Words. 46:1-46:16 - Paul Gastin, Sayan Mukherjee, B. Srivathsan:
Reachability for Updatable Timed Automata Made Faster and More Effective. 47:1-47:17 - Stefan Haar, Serge Haddad, Stefan Schwoon, Lina Ye:
Active Prediction for Discrete Event Systems. 48:1-48:16 - Stefan Kiefer, Qiyi Tang:
Comparing Labelled Markov Decision Processes. 49:1-49:16 - Michal Konecný, Florian Steinberg, Holger Thies:
Computable Analysis for Verified Exact Real Computation. 50:1-50:18 - Orna Kupferman, Noam Shenwald:
Perspective Games with Notifications. 51:1-51:16 - Roland Meyer, Sören van der Wall:
On the Complexity of Multi-Pushdown Games. 52:1-52:35 - Pawel Parys:
Higher-Order Nonemptiness Step by Step. 53:1-53:14 - Dominique Perrin, Andrew Ryzhikov:
The Degree of a Finite Set of Words. 54:1-54:16 - M. Praveen:
What You Must Remember When Transforming Datawords. 55:1-55:14 - Sven Schewe:
Minimising Good-For-Games Automata Is NP-Complete. 56:1-56:13 - Rishi Tulsyan, Rekha R. Pai, Deepak D'Souza:
Static Race Detection for RTOS Applications. 57:1-57:20 - Petra Wolf:
Synchronization Under Dynamic Constraints. 58:1-58:14
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2026-10-15 01:35 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated, funded, and maintained by:
Schloss Dagstuhl - Leibniz Center for Informatics is a member of the Leibniz Association and is funded by the federal government of Germany and the states of Germany, especially Saarland and Rhineland‑Palatinate.
