default search action
39th FSTTCS 2019: Bombay, India
- Arkadev Chattopadhyay, Paul Gastin
:
39th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2019, December 11-13, 2019, Bombay, India. LIPIcs 150, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2019, ISBN 978-3-95977-131-3 - Front Matter, Table of Contents, Preface, Conference Organization. 0:1-0:12
- Karthikeyan Bhargavan, Prasad Naldurg:
Practical Formal Methods for Real World Cryptography (Invited Talk). 1:1-1:12 - Robert Krauthgamer:
Sketching Graphs and Combinatorial Optimization (Invited Talk). 2:1-2:1 - Ranko Lazic:
Finkel Was Right: Counter-Examples to Several Conjectures on Variants of Vector Addition Systems (Invited Talk). 3:1-3:2 - Toniann Pitassi:
Progress in Lifting and Applications in Lower Bounds (Invited Talk). 4:1-4:1 - Tim Roughgarden:
How Computer Science Informs Modern Auction Design (Invited Talk). 5:1-5:1 - Alexandra Silva:
An Algebraic Framework to Reason About Concurrency (Invited Talk). 6:1-6:1 - Isolde Adler, Christophe Paul, Dimitrios M. Thilikos:
Connected Search for a Lazy Robber. 7:1-7:14 - Akanksha Agrawal, Arindam Biswas, Édouard Bonnet, Nick Brettell
Parameterized Streaming Algorithms for Min-Ones d-SAT. 8:1-8:20 - Vikraman Arvind, Abhranil Chatterjee, Rajit Datta, Partha Mukhopadhyay:
Fast Exact Algorithms Using Hadamard Product of Polynomials. 9:1-9:14 - Diptarka Chakraborty, Debarati Das, Michal Koucký
Approximate Online Pattern Matching in Sublinear Time. 10:1-10:15 - Prerona Chatterjee
Constructing Faithful Homomorphisms over Fields of Finite Characteristic. 11:1-11:14 - Yujin Choi, Seungjun Lee, Hee-Kap Ahn
Maximum-Area Rectangles in a Simple Polygon. 12:1-12:14 - Jan Dreier
Motif Counting in Preferential Attachment Graphs. 13:1-13:14 - Fedor V. Fomin
Parameterized k-Clustering: Tractability Island. 14:1-14:15 - Hervé Fournier, Guillaume Malod, Maud Szusterman, Sébastien Tavenas:
Nonnegative Rank Measures and Monotone Algebraic Branching Programs. 15:1-15:14 - Chetan Gupta
Unambiguous Catalytic Computation. 16:1-16:13 - Gordon Hoi, Sanjay Jain
A Fast Exponential Time Algorithm for Max Hamming Distance X3SAT. 17:1-17:14 - Pallavi Jain, Lawqueen Kanesh, William Lochet
Exact and Approximate Digraph Bandwidth. 18:1-18:15 - Rahul Jain
An O(n^(1/4 +epsilon)) Space and Polynomial Algorithm for Grid Graph Reachability. 19:1-19:14 - Telikepalli Kavitha:
Popular Roommates in Simply Exponential Time. 20:1-20:15 - Sanjana Kolisetty, Linh Le, Ilya Volkovich, Mihalis Yannakakis:
The Complexity of Finding S-Factors in Regular Graphs. 21:1-21:12 - Nutan Limaye, Srikanth Srinivasan
More on AC^0[oplus] and Variants of the Majority Function. 22:1-22:14 - Anand Louis, Rakesh Venkat
Planted Models for k-Way Edge and Vertex Expansion. 23:1-23:15 - Giorgio Lucarelli
Online Non-Preemptive Scheduling to Minimize Maximum Weighted Flow-Time on Related Machines. 24:1-24:12 - Aditya Potukuchi
On the AC^0[oplus] Complexity of Andreev's Problem. 25:1-25:14 - Kanthi K. Sarpatwar
The Preemptive Resource Allocation Problem. 26:1-26:15 - Roy Schwartz, Mohit Singh, Sina Yazdanbod:
Online and Offline Algorithms for Circuit Switch Scheduling. 27:1-27:14 - Srikanth Srinivasan
On the Probabilistic Degrees of Symmetric Boolean Functions. 28:1-28:14 - S. Akshay, Hugo Bazille, Eric Fabre, Blaise Genest:
Classification Among Hidden Markov Models. 29:1-29:14 - Paolo Baldan
Minimisation of Event Structures. 30:1-30:15 - Nathalie Bertrand
Concurrent Parameterized Games. 31:1-31:15 - Benjamin Bordais, Shibashis Guha, Jean-François Raskin:
Expected Window Mean-Payoff. 32:1-32:15 - Laura Bozzelli, Angelo Montanari, Adriano Peron:
Interval Temporal Logic for Visibly Pushdown Systems. 33:1-33:14 - Laura Bozzelli, Angelo Montanari, Adriano Peron:
Taming the Complexity of Timeline-Based Planning over Dense Temporal Domains. 34:1-34:14 - Thomas Brihaye, Gilles Geeraerts, Marion Hallet, Benjamin Monmege
Dynamics on Games: Simulation-Based Techniques and Applications to Routing. 35:1-35:14 - Agnishom Chattopadhyay
Query Preserving Watermarking Schemes for Locally Treelike Databases. 36:1-36:14 - Peter Chini, Roland Meyer, Prakash Saivasan:
Complexity of Liveness in Parameterized Systems. 37:1-37:15 - Manfred Droste, Sven Dziadek
Greibach Normal Form for omega-Algebraic Systems and Weighted Simple omega-Pushdown Automata. 38:1-38:14 - Jeffrey M. Dudek
Transformations of Boolean Functions. 39:1-39:14 - Emmanuel Filiot
Two-Way Parikh Automata. 40:1-40:14 - Alain Finkel, Ekanshdeep Gupta:
The Well Structured Problem for Presburger Counter Machines. 41:1-41:15 - Fabio Gadducci
A Categorical Account of Replicated Data Types. 42:1-42:15 - Hans Kleine Büning, Piotr Wojciechowski
New Results on Cutting Plane Proofs for Horn Constraint Systems. 43:1-43:14 - Marco Kuhlmann
The Tree-Generative Capacity of Combinatory Categorial Grammars. 44:1-44:14 - Denis Kuperberg
Cyclic Proofs and Jumping Automata. 45:1-45:14 - Salvatore La Torre, Parthasarathy Madhusudan:
Reachability in Concurrent Uninterpreted Programs. 46:1-46:16 - Jérôme Leroux:
Distance Between Mutually Reachable Petri Net Configurations. 47:1-47:14 - Alexandre Mansard:
Boolean Algebras from Trace Automata. 48:1-48:15 - David Mestel:
Widths of Regular and Context-Free Languages. 49:1-49:14 - Alexander Rabinovich
Degrees of Ambiguity of Büchi Tree Automata. 50:1-50:14 - Ramanathan S. Thinniyam
Regular Separability and Intersection Emptiness Are Independent Problems. 51:1-51:15
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 2024-12-19 22:02 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: