| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | Shreyas Pai, Sriram V. Pemmaraju |
Connectivity Lower Bounds in Broadcast Congested Clique.  |
FSTTCS  |
2020 |
DBLP DOI BibTeX RDF |
|
| 1 | Prantar Ghosh |
New Verification Schemes for Frequency-Based Functions on Data Streams. |
FSTTCS |
2020 |
DBLP DOI BibTeX RDF |
|
| 1 | Telikepalli Kavitha |
Min-Cost Popular Matchings. |
FSTTCS |
2020 |
DBLP DOI BibTeX RDF |
|
| 1 | M. Praveen |
What You Must Remember When Transforming Datawords. |
FSTTCS |
2020 |
DBLP DOI BibTeX RDF |
|
| 1 | Omer Wasim, Valerie King |
Fully Dynamic Sequential and Distributed Algorithms for MAX-CUT. |
FSTTCS |
2020 |
DBLP DOI BibTeX RDF |
|
| 1 | Pallavi Jain 0001, Lawqueen Kanesh, William Lochet, Saket Saurabh 0001, Roohani Sharma |
Exact and Approximate Digraph Bandwidth. |
FSTTCS |
2019 |
DBLP DOI BibTeX RDF |
|
| 1 | Isolde Adler, Christophe Paul, Dimitrios M. Thilikos |
Connected Search for a Lazy Robber. |
FSTTCS |
2019 |
DBLP DOI BibTeX RDF |
|
| 1 | Rahul Jain 0015, Raghunath Tewari |
An O(n^(1/4 +epsilon)) Space and Polynomial Algorithm for Grid Graph Reachability. |
FSTTCS |
2019 |
DBLP DOI BibTeX RDF |
|
| 1 | Manfred Droste, Sven Dziadek, Werner Kuich |
Greibach Normal Form for omega-Algebraic Systems and Weighted Simple omega-Pushdown Automata. |
FSTTCS |
2019 |
DBLP DOI BibTeX RDF |
|
| 1 | Akanksha Agrawal 0001, Arindam Biswas 0001, Édouard Bonnet, Nick Brettell, Radu Curticapean, Dániel Marx, Tillmann Miltzow, Venkatesh Raman 0001, Saket Saurabh 0001 |
Parameterized Streaming Algorithms for Min-Ones d-SAT. |
FSTTCS |
2019 |
DBLP DOI BibTeX RDF |
|
| 1 | Paolo Baldan, Alessandra Raffaetà |
Minimisation of Event Structures. |
FSTTCS |
2019 |
DBLP DOI BibTeX RDF |
|
| 1 | Agnishom Chattopadhyay, M. Praveen |
Query Preserving Watermarking Schemes for Locally Treelike Databases. |
FSTTCS |
2019 |
DBLP DOI BibTeX RDF |
|
| 1 | Karthikeyan Bhargavan, Prasad Naldurg |
Practical Formal Methods for Real World Cryptography (Invited Talk). |
FSTTCS |
2019 |
DBLP DOI BibTeX RDF |
|
| 1 | Hervé Fournier, Guillaume Malod, Maud Szusterman, Sébastien Tavenas |
Nonnegative Rank Measures and Monotone Algebraic Branching Programs. |
FSTTCS |
2019 |
DBLP DOI BibTeX RDF |
|
| 1 | Fabio Gadducci, Hernán C. Melgratti, Christian Roldán, Matteo Sammartino |
A Categorical Account of Replicated Data Types. |
FSTTCS |
2019 |
DBLP DOI BibTeX RDF |
|
| 1 | Giorgio Lucarelli, Benjamin Moseley, Kim Thang Nguyen, Abhinav Srivastav, Denis Trystram |
Online Non-Preemptive Scheduling to Minimize Maximum Weighted Flow-Time on Related Machines. |
FSTTCS |
2019 |
DBLP DOI BibTeX RDF |
|
| 1 | Ramanathan S. Thinniyam, Georg Zetzsche |
Regular Separability and Intersection Emptiness Are Independent Problems. |
FSTTCS |
2019 |
DBLP DOI BibTeX RDF |
|
| 1 | Arkadev Chattopadhyay, Paul Gastin (eds.) |
39th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2019, December 11-13, 2019, Bombay, India. |
FSTTCS |
2019 |
DBLP BibTeX RDF |
|
| 1 | Nathalie Bertrand 0001, Patricia Bouyer, Anirban Majumdar 0002 |
Concurrent Parameterized Games. |
FSTTCS |
2019 |
DBLP DOI BibTeX RDF |
|
| 1 | Denis Kuperberg, Laureline Pinault, Damien Pous |
Cyclic Proofs and Jumping Automata. |
FSTTCS |
2019 |
DBLP DOI BibTeX RDF |
|
| 1 | Alexandre Mansard |
Boolean Algebras from Trace Automata. |
FSTTCS |
2019 |
DBLP DOI BibTeX RDF |
|
| 1 | Laura Bozzelli, Angelo Montanari, Adriano Peron |
Taming the Complexity of Timeline-Based Planning over Dense Temporal Domains. |
FSTTCS |
2019 |
DBLP DOI BibTeX RDF |
|
| 1 | Marco Kuhlmann, Andreas Maletti, Lena Katharina Schiffer |
The Tree-Generative Capacity of Combinatory Categorial Grammars. |
FSTTCS |
2019 |
DBLP DOI BibTeX RDF |
|
| 1 | Salvatore La Torre, Parthasarathy Madhusudan |
Reachability in Concurrent Uninterpreted Programs. |
FSTTCS |
2019 |
DBLP DOI BibTeX RDF |
|
| 1 | Emmanuel Filiot, Shibashis Guha, Nicolas Mazzocchi |
Two-Way Parikh Automata. |
FSTTCS |
2019 |
DBLP DOI BibTeX RDF |
|
| 1 | David Mestel |
Widths of Regular and Context-Free Languages. |
FSTTCS |
2019 |
DBLP DOI BibTeX RDF |
|
| 1 | Ranko Lazic 0001 |
Finkel Was Right: Counter-Examples to Several Conjectures on Variants of Vector Addition Systems (Invited Talk). |
FSTTCS |
2019 |
DBLP DOI BibTeX RDF |
|
| 1 | Toniann Pitassi |
Progress in Lifting and Applications in Lower Bounds (Invited Talk). |
FSTTCS |
2019 |
DBLP DOI BibTeX RDF |
|
| 1 | Vikraman Arvind, Abhranil Chatterjee 0001, Rajit Datta, Partha Mukhopadhyay |
Fast Exact Algorithms Using Hadamard Product of Polynomials. |
FSTTCS |
2019 |
DBLP DOI BibTeX RDF |
|
| 1 | Jeffrey M. Dudek, Dror Fried |
Transformations of Boolean Functions. |
FSTTCS |
2019 |
DBLP DOI BibTeX RDF |
|
| 1 | Yujin Choi, Seungjun Lee, Hee-Kap Ahn |
Maximum-Area Rectangles in a Simple Polygon. |
FSTTCS |
2019 |
DBLP DOI BibTeX RDF |
|
| 1 | Nutan Limaye, Srikanth Srinivasan 0001, Utkarsh Tripathi |
More on AC^0[oplus] and Variants of the Majority Function. |
FSTTCS |
2019 |
DBLP DOI BibTeX RDF |
|
| 1 | Gordon Hoi, Sanjay Jain 0001, Frank Stephan 0001 |
A Fast Exponential Time Algorithm for Max Hamming Distance X3SAT. |
FSTTCS |
2019 |
DBLP DOI BibTeX RDF |
|
| 1 | |
Front Matter, Table of Contents, Preface, Conference Organization. |
FSTTCS |
2019 |
DBLP DOI BibTeX RDF |
|
| 1 | Robert Krauthgamer |
Sketching Graphs and Combinatorial Optimization (Invited Talk). |
FSTTCS |
2019 |
DBLP DOI BibTeX RDF |
|
| 1 | Kanthi K. Sarpatwar, Baruch Schieber, Hadas Shachnai |
The Preemptive Resource Allocation Problem. |
FSTTCS |
2019 |
DBLP DOI BibTeX RDF |
|
| 1 | Telikepalli Kavitha |
Popular Roommates in Simply Exponential Time. |
FSTTCS |
2019 |
DBLP DOI BibTeX RDF |
|
| 1 | Anand Louis, Rakesh Venkat |
Planted Models for k-Way Edge and Vertex Expansion. |
FSTTCS |
2019 |
DBLP DOI BibTeX RDF |
|
| 1 | Benjamin Bordais, Shibashis Guha, Jean-François Raskin |
Expected Window Mean-Payoff. |
FSTTCS |
2019 |
DBLP DOI BibTeX RDF |
|
| 1 | Alain Finkel, Ekanshdeep Gupta |
The Well Structured Problem for Presburger Counter Machines. |
FSTTCS |
2019 |
DBLP DOI BibTeX RDF |
|
| 1 | Laura Bozzelli, Angelo Montanari, Adriano Peron |
Interval Temporal Logic for Visibly Pushdown Systems. |
FSTTCS |
2019 |
DBLP DOI BibTeX RDF |
|
| 1 | Alexandra Silva 0001 |
An Algebraic Framework to Reason About Concurrency (Invited Talk). |
FSTTCS |
2019 |
DBLP DOI BibTeX RDF |
|
| 1 | Aditya Potukuchi |
On the AC^0[oplus] Complexity of Andreev's Problem. |
FSTTCS |
2019 |
DBLP DOI BibTeX RDF |
|
| 1 | Chetan Gupta 0002, Rahul Jain 0015, Vimal Raj Sharma, Raghunath Tewari |
Unambiguous Catalytic Computation. |
FSTTCS |
2019 |
DBLP DOI BibTeX RDF |
|
| 1 | Jérôme Leroux |
Distance Between Mutually Reachable Petri Net Configurations. |
FSTTCS |
2019 |
DBLP DOI BibTeX RDF |
|
| 1 | Thomas Brihaye, Gilles Geeraerts, Marion Hallet, Benjamin Monmege, Bruno Quoitin |
Dynamics on Games: Simulation-Based Techniques and Applications to Routing. |
FSTTCS |
2019 |
DBLP DOI BibTeX RDF |
|
| 1 | Sanjana Kolisetty, Linh Le, Ilya Volkovich, Mihalis Yannakakis |
The Complexity of Finding S-Factors in Regular Graphs. |
FSTTCS |
2019 |
DBLP DOI BibTeX RDF |
|
| 1 | Prerona Chatterjee, Ramprasad Saptharishi |
Constructing Faithful Homomorphisms over Fields of Finite Characteristic. |
FSTTCS |
2019 |
DBLP DOI BibTeX RDF |
|
| 1 | Tim Roughgarden |
How Computer Science Informs Modern Auction Design (Invited Talk). |
FSTTCS |
2019 |
DBLP DOI BibTeX RDF |
|
| 1 | Hans Kleine Büning, Piotr Wojciechowski 0002, K. Subramani 0001 |
New Results on Cutting Plane Proofs for Horn Constraint Systems. |
FSTTCS |
2019 |
DBLP DOI BibTeX RDF |
|
| 1 | Srikanth Srinivasan 0001, Utkarsh Tripathi, S. Venkitesh |
On the Probabilistic Degrees of Symmetric Boolean Functions. |
FSTTCS |
2019 |
DBLP DOI BibTeX RDF |
|
| 1 | Alexander Rabinovich, Doron Tiferet |
Degrees of Ambiguity of Büchi Tree Automata. |
FSTTCS |
2019 |
DBLP DOI BibTeX RDF |
|
| 1 | S. Akshay 0001, Hugo Bazille, Eric Fabre, Blaise Genest |
Classification Among Hidden Markov Models. |
FSTTCS |
2019 |
DBLP DOI BibTeX RDF |
|
| 1 | Fedor V. Fomin, Petr A. Golovach, Kirill Simonov |
Parameterized k-Clustering: Tractability Island. |
FSTTCS |
2019 |
DBLP DOI BibTeX RDF |
|
| 1 | Roy Schwartz 0002, Mohit Singh, Sina Yazdanbod |
Online and Offline Algorithms for Circuit Switch Scheduling. |
FSTTCS |
2019 |
DBLP DOI BibTeX RDF |
|
| 1 | Diptarka Chakraborty, Debarati Das 0001, Michal Koucký 0001 |
Approximate Online Pattern Matching in Sublinear Time. |
FSTTCS |
2019 |
DBLP DOI BibTeX RDF |
|
| 1 | Jan Dreier, Peter Rossmanith |
Motif Counting in Preferential Attachment Graphs. |
FSTTCS |
2019 |
DBLP DOI BibTeX RDF |
|
| 1 | Peter Chini, Roland Meyer 0001, Prakash Saivasan |
Complexity of Liveness in Parameterized Systems. |
FSTTCS |
2019 |
DBLP DOI BibTeX RDF |
|
| 1 | Amy Babay, Michael Dinitz, Zeyu Zhang 0003 |
Characterizing Demand Graphs for (Fixed-Parameter) Shallow-Light Steiner Network. |
FSTTCS |
2018 |
DBLP DOI BibTeX RDF |
|
| 1 | Siddhesh Chaubal, Anna Gál |
New Constructions with Quadratic Separation between Sensitivity and Block Sensitivity. |
FSTTCS |
2018 |
DBLP DOI BibTeX RDF |
|
| 1 | Deepanjan Kesh |
Space Complexity of Two Adaptive Bitprobe Schemes Storing Three Elements. |
FSTTCS |
2018 |
DBLP DOI BibTeX RDF |
|
| 1 | Swaroop N. Prabhakar, Vikram Sharma 0001 |
Stronger Tradeoffs for Orthogonal Range Querying in the Semigroup Model. |
FSTTCS |
2018 |
DBLP DOI BibTeX RDF |
|
| 1 | Ágnes Cseh, Telikepalli Kavitha |
Popular Matchings in Complete Graphs. |
FSTTCS |
2018 |
DBLP DOI BibTeX RDF |
|
| 1 | Pierre Ganty, Elena Gutiérrez |
The Parikh Property for Weighted Context-Free Grammars. |
FSTTCS |
2018 |
DBLP DOI BibTeX RDF |
|
| 1 | Pranabendu Misra, Saket Saurabh 0001, Roohani Sharma, Meirav Zehavi |
Sub-Exponential Time Parameterized Algorithms for Graph Layout Problems on Digraphs with Bounded Independence Number. |
FSTTCS |
2018 |
DBLP DOI BibTeX RDF |
|
| 1 | Alexandre Debant, Stéphanie Delaune, Cyrille Wiedling |
A Symbolic Framework to Analyse Physical Proximity in Security Protocols. |
FSTTCS |
2018 |
DBLP DOI BibTeX RDF |
|
| 1 | Thomas Place, Marc Zeitoun |
The Complexity of Separation for Levels in Concatenation Hierarchies. |
FSTTCS |
2018 |
DBLP DOI BibTeX RDF |
|
| 1 | Siddharth Bhandari, Prahladh Harsha, Tulasimohan Molli, Srikanth Srinivasan 0001 |
On the Probabilistic Degree of OR over the Reals. |
FSTTCS |
2018 |
DBLP DOI BibTeX RDF |
|
| 1 | Emmanuel Filiot, Olivier Gauwin, Nathan Lhote, Anca Muscholl |
On Canonical Models for Rational Functions over Infinite Words. |
FSTTCS |
2018 |
DBLP DOI BibTeX RDF |
|
| 1 | Vincent Penelle, Sylvain Salvati, Grégoire Sutre |
On the Boundedness Problem for Higher-Order Pushdown Vector Addition Systems. |
FSTTCS |
2018 |
DBLP DOI BibTeX RDF |
|
| 1 | Ola Svensson |
Algorithms for the Asymmetric Traveling Salesman Problem (Invited Paper). |
FSTTCS |
2018 |
DBLP DOI BibTeX RDF |
|
| 1 | Kazuyuki Asada, Naoki Kobayashi 0001 |
Lambda-Definable Order-3 Tree Functions are Well-Quasi-Ordered. |
FSTTCS |
2018 |
DBLP DOI BibTeX RDF |
|
| 1 | Bhaskar Ray Chaudhury, Kurt Mehlhorn |
Combinatorial Algorithms for General Linear Arrow-Debreu Markets. |
FSTTCS |
2018 |
DBLP DOI BibTeX RDF |
|
| 1 | Béatrice Bérard, Stefan Haar, Loïc Hélouët |
Hyper Partial Order Logic. |
FSTTCS |
2018 |
DBLP DOI BibTeX RDF |
|
| 1 | Sumedh Tirodkar |
Deterministic Algorithms for Maximum Matching on General Graphs in the Semi-Streaming Model. |
FSTTCS |
2018 |
DBLP DOI BibTeX RDF |
|
| 1 | Parosh Aziz Abdulla, Mohamed Faouzi Atig, Shankara Narayanan Krishna, Shaan Vaidya |
Verification of Timed Asynchronous Programs. |
FSTTCS |
2018 |
DBLP DOI BibTeX RDF |
|
| 1 | Junjie Luo 0001, Hendrik Molter, André Nichterlein, Rolf Niedermeier |
Parameterized Dynamic Cluster Editing. |
FSTTCS |
2018 |
DBLP DOI BibTeX RDF |
|
| 1 | Marc Bagnol, Denis Kuperberg |
Büchi Good-for-Games Automata Are Efficiently Recognizable. |
FSTTCS |
2018 |
DBLP DOI BibTeX RDF |
|
| 1 | Sougata Bose, Anca Muscholl, Vincent Penelle, Gabriele Puppis |
Origin-Equivalence of Two-Way Word Transducers Is in PSPACE. |
FSTTCS |
2018 |
DBLP DOI BibTeX RDF |
|
| 1 | Alain Finkel, Jérôme Leroux, Grégoire Sutre |
Reachability for Two-Counter Machines with One Test and One Reset. |
FSTTCS |
2018 |
DBLP DOI BibTeX RDF |
|
| 1 | David Baelde, Anthony Lick, Sylvain Schmitz |
A Hypersequent Calculus with Clusters for Tense Logic over Ordinals. |
FSTTCS |
2018 |
DBLP DOI BibTeX RDF |
|
| 1 | Elazar Goldenberg, Karthik C. S. |
Towards a General Direct Product Testing Theorem. |
FSTTCS |
2018 |
DBLP DOI BibTeX RDF |
|
| 1 | Karl Bringmann, Bhaskar Ray Chaudhury |
Sketching, Streaming, and Fine-Grained Complexity of (Weighted) LCS. |
FSTTCS |
2018 |
DBLP DOI BibTeX RDF |
|
| 1 | Mohsen Alambardar Meybodi, Fedor V. Fomin, Amer E. Mouawad, Fahad Panolan |
On the Parameterized Complexity of [1, j]-Domination Problems. |
FSTTCS |
2018 |
DBLP DOI BibTeX RDF |
|
| 1 | Faried Abu Zaid |
Uniformly Automatic Classes of Finite Structures. |
FSTTCS |
2018 |
DBLP DOI BibTeX RDF |
|
| 1 | Satya V. Lokam, R. Ramanujam 0001 (eds.) |
37th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2017, December 11-15, 2017, Kanpur, India |
FSTTCS |
2018 |
DBLP BibTeX RDF |
|
| 1 | Manisha Bansal, Naveen Garg 0001, Neelima Gupta |
A 5-Approximation for Universal Facility Location. |
FSTTCS |
2018 |
DBLP DOI BibTeX RDF |
|
| 1 | Udi Boker, Karoliina Lehtinen |
On the Way to Alternating Weak Automata. |
FSTTCS |
2018 |
DBLP DOI BibTeX RDF |
|
| 1 | Balthazar Bauer, Jevgenijs Vihrovs, Hoeteck Wee |
On the Inner Product Predicate and a Generalization of Matching Vector Families. |
FSTTCS |
2018 |
DBLP DOI BibTeX RDF |
|
| 1 | Markus Bläser, Balagopal Komarath, Karteek Sreenivasaiah |
Graph Pattern Polynomials. |
FSTTCS |
2018 |
DBLP DOI BibTeX RDF |
|
| 1 | Stéphane Le Roux 0001, Arno Pauly, Mickael Randour |
Extending Finite-Memory Determinacy by Boolean Combination of Winning Conditions. |
FSTTCS |
2018 |
DBLP DOI BibTeX RDF |
|
| 1 | |
Front Matter, Table of Contents, Preface, Conference Organization. |
FSTTCS |
2018 |
DBLP DOI BibTeX RDF |
|
| 1 | Faried Abu Zaid, Chris Köcher |
The Cayley-Graph of the Queue Monoid: Logic and Decidability. |
FSTTCS |
2018 |
DBLP DOI BibTeX RDF |
|
| 1 | Furio Honsell, Luigi Liquori, Claude Stolze, Ivan Scagnetto |
The Delta-Framework. |
FSTTCS |
2018 |
DBLP DOI BibTeX RDF |
|
| 1 | Sumit Ganguly, Paritosh K. Pandya (eds.) |
38th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2018, December 11-13, 2018, Ahmedabad, India |
FSTTCS |
2018 |
DBLP BibTeX RDF |
|
| 1 | Alessio Mansutti |
Extending Propositional Separation Logic for Robustness Properties. |
FSTTCS |
2018 |
DBLP DOI BibTeX RDF |
|
| 1 | Santosh S. Vempala |
Continuous Algorithms (Invited Paper). |
FSTTCS |
2018 |
DBLP DOI BibTeX RDF |
|
| 1 | Bhaskar Ray Chaudhury, Yun Kuen Cheung, Jugal Garg, Naveen Garg 0001, Martin Hoefer 0001, Kurt Mehlhorn |
On Fair Division for Indivisible Items. |
FSTTCS |
2018 |
DBLP DOI BibTeX RDF |
|
| 1 | Samir Datta, Siddharth Iyer, Raghav Kulkarni, Anish Mukherjee 0001 |
Shortest k-Disjoint Paths via Determinants. |
FSTTCS |
2018 |
DBLP DOI BibTeX RDF |
|
| 1 | Anantha Padmanabha, R. Ramanujam 0001, Yanjing Wang 0001 |
Bundled Fragments of First-Order Modal Logic: (Un)Decidability. |
FSTTCS |
2018 |
DBLP DOI BibTeX RDF |
|
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")
data released under the ODC-BY 1.0 license