| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | Shashwat Banchhor, Rishikesh R. Gajjala, Yogish Sabharwal, Sandeep Sen |
Generalizations of Length Limited Huffman Coding for Hierarchical Memory Settings.  |
FSTTCS  |
2021 |
DBLP DOI BibTeX RDF |
|
| 1 | Emmanuel Arrighi, Henning Fernau, Stefan Hoffmann 0001, Markus Holzer 0001, Ismaël Jecker, Mateus de Oliveira Oliveira, Petra Wolf 0002 |
On the Complexity of Intersection Non-emptiness for Star-Free Language Classes. |
FSTTCS |
2021 |
DBLP DOI BibTeX RDF |
|
| 1 | Jugal Garg, Pooja Kulkarni, Aniket Murhekar |
On Fair and Efficient Allocations of Indivisible Public Goods. |
FSTTCS |
2021 |
DBLP DOI BibTeX RDF |
|
| 1 | |
Front Matter, Table of Contents, Preface, Conference Organization. |
FSTTCS |
2021 |
DBLP DOI BibTeX RDF |
|
| 1 | Filippo Bonchi, Alessandro Di Giorgio 0002, Pawel Sobocinski 0001 |
Diagrammatic Polyhedral Algebra. |
FSTTCS |
2021 |
DBLP DOI BibTeX RDF |
|
| 1 | Arkadev Chattopadhyay, Ankit Garg, Suhail Sherif |
Towards Stronger Counterexamples to the Log-Approximate-Rank Conjecture. |
FSTTCS |
2021 |
DBLP DOI BibTeX RDF |
|
| 1 | Raúl Gutiérrez, Salvador Lucas, Miguel Vítores |
Confluence of Conditional Rewriting in Logic Form. |
FSTTCS |
2021 |
DBLP DOI BibTeX RDF |
|
| 1 | Franziska Eberle, Nicole Megow, Lukas Nölke, Bertrand Simon 0001, Andreas Wiese |
Fully Dynamic Algorithms for Knapsack Problems with Polylogarithmic Update Time. |
FSTTCS |
2021 |
DBLP DOI BibTeX RDF |
|
| 1 | Huijia (Rachel) Lin |
Indistinguishability Obfuscation from Well-Founded Assumptions (Invited Talk). |
FSTTCS |
2021 |
DBLP DOI BibTeX RDF |
|
| 1 | Samir Datta, Chetan Gupta 0002, Rahul Jain 0015, Anish Mukherjee 0001, Vimal Raj Sharma, Raghunath Tewari |
Reachability and Matching in Single Crossing Minor Free Graphs. |
FSTTCS |
2021 |
DBLP DOI BibTeX RDF |
|
| 1 | Yogesh Dahiya, Meena Mahajan |
On (Simple) Decision Tree Rank. |
FSTTCS |
2021 |
DBLP DOI BibTeX RDF |
|
| 1 | Emmanuel Filiot, Sarah Winter |
Synthesizing Computable Functions from Rational Specifications over Infinite Words. |
FSTTCS |
2021 |
DBLP DOI BibTeX RDF |
|
| 1 | A. R. Balasubramanian |
Complexity of Coverability in Bounded Path Broadcast Networks. |
FSTTCS |
2021 |
DBLP DOI BibTeX RDF |
|
| 1 | Nicolas Bedon |
Branching Automata and Pomset Automata. |
FSTTCS |
2021 |
DBLP DOI BibTeX RDF |
|
| 1 | Diptarka Chakraborty, Debarati Das 0001, Robert Krauthgamer |
Approximate Trace Reconstruction via Median String (In Average-Case). |
FSTTCS |
2021 |
DBLP DOI BibTeX RDF |
|
| 1 | Daniel Lokshtanov, Saket Saurabh 0001, Subhash Suri, Jie Xue 0003 |
An ETH-Tight Algorithm for Multi-Team Formation. |
FSTTCS |
2021 |
DBLP DOI BibTeX RDF |
|
| 1 | Udi Boker, Karoliina Lehtinen |
History Determinism vs. Good for Gameness in Quantitative Automata. |
FSTTCS |
2021 |
DBLP DOI BibTeX RDF |
|
| 1 | Benjamin Bordais, Patricia Bouyer, Stéphane Le Roux 0001 |
From Local to Global Determinacy in Concurrent Graph Games. |
FSTTCS |
2021 |
DBLP DOI BibTeX RDF |
|
| 1 | Akhil Jalan, Dana Moshkovitz |
Near-Optimal Cayley Expanders for Abelian Groups. |
FSTTCS |
2021 |
DBLP DOI BibTeX RDF |
|
| 1 | Rahul Savani |
The Complexity of Gradient Descent (Invited Talk). |
FSTTCS |
2021 |
DBLP DOI BibTeX RDF |
|
| 1 | Krishnendu Chatterjee, Rasmus Ibsen-Jensen, Andreas Pavlogiannis |
Quantitative Verification on Product Graphs of Small Treewidth. |
FSTTCS |
2021 |
DBLP DOI BibTeX RDF |
|
| 1 | Sylvia C. Boyd, Joseph Cheriyan, Arash Haddadan, Sharat Ibrahimpur |
Approximation Algorithms for Flexible Graph Connectivity. |
FSTTCS |
2021 |
DBLP DOI BibTeX RDF |
|
| 1 | Meghana Nasre, Prajakta Nimbhorkar, Keshav Ranjan, Ankita Sarkar |
Popular Matchings in the Hospital-Residents Problem with Two-Sided Lower Quotas. |
FSTTCS |
2021 |
DBLP DOI BibTeX RDF |
|
| 1 | Georgiy Klimenko, Benjamin Raichel |
Fast and Exact Convex Hull Simplification. |
FSTTCS |
2021 |
DBLP DOI BibTeX RDF |
|
| 1 | Chetan Gupta 0002, Rahul Jain 0015, Raghunath Tewari |
Time Space Optimal Algorithm for Computing Separators in Bounded Genus Graphs. |
FSTTCS |
2021 |
DBLP DOI BibTeX RDF |
|
| 1 | Daniel Lokshtanov, Vaishali Surianarayanan |
Dominating Set in Weakly Closed Graphs is Fixed Parameter Tractable. |
FSTTCS |
2021 |
DBLP DOI BibTeX RDF |
|
| 1 | S. Akshay 0001, Blaise Genest, Loïc Hélouët, S. Krishna 0004, Sparsa Roychowdhury |
Resilience of Timed Systems. |
FSTTCS |
2021 |
DBLP DOI BibTeX RDF |
|
| 1 | Mikolaj Bojanczyk, Chandra Chekuri (eds.) |
41st IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2021, December 15-17, 2021, Virtual Conference. |
FSTTCS |
2021 |
DBLP BibTeX RDF |
|
| 1 | Javier Esparza |
State Complexity of Population Protocols (Invited Talk). |
FSTTCS |
2021 |
DBLP DOI BibTeX RDF |
|
| 1 | Eklavya Sharma |
Harmonic Algorithms for Packing d-Dimensional Cuboids into Bins. |
FSTTCS |
2021 |
DBLP DOI BibTeX RDF |
|
| 1 | Xin Li 0006, Yu Zheng 0014 |
Lower Bounds and Improved Algorithms for Asymmetric Streaming Edit Distance and Longest Common Subsequence. |
FSTTCS |
2021 |
DBLP DOI BibTeX RDF |
|
| 1 | Sourav Chakraborty 0001, Nikhil S. Mande, Rajat Mittal, Tulasimohan Molli, Manaswi Paraashar, Swagato Sanyal |
Tight Chang's-Lemma-Type Bounds for Boolean Functions. |
FSTTCS |
2021 |
DBLP DOI BibTeX RDF |
|
| 1 | Fedor V. Fomin, Petr A. Golovach, Tanmay Inamdar 0002, Saket Saurabh 0001 |
ETH Tight Algorithms for Geometric Intersection Graphs: Now in Polynomial Space. |
FSTTCS |
2021 |
DBLP DOI BibTeX RDF |
|
| 1 | Leslie Ann Goldberg |
Approximately Counting Graph Homomorphisms and Retractions (Invited Talk). |
FSTTCS |
2021 |
DBLP DOI BibTeX RDF |
|
| 1 | Susanne Albers, Maximilian Janke |
Scheduling in the Secretary Model. |
FSTTCS |
2021 |
DBLP DOI BibTeX RDF |
|
| 1 | Slawomir Lasota 0001, Mohnish Pattathurajan |
Parikh Images of Register Automata. |
FSTTCS |
2021 |
DBLP DOI BibTeX RDF |
|
| 1 | Dongho Lee, Valentin Perrelle, Benoît Valiron, Zhaowei Xu |
Concrete Categorical Model of a Quantum Circuit Description Language with Measurement. |
FSTTCS |
2021 |
DBLP DOI BibTeX RDF |
|
| 1 | Taekang Eom, Seungjun Lee, Hee-Kap Ahn |
Largest Similar Copies of Convex Polygons in Polygonal Domains. |
FSTTCS |
2021 |
DBLP DOI BibTeX RDF |
|
| 1 | Jaikumar Radhakrishnan, Aravind Srinivasan |
Property B: Two-Coloring Non-Uniform Hypergraphs. |
FSTTCS |
2021 |
DBLP DOI BibTeX RDF |
|
| 1 | Scott Aaronson |
BQP After 28 Years (Invited Talk). |
FSTTCS |
2021 |
DBLP DOI BibTeX RDF |
|
| 1 | Jonni Virtema, Jana Hofmann, Bernd Finkbeiner, Juha Kontinen, Fan Yang 0004 |
Linear-Time Temporal Logic with Team Semantics: Expressivity and Complexity. |
FSTTCS |
2021 |
DBLP DOI BibTeX RDF |
|
| 1 | Telikepalli Kavitha |
Matchings, Critical Nodes, and Popular Solutions. |
FSTTCS |
2021 |
DBLP DOI BibTeX RDF |
|
| 1 | Stefan Kiefer, Qiyi Tang 0001 |
Approximate Bisimulation Minimisation. |
FSTTCS |
2021 |
DBLP DOI BibTeX RDF |
|
| 1 | Bartosz Bednarczyk, Maja Orlowska, Anna Pacanowska, Tony Tan |
On Classical Decidable Logics Extended with Percentage Quantifiers and Arithmetics. |
FSTTCS |
2021 |
DBLP DOI BibTeX RDF |
|
| 1 | Kentaro Kikuchi, Takahito Aoto 0001 |
Simple Derivation Systems for Proving Sufficient Completeness of Non-Terminating Term Rewriting Systems. |
FSTTCS |
2021 |
DBLP DOI BibTeX RDF |
|
| 1 | Nathalie Bertrand 0001, Patricia Bouyer, Anirban Majumdar 0002 |
Synthesizing Safe Coalition Strategies. |
FSTTCS |
2020 |
DBLP DOI BibTeX RDF |
|
| 1 | Amir Shpilka |
On Some Recent Advances in Algebraic Complexity (Invited Talk). |
FSTTCS |
2020 |
DBLP DOI BibTeX RDF |
|
| 1 | Nikhil S. Mande, Swagato Sanyal |
On Parity Decision Trees for Fourier-Sparse Boolean Functions. |
FSTTCS |
2020 |
DBLP DOI BibTeX RDF |
|
| 1 | A. R. Balasubramanian |
Parameterized Complexity of Safety of Threshold Automata. |
FSTTCS |
2020 |
DBLP DOI BibTeX RDF |
|
| 1 | Sanjit A. Seshia |
Algorithmic Improvisation for Dependable Intelligent Autonomy (Invited Talk). |
FSTTCS |
2020 |
DBLP DOI BibTeX RDF |
|
| 1 | Shaull Almagor |
Process Symmetry in Probabilistic Transducers. |
FSTTCS |
2020 |
DBLP DOI BibTeX RDF |
|
| 1 | Davide Bilò, Tobias Friedrich 0001, Pascal Lenzner, Anna Melnichenko, Louise Molitor |
Fair Tree Connection Games with Topology-Dependent Edge Cost. |
FSTTCS |
2020 |
DBLP DOI BibTeX RDF |
|
| 1 | Yin Tat Lee |
Convex Optimization and Dynamic Data Structure (Invited Talk). |
FSTTCS |
2020 |
DBLP DOI BibTeX RDF |
|
| 1 | Rishi Tulsyan, Rekha R. Pai, Deepak D'Souza |
Static Race Detection for RTOS Applications. |
FSTTCS |
2020 |
DBLP DOI BibTeX RDF |
|
| 1 | Nils Morawietz, Niels Grüttemeier, Christian Komusiewicz, Frank Sommer |
Colored Cut Games. |
FSTTCS |
2020 |
DBLP DOI BibTeX RDF |
|
| 1 | Olaf Beyersdorff, Joshua Blinkhorn, Meena Mahajan, Tomás Peitl, Gaurav Sood 0001 |
Hard QBFs for Merge Resolution. |
FSTTCS |
2020 |
DBLP DOI BibTeX RDF |
|
| 1 | Christel Baier, Florian Funke 0002, Simon Jantsch, Toghrul Karimov, Engel Lefaucheux, Joël Ouaknine, Amaury Pouly, David Purser, Markus A. Whiteland |
Reachability in Dynamical Systems with Rounding. |
FSTTCS |
2020 |
DBLP DOI BibTeX RDF |
|
| 1 | Udi Boker, Denis Kuperberg, Karoliina Lehtinen, Michal Skrzypczak |
On the Succinctness of Alternating Parity Good-For-Games Automata. |
FSTTCS |
2020 |
DBLP DOI BibTeX RDF |
|
| 1 | Stefan Kiefer, Qiyi Tang 0001 |
Comparing Labelled Markov Decision Processes. |
FSTTCS |
2020 |
DBLP DOI BibTeX RDF |
|
| 1 | |
Front Matter, Table of Contents, Preface, Conference Organization. |
FSTTCS |
2020 |
DBLP DOI BibTeX RDF |
|
| 1 | Manfred Droste, Sven Dziadek, Werner Kuich |
Nivat-Theorem and Logic for Weighted Pushdown Automata on Infinite Words. |
FSTTCS |
2020 |
DBLP DOI BibTeX RDF |
|
| 1 | Pratibha Choudhary, Lawqueen Kanesh, Daniel Lokshtanov, Fahad Panolan, Saket Saurabh 0001 |
Parameterized Complexity of Feedback Vertex Sets on Hypergraphs. |
FSTTCS |
2020 |
DBLP DOI BibTeX RDF |
|
| 1 | Oscar Darwin, Stefan Kiefer |
Equivalence of Hidden Markov Models with Continuous Observations. |
FSTTCS |
2020 |
DBLP DOI BibTeX RDF |
|
| 1 | Anupam Gupta 0001, Ravishankar Krishnaswamy, Amit Kumar 0001, Sahil Singla 0001 |
Online Carpooling Using Expander Decompositions. |
FSTTCS |
2020 |
DBLP DOI BibTeX RDF |
|
| 1 | Dana Moshkovitz, Justin Oh, David Zuckerman |
Randomness Efficient Noise Stability and Generalized Small Bias Sets. |
FSTTCS |
2020 |
DBLP DOI BibTeX RDF |
|
| 1 | Joël Ouaknine |
Holonomic Techniques, Periods, and Decision Problems (Invited Talk). |
FSTTCS |
2020 |
DBLP DOI BibTeX RDF |
|
| 1 | C. Aiswarya, Paul Gastin |
Weighted Tiling Systems for Graphs: Evaluation Complexity. |
FSTTCS |
2020 |
DBLP DOI BibTeX RDF |
|
| 1 | Karthik Gajulapalli, James A. Liu, Tung Mai, Vijay V. Vazirani |
Stability-Preserving, Time-Efficient Mechanisms for School Choice in Two Rounds. |
FSTTCS |
2020 |
DBLP DOI BibTeX RDF |
|
| 1 | Philip Bille, Inge Li Gørtz, Max Rishøj Pedersen, Eva Rotenberg, Teresa Anna Steiner |
String Indexing for Top-k Close Consecutive Occurrences. |
FSTTCS |
2020 |
DBLP DOI BibTeX RDF |
|
| 1 | Orna Kupferman, Noam Shenwald |
Perspective Games with Notifications. |
FSTTCS |
2020 |
DBLP DOI BibTeX RDF |
|
| 1 | Anup Bhattacharya, Dishant Goyal, Ragesh Jaiswal, Amit Kumar 0001 |
On Sampling Based Algorithms for k-Means. |
FSTTCS |
2020 |
DBLP DOI BibTeX RDF |
|
| 1 | Nathalie Bertrand 0001, Nicolas Markey, Suman Sadhukhan, Ocan Sankur |
Dynamic Network Congestion Games. |
FSTTCS |
2020 |
DBLP DOI BibTeX RDF |
|
| 1 | Paul Gastin, Sayan Mukherjee 0002, B. Srivathsan |
Reachability for Updatable Timed Automata Made Faster and More Effective. |
FSTTCS |
2020 |
DBLP DOI BibTeX RDF |
|
| 1 | Sven Schewe |
Minimising Good-For-Games Automata Is NP-Complete. |
FSTTCS |
2020 |
DBLP DOI BibTeX RDF |
|
| 1 | Sanjeev Arora |
The Quest for Mathematical Understanding of Deep Learning (Invited Talk). |
FSTTCS |
2020 |
DBLP DOI BibTeX RDF |
|
| 1 | Henning Fernau, Petra Wolf 0002 |
Synchronization of Deterministic Visibly Push-Down Automata. |
FSTTCS |
2020 |
DBLP DOI BibTeX RDF |
|
| 1 | Dominique Perrin, Andrew Ryzhikov |
The Degree of a Finite Set of Words. |
FSTTCS |
2020 |
DBLP DOI BibTeX RDF |
|
| 1 | Édouard Bonnet, Nicolas Grelier, Tillmann Miltzow |
Maximum Clique in Disk-Like Intersection Graphs. |
FSTTCS |
2020 |
DBLP DOI BibTeX RDF |
|
| 1 | Emmanuel Arrighi, Henning Fernau, Mateus de Oliveira Oliveira, Petra Wolf 0002 |
Width Notions for Ordering-Related Problems. |
FSTTCS |
2020 |
DBLP DOI BibTeX RDF |
|
| 1 | Nitin Saxena 0001, Sunil Simon (eds.) |
40th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2020, December 14-18, 2020, BITS Pilani, K K Birla Goa Campus, Goa, India (Virtual Conference). |
FSTTCS |
2020 |
DBLP BibTeX RDF |
|
| 1 | Joshua Cook |
Size Bounds on Low Depth Circuits for Promise Majority. |
FSTTCS |
2020 |
DBLP DOI BibTeX RDF |
|
| 1 | Niranka Banerjee, Venkatesh Raman 0001, Saket Saurabh 0001 |
Optimal Output Sensitive Fault Tolerant Cuts. |
FSTTCS |
2020 |
DBLP DOI BibTeX RDF |
|
| 1 | Roland Meyer 0001, Sören van der Wall |
On the Complexity of Multi-Pushdown Games. |
FSTTCS |
2020 |
DBLP DOI BibTeX RDF |
|
| 1 | Michal Konecný, Florian Steinberg 0001, Holger Thies |
Computable Analysis for Verified Exact Real Computation. |
FSTTCS |
2020 |
DBLP DOI BibTeX RDF |
|
| 1 | Isolde Adler, Polly Fahey |
Faster Property Testers in a Variation of the Bounded Degree Model. |
FSTTCS |
2020 |
DBLP DOI BibTeX RDF |
|
| 1 | Petra Wolf 0002 |
Synchronization Under Dynamic Constraints. |
FSTTCS |
2020 |
DBLP DOI BibTeX RDF |
|
| 1 | Pavel Dvorák, Bruno Loff |
Lower Bounds for Semi-adaptive Data Structures via Corruption. |
FSTTCS |
2020 |
DBLP DOI BibTeX RDF |
|
| 1 | Aaron Bernstein, Aditi Dudeja |
Online Matching with Recourse: Random Edge Arrivals. |
FSTTCS |
2020 |
DBLP DOI BibTeX RDF |
|
| 1 | Pawel Parys |
Higher-Order Nonemptiness Step by Step. |
FSTTCS |
2020 |
DBLP DOI BibTeX RDF |
|
| 1 | Rebecca Bernemann, Benjamin Cabrera, Reiko Heckel, Barbara König 0001 |
Uncertainty Reasoning for Probabilistic Petri Nets via Bayesian Networks. |
FSTTCS |
2020 |
DBLP DOI BibTeX RDF |
|
| 1 | Peter Chini, Prakash Saivasan |
A Framework for Consistency Algorithms. |
FSTTCS |
2020 |
DBLP DOI BibTeX RDF |
|
| 1 | Emmanuel Filiot, Christof Löding, Sarah Winter |
Synthesis from Weighted Specifications with Partial Domains over Finite Words. |
FSTTCS |
2020 |
DBLP DOI BibTeX RDF |
|
| 1 | Sushmita Gupta, Pallavi Jain 0001, Sanjukta Roy, Saket Saurabh 0001, Meirav Zehavi |
On the (Parameterized) Complexity of Almost Stable Marriage. |
FSTTCS |
2020 |
DBLP DOI BibTeX RDF |
|
| 1 | Kishore Kothapalli, Shreyas Pai, Sriram V. Pemmaraju |
Sample-And-Gather: Fast Ruling Set Algorithms in the Low-Memory MPC Model. |
FSTTCS |
2020 |
DBLP DOI BibTeX RDF |
|
| 1 | Lidiya Khalidah binti Khalil, Christian Konrad 0001 |
Constructing Large Matchings via Query Access to a Maximal Matching Oracle. |
FSTTCS |
2020 |
DBLP DOI BibTeX RDF |
|
| 1 | Pankaj K. Agarwal, Hsien-Chih Chang, Kamesh Munagala, Erin Taylor 0002, Emo Welzl |
Clustering Under Perturbation Stability in Near-Linear Time. |
FSTTCS |
2020 |
DBLP DOI BibTeX RDF |
|
| 1 | Stefan Haar, Serge Haddad, Stefan Schwoon, Lina Ye |
Active Prediction for Discrete Event Systems. |
FSTTCS |
2020 |
DBLP DOI BibTeX RDF |
|
| 1 | Albert Atserias |
Proofs of Soundness and Proof Search (Invited Talk). |
FSTTCS |
2020 |
DBLP DOI BibTeX RDF |
|
| 1 | Alexander R. Block, Jeremiah Blocki, Elena Grigorescu, Shubhang Kulkarni, Minshen Zhu |
Locally Decodable/Correctable Codes for Insertions and Deletions. |
FSTTCS |
2020 |
DBLP DOI BibTeX RDF |
|
| 1 | Yash Khanna, Anand Louis |
Planted Models for the Densest k-Subgraph Problem. |
FSTTCS |
2020 |
DBLP DOI BibTeX RDF |
|
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")
data released under the ODC-BY 1.0 license