default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID41st FSTTCS 2021 [virtual]
- Mikolaj Bojanczyk, Chandra Chekuri:
41st IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2021, Virtual Conference, December 15-17, 2021. LIPIcs 213, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2021, ISBN 978-3-95977-215-0 - Front Matter, Table of Contents, Preface, Conference Organization. 0:1-0:16
- Scott Aaronson:
BQP After 28 Years (Invited Talk). 1:1-1:1 - Javier Esparza:
State Complexity of Population Protocols (Invited Talk). 2:1-2:1 - Leslie Ann Goldberg:
Approximately Counting Graph Homomorphisms and Retractions (Invited Talk). 3:1-3:1 - Huijia (Rachel) Lin:
Indistinguishability Obfuscation from Well-Founded Assumptions (Invited Talk). 4:1-4:1 - Rahul Savani
:
The Complexity of Gradient Descent (Invited Talk). 5:1-5:2 - Susanne Albers, Maximilian Janke:
Scheduling in the Secretary Model. 6:1-6:22 - Eric Allender, Mahdi Cheraghchi, Dimitrios Myrisiotis, Harsha Tirumala, Ilya Volkovich:
One-Way Functions and a Conditional Variant of MKTP. 7:1-7:19 - Shashwat Banchhor, Rishikesh R. Gajjala, Yogish Sabharwal, Sandeep Sen:
Generalizations of Length Limited Huffman Coding for Hierarchical Memory Settings. 8:1-8:23 - Sylvia C. Boyd, Joseph Cheriyan, Arash Haddadan, Sharat Ibrahimpur:
Approximation Algorithms for Flexible Graph Connectivity. 9:1-9:14 - Sourav Chakraborty, Nikhil S. Mande, Rajat Mittal, Tulasimohan Molli, Manaswi Paraashar, Swagato Sanyal:
Tight Chang's-Lemma-Type Bounds for Boolean Functions. 10:1-10:22 - Diptarka Chakraborty, Debarati Das, Robert Krauthgamer:
Approximate Trace Reconstruction via Median String (In Average-Case). 11:1-11:23 - Diptarka Chakraborty, Kshitij Gajjar, Agastya Vibhuti Jha:
Approximating the Center Ranking Under Ulam. 12:1-12:21 - Arkadev Chattopadhyay, Ankit Garg, Suhail Sherif:
Towards Stronger Counterexamples to the Log-Approximate-Rank Conjecture. 13:1-13:16 - Suryajith Chillara:
Functional Lower Bounds for Restricted Arithmetic Circuits of Depth Four. 14:1-14:15 - Yogesh Dahiya, Meena Mahajan:
On (Simple) Decision Tree Rank. 15:1-15:16 - Samir Datta, Chetan Gupta, Rahul Jain, Anish Mukherjee, Vimal Raj Sharma, Raghunath Tewari:
Reachability and Matching in Single Crossing Minor Free Graphs. 16:1-16:16 - Yang Du, Ilya Volkovich:
Approximating the Number of Prime Factors Given an Oracle to Euler's Totient Function. 17:1-17:10 - Franziska Eberle, Nicole Megow, Lukas Nölke, Bertrand Simon, Andreas Wiese:
Fully Dynamic Algorithms for Knapsack Problems with Polylogarithmic Update Time. 18:1-18:17 - Taekang Eom, Seungjun Lee, Hee-Kap Ahn:
Largest Similar Copies of Convex Polygons in Polygonal Domains. 19:1-19:13 - Andre Esser, Robert Kübler, Floyd Zweydinger:
A Faster Algorithm for Finding Closest Pairs in Hamming Metric. 20:1-20:21 - Fedor V. Fomin, Petr A. Golovach, Tanmay Inamdar, Saket Saurabh:
ETH Tight Algorithms for Geometric Intersection Graphs: Now in Polynomial Space. 21:1-21:16 - Jugal Garg, Pooja Kulkarni, Aniket Murhekar:
On Fair and Efficient Allocations of Indivisible Public Goods. 22:1-22:19 - Chetan Gupta, Rahul Jain, Raghunath Tewari:
Time Space Optimal Algorithm for Computing Separators in Bounded Genus Graphs. 23:1-23:15 - Akhil Jalan, Dana Moshkovitz:
Near-Optimal Cayley Expanders for Abelian Groups. 24:1-24:23 - Telikepalli Kavitha:
Matchings, Critical Nodes, and Popular Solutions. 25:1-25:19 - Georgiy Klimenko, Benjamin Raichel:
Fast and Exact Convex Hull Simplification. 26:1-26:17 - Xin Li, Yu Zheng:
Lower Bounds and Improved Algorithms for Asymmetric Streaming Edit Distance and Longest Common Subsequence. 27:1-27:23 - Daniel Lokshtanov, Saket Saurabh, Subhash Suri, Jie Xue:
An ETH-Tight Algorithm for Multi-Team Formation. 28:1-28:9 - Daniel Lokshtanov, Vaishali Surianarayanan:
Dominating Set in Weakly Closed Graphs is Fixed Parameter Tractable. 29:1-29:17 - Meghana Nasre, Prajakta Nimbhorkar, Keshav Ranjan, Ankita Sarkar:
Popular Matchings in the Hospital-Residents Problem with Two-Sided Lower Quotas. 30:1-30:21 - Jaikumar Radhakrishnan, Aravind Srinivasan:
Property B: Two-Coloring Non-Uniform Hypergraphs. 31:1-31:8 - Eklavya Sharma:
Harmonic Algorithms for Packing d-Dimensional Cuboids into Bins. 32:1-32:22 - S. Akshay, Blaise Genest, Loïc Hélouët, S. Krishna, Sparsa Roychowdhury:
Resilience of Timed Systems. 33:1-33:22 - Emmanuel Arrighi, Henning Fernau, Stefan Hoffmann, Markus Holzer, Ismaël Jecker, Mateus de Oliveira Oliveira, Petra Wolf:
On the Complexity of Intersection Non-emptiness for Star-Free Language Classes. 34:1-34:15 - A. R. Balasubramanian:
Complexity of Coverability in Bounded Path Broadcast Networks. 35:1-35:16 - Bartosz Bednarczyk, Maja Orlowska, Anna Pacanowska, Tony Tan:
On Classical Decidable Logics Extended with Percentage Quantifiers and Arithmetics. 36:1-36:15 - Nicolas Bedon:
Branching Automata and Pomset Automata. 37:1-37:13 - Udi Boker, Karoliina Lehtinen:
History Determinism vs. Good for Gameness in Quantitative Automata. 38:1-38:20 - Benedikt Bollig, Arnaud Sangnier, Olivier Stietel:
Local First-Order Logic with Two Data Values. 39:1-39:15 - Filippo Bonchi, Alessandro Di Giorgio, Pawel Sobocinski:
Diagrammatic Polyhedral Algebra. 40:1-40:18 - Benjamin Bordais, Patricia Bouyer, Stéphane Le Roux:
From Local to Global Determinacy in Concurrent Graph Games. 41:1-41:14 - Krishnendu Chatterjee, Rasmus Ibsen-Jensen, Andreas Pavlogiannis:
Quantitative Verification on Product Graphs of Small Treewidth. 42:1-42:23 - Emmanuel Filiot, Sarah Winter:
Synthesizing Computable Functions from Rational Specifications over Infinite Words. 43:1-43:16 - Raúl Gutiérrez, Salvador Lucas, Miguel Vítores:
Confluence of Conditional Rewriting in Logic Form. 44:1-44:18 - Raveendra Holla, Nabarun Deka, Deepak D'Souza:
On the Expressive Equivalence of TPTL in the Pointwise and Continuous Semantics. 45:1-45:21 - Christopher Hugenroth:
Separating Regular Languages over Infinite Words with Respect to the Wagner Hierarchy. 46:1-46:13 - Liam Jordon, Philippe Moser:
Normal Sequences with Non-Maximal Automatic Complexity. 47:1-47:16 - Stefan Kiefer, Qiyi Tang:
Approximate Bisimulation Minimisation. 48:1-48:16 - Kentaro Kikuchi, Takahito Aoto:
Simple Derivation Systems for Proving Sufficient Completeness of Non-Terminating Term Rewriting Systems. 49:1-49:15 - Slawomir Lasota, Mohnish Pattathurajan:
Parikh Images of Register Automata. 50:1-50:14 - Dongho Lee, Valentin Perrelle, Benoît Valiron, Zhaowei Xu:
Concrete Categorical Model of a Quantum Circuit Description Language with Measurement. 51:1-51:20 - Jonni Virtema, Jana Hofmann, Bernd Finkbeiner, Juha Kontinen, Fan Yang:
Linear-Time Temporal Logic with Team Semantics: Expressivity and Complexity. 52:1-52:17
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 2025-12-14 23:09 CET 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 and maintained by:
the dblp computer science bibliography is funded and supported by:
