default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID38th FSTTCS 2018: Ahmedabad, India
- Sumit Ganguly, Paritosh K. Pandya:
38th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2018, Ahmedabad, India, December 11-13, 2018. LIPIcs 122, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2018, ISBN 978-3-95977-093-4 - Front Matter, Table of Contents, Preface, Conference Organization. 0:i-0:xiv
- Rupak Majumdar:
Random Testing for Distributed Systems with Theoretical Guarantees (Invited Paper). 1:1-1:1 - A. Prasad Sistla:
Model Checking Randomized Security Protocols (Invited Paper). 2:1-2:1 - Ola Svensson:
Algorithms for the Asymmetric Traveling Salesman Problem (Invited Paper). 3:1-3:1 - Santosh S. Vempala:
Continuous Algorithms (Invited Paper). 4:1-4:1 - Siddharth Bhandari, Prahladh Harsha, Tulasimohan Molli
, Srikanth Srinivasan:
On the Probabilistic Degree of OR over the Reals. 5:1-5:12 - Ramprasad Saptharishi, Anamay Tengse:
Quasipolynomial Hitting Sets for Circuits with Restricted Parse Trees. 6:1-6:19 - Vikraman Arvind, Abhranil Chatterjee, Rajit Datta, Partha Mukhopadhyay:
Univariate Ideal Membership Parameterized by Rank, Degree, and Number of Generators. 7:1-7:18 - Parosh Aziz Abdulla, Mohamed Faouzi Atig, Shankara Narayanan Krishna, Shaan Vaidya:
Verification of Timed Asynchronous Programs. 8:1-8:16 - Faried Abu Zaid, Chris Köcher:
The Cayley-Graph of the Queue Monoid: Logic and Decidability. 9:1-9:17 - Faried Abu Zaid:
Uniformly Automatic Classes of Finite Structures. 10:1-10:21 - Elazar Goldenberg, Karthik C. S.:
Towards a General Direct Product Testing Theorem. 11:1-11:17 - Deepanjan Kesh:
Space Complexity of Two Adaptive Bitprobe Schemes Storing Three Elements. 12:1-12:12 - Siddhesh Chaubal, Anna Gál:
New Constructions with Quadratic Separation between Sensitivity and Block Sensitivity. 13:1-13:16 - Kazuyuki Asada, Naoki Kobayashi:
Lambda-Definable Order-3 Tree Functions are Well-Quasi-Ordered. 14:1-14:15 - David Baelde, Anthony Lick, Sylvain Schmitz:
A Hypersequent Calculus with Clusters for Tense Logic over Ordinals. 15:1-15:19 - Marc Bagnol, Denis Kuperberg:
Büchi Good-for-Games Automata Are Efficiently Recognizable. 16:1-16:14 - Ágnes Cseh, Telikepalli Kavitha:
Popular Matchings in Complete Graphs. 17:1-17:14 - Markus Bläser, Balagopal Komarath, Karteek Sreenivasaiah:
Graph Pattern Polynomials. 18:1-18:13 - Samir Datta, Siddharth Iyer, Raghav Kulkarni, Anish Mukherjee:
Shortest k-Disjoint Paths via Determinants. 19:1-19:21 - Béatrice Bérard, Stefan Haar, Loïc Hélouët:
Hyper Partial Order Logic. 20:1-20:21 - Udi Boker, Karoliina Lehtinen:
On the Way to Alternating Weak Automata. 21:1-21:22 - Sougata Bose, Anca Muscholl, Vincent Penelle, Gabriele Puppis:
Origin-Equivalence of Two-Way Word Transducers Is in PSPACE. 22:1-22:18 - Sapna Grover, Neelima Gupta, Samir Khuller, Aditya Pancholi:
Constant Factor Approximation Algorithm for Uniform Hard Capacitated Knapsack Median Problem. 23:1-23:22 - Manisha Bansal, Naveen Garg, Neelima Gupta:
A 5-Approximation for Universal Facility Location. 24:1-24:12 - Bhaskar Ray Chaudhury, Yun Kuen Cheung, Jugal Garg, Naveen Garg, Martin Hoefer, Kurt Mehlhorn:
On Fair Division for Indivisible Items. 25:1-25:17 - Bhaskar Ray Chaudhury, Kurt Mehlhorn:
Combinatorial Algorithms for General Linear Arrow-Debreu Markets. 26:1-26:16 - Umang Bhaskar, Abheek Ghosh:
On the Welfare of Cardinal Voting Mechanisms. 27:1-27:22 - Damien Busatto-Gaston, Benjamin Monmege, Pierre-Alain Reynier:
Symbolic Approximation of Weighted Timed Games. 28:1-28:16 - Alexandre Debant, Stéphanie Delaune, Cyrille Wiedling:
A Symbolic Framework to Analyse Physical Proximity in Security Protocols. 29:1-29:20 - Emmanuel Filiot, Olivier Gauwin, Nathan Lhote, Anca Muscholl:
On Canonical Models for Rational Functions over Infinite Words. 30:1-30:17 - Alain Finkel, Jérôme Leroux, Grégoire Sutre:
Reachability for Two-Counter Machines with One Test and One Reset. 31:1-31:14 - Pierre Ganty, Elena Gutiérrez:
The Parikh Property for Weighted Context-Free Grammars. 32:1-32:20 - Amy Babay, Michael Dinitz, Zeyu Zhang:
Characterizing Demand Graphs for (Fixed-Parameter) Shallow-Light Steiner Network. 33:1-33:22 - Mohsen Alambardar Meybodi, Fedor V. Fomin, Amer E. Mouawad, Fahad Panolan:
On the Parameterized Complexity of [1, j]-Domination Problems. 34:1-34:14 - Pranabendu Misra, Saket Saurabh, Roohani Sharma, Meirav Zehavi:
Sub-Exponential Time Parameterized Algorithms for Graph Layout Problems on Digraphs with Bounded Independence Number. 35:1-35:19 - Gilles Geeraerts, Shibashis Guha, Jean-François Raskin:
Safe and Optimal Scheduling for Hard and Soft Tasks. 36:1-36:22 - Furio Honsell, Luigi Liquori, Claude Stolze, Ivan Scagnetto:
The Delta-Framework. 37:1-37:21 - Stéphane Le Roux, Arno Pauly, Mickael Randour:
Extending Finite-Memory Determinacy by Boolean Combination of Winning Conditions. 38:1-38:20 - Sumedh Tirodkar:
Deterministic Algorithms for Maximum Matching on General Graphs in the Semi-Streaming Model. 39:1-39:16 - Karl Bringmann, Bhaskar Ray Chaudhury:
Sketching, Streaming, and Fine-Grained Complexity of (Weighted) LCS. 40:1-40:16 - Balthazar Bauer, Jevgenijs Vihrovs, Hoeteck Wee:
On the Inner Product Predicate and a Generalization of Matching Vector Families. 41:1-41:13 - Alessio Mansutti:
Extending Propositional Separation Logic for Robustness Properties. 42:1-42:23 - Anantha Padmanabha, R. Ramanujam, Yanjing Wang:
Bundled Fragments of First-Order Modal Logic: (Un)Decidability. 43:1-43:20 - Vincent Penelle, Sylvain Salvati, Grégoire Sutre:
On the Boundedness Problem for Higher-Order Pushdown Vector Addition Systems. 44:1-44:20 - Swaroop N. Prabhakar, Vikram Sharma:
Stronger Tradeoffs for Orthogonal Range Querying in the Semigroup Model. 45:1-45:14 - Junjie Luo, Hendrik Molter, André Nichterlein, Rolf Niedermeier:
Parameterized Dynamic Cluster Editing. 46:1-46:15 - Thomas Place, Marc Zeitoun:
The Complexity of Separation for Levels in Concatenation Hierarchies. 47:1-47:17 - Adrien Boiret, Radoslaw Piórkowski, Janusz Schmude:
Reducing Transducer Equivalence to Register Automata Problems Solved by "Hilbert Method". 48:1-48:16
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-01-18 21:53 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:
