default search action
34th FSTTCS 2014: New Delhi, India
- Venkatesh Raman, S. P. Suresh:
34th International Conference on Foundation of Software Technology and Theoretical Computer Science, FSTTCS 2014, December 15-17, 2014, New Delhi, India. LIPIcs 29, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2014, ISBN 978-3-939897-77-4 - Front Matter, Table of Contents, Preface, Conference Organization.
- Nikhil Bansal:
New Developments in Iterated Rounding (Invited Talk). 1-10 - C. Aiswarya
, Paul Gastin:
Reasoning About Distributed Systems: WYSIWYG (Invited Talk). 11-30 - Martin Grohe:
Colour Refinement: A Simple Partitioning Algorithm with Applications From Graph Isomorphism Testing to Machine Learning (Invited Talk). 31-31 - Orna Kupferman, Tami Tamir:
Properties and Utilization of Capacitated Automata (Invited Talk). 33-44 - Erick Chastain, Adi Livnat, Christos H. Papadimitriou, Umesh V. Vazirani:
Algorithms, Games, and Evolution (Invited Talk). 45-46 - Richard Ryan Williams
The Polynomial Method in Circuit Complexity Applied to Algorithm Design (Invited Talk). 47-60 - Geevarghese Philip, M. S. Ramanujan:
Vertex Exponential Algorithms for Connected f-Factors. 61-71 - Manu Basavaraju, Fedor V. Fomin
Connecting Vertices by Independent Trees. 73-84 - Archontia C. Giannopoulou, Daniel Lokshtanov, Saket Saurabh, Ondrej Suchý
Tree Deletion Set Has a Polynomial Kernel (but no OPT^O(1) Approximation). 85-96 - Konrad Kazimierz Dabrowski
Editing to Eulerian Graphs. 97-108 - Christoph Berkholz, Michael Elberfeld:
Parameterized Complexity of Fixed Variable Logics. 109-120 - Laurent Doyen, Line Juhl, Kim Guldstrand Larsen
Synchronizing Words for Weighted and Timed Automata. 121-132 - Emmanuel Filiot
Finite-Valued Weighted Automata. 133-145 - Emmanuel Filiot
First-order Definable String Transformations. 147-159 - Shaull Almagor
Regular Sensing. 161-173 - Matthias Keil
Symbolic Solving of Extended Regular Expression Inequalities. 175-186 - Adrian Bock, Yuri Faenza, Carsten Moldenhauer, Andres J. Ruiz-Vargas:
Solving the Stable Set Problem in Terms of the Odd Cycle Packing Number. 187-198 - Konstantinos Georgiou, Edward Lee:
Lift & Project Systems Performing on the Partial Vertex Cover Polytope. 199-211 - Sonika Arora, Venkatesan T. Chakaravarthy, Kanika Gupta, Neelima Gupta, Yogish Sabharwal:
Replica Placement on Directed Acyclic Graphs. 213-225 - Manoj Gupta:
Maintaining Approximate Maximum Matching in an Incremental Bipartite Graph in Polylogarithmic Update Time. 227-239 - Hazem Torfah
The Complexity of Counting Models of Linear-time Temporal Logic. 241-252 - Fu Song, Zhilin Wu:
Extending Temporal Logics with Data Variable Quantifications. 253-265 - Thomas Colcombet, Amaldev Manuel:
Generalized Data Automata and Fixpoint Logic. 267-278 - Claire David, Nadime Francis, Filip Murlak
Consistency of Injective Tree Patterns. 279-290 - Gonzalo Navarro, Rajeev Raman
Asymptotically Optimal Encodings for Range Selection. 291-301 - Roberto Grossi, Giulia Menconi
Output-Sensitive Pattern Extraction in Sequences. 303-314 - Sariel Har-Peled
Robust Proximity Search for Balls Using Sublinear Space. 315-326 - Efraim Gelman, Amnon Ta-Shma
The Benes Network is q*(q-1)/2n-Almost q-set-wise Independent. 327-338 - Dmitry Chistikov
Notes on Counting with Finite Machines. 339-350 - Patricia Bouyer, Nicolas Markey, Daniel Stan
Mixed Nash Equilibria in Concurrent Terminal-Reward Games. 351-363 - Paul Hunter
Quantitative Games with Interval Objectives. 365-377 - Thomas Colcombet, Nathanaël Fijalkow
Playing Safe. 379-390 - Flávio L. C. de Moura
Metaconfluence of Calculi with Explicit Substitutions at a Distance. 391-402 - Paolo Baldan, Filippo Bonchi
Behavioral Metrics via Functor Lifting. 403-415 - Nathalie Bertrand
Foundation of Diagnosis and Predictability in Probabilistic Systems. 417-429 - Thomas A. Henzinger, Jan Otop
Lipschitz Robustness of Finite-state Transducers. 431-443 - Debasis Mandal, Aduri Pavan, Rajeswari Venugopalan:
Separating Cook Completeness from Karp-Levin Completeness Under a Worst-Case Hardness Hypothesis. 445-456 - Danny Hucke, Markus Lohrey, Eric Noeth:
Constructing Small Tree Grammars and Small Circuits for Formulas. 457-468 - Ryan O'Donnell, A. C. Cem Say
One Time-traveling Bit is as Good as Logarithmically Many. 469-480 - Hartmut Klauck
New Bounds for the Garden-Hose Model. 481-492 - Arnaud Durand, Meena Mahajan
Homomorphism Polynomials Complete for VP. 493-504 - Rohit Chadha, Umang Mathur
Computing Information Flow Using Symbolic Model-Checking. 505-516 - Fabrizio Biondi, Axel Legay, Bo Friis Nielsen, Pasquale Malacaria, Andrzej Wasowski
Information Leakage of Non-Terminating Processes. 517-529 - Jean-François Raskin, Ocan Sankur:
Multiple-Environment Markov Decision Processes. 531-543 - Franck Cassez
Summary-Based Inter-Procedural Analysis via Modular Trace Refinement. 545-556 - Mary Southern, Kaustuv Chaudhuri:
A Two-Level Logic Approach to Reasoning About Typed Specification Languages. 557-569 - Taolue Chen
On the Complexity of Computing Maximum Entropy for Markovian Models. 571-583 - Diptarka Chakraborty, Aduri Pavan, Raghunath Tewari, N. V. Vinodchandran, Lin F. Yang
New Time-Space Upperbounds for Directed Reachability in High-genus and H-minor-free Graphs. 585-595 - Anant Dhayal, Jayalal Sarma, Saurabh Sawlani:
Polynomial Min/Max-weighted Reachability is in Unambiguous Log-space. 597-609 - Mohamed Faouzi Atig, Ahmed Bouajjani, K. Narayan Kumar, Prakash Saivasan:
On Bounded Reachability Analysis of Shared Memory Systems. 611-623 - Benedikt Bollig, Paul Gastin, Akshay Kumar:
Parameterized Communicating Automata: Complementation and Model Checking. 625-637 - Anca Muscholl, Igor Walukiewicz:
Distributed Synthesis for Acyclic Architectures. 639-651 - Parosh Aziz Abdulla, Mohamed Faouzi Atig, Ahmet Kara, Othmane Rezine:
Verification of Dynamic Register Automata. 653-665
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-11-15 19:20 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: