LIPIcs, Volume 29, FSTTCS 2014

Venkatesh Raman and S. P. Suresh LIPIcs, Volume 29, FSTTCS'14, Complete Volume 10.4230/LIPIcs.FSTTCS.2014
Venkatesh Raman and S. P. Suresh Front Matter, Table of Contents, Preface, Conference Organization 10.4230/LIPIcs.FSTTCS.2014.i
Nikhil Bansal New Developments in Iterated Rounding (Invited Talk) 10.4230/LIPIcs.FSTTCS.2014.1
Aiswarya Cyriac and Paul Gastin Reasoning About Distributed Systems: WYSIWYG (Invited Talk) 10.4230/LIPIcs.FSTTCS.2014.11
Martin Grohe Colour Refinement: A Simple Partitioning Algorithm with Applications From Graph Isomorphism Testing to Machine Learning (Invited Talk) 10.4230/LIPIcs.FSTTCS.2014.31
Orna Kupferman and Tami Tamir Properties and Utilization of Capacitated Automata (Invited Talk) 10.4230/LIPIcs.FSTTCS.2014.33
Erick Chastain, Adi Livnat, Christos H. Papadimitriou, and Umesh V. Vazirani Algorithms, Games, and Evolution (Invited Talk) 10.4230/LIPIcs.FSTTCS.2014.45
Richard Ryan Williams The Polynomial Method in Circuit Complexity Applied to Algorithm Design (Invited Talk) 10.4230/LIPIcs.FSTTCS.2014.47
Geevarghese Philip and M. S. Ramanujan Vertex Exponential Algorithms for Connected f-Factors 10.4230/LIPIcs.FSTTCS.2014.61
Manu Basavaraju, Fedor V. Fomin, Petr A. Golovach, and Saket Saurabh Connecting Vertices by Independent Trees 10.4230/LIPIcs.FSTTCS.2014.73
Archontia C. Giannopoulou, Daniel Lokshtanov, Saket Saurabh, and Ondrej Suchy Tree Deletion Set Has a Polynomial Kernel (but no OPT^O(1) Approximation) 10.4230/LIPIcs.FSTTCS.2014.85
Konrad K. Dabrowski, Petr A. Golovach, Pim van 't Hof, and Daniel Paulusma Editing to Eulerian Graphs 10.4230/LIPIcs.FSTTCS.2014.97
Christoph Berkholz and Michael Elberfeld Parameterized Complexity of Fixed Variable Logics 10.4230/LIPIcs.FSTTCS.2014.109
Laurent Doyen, Line Juhl, Kim G. Larsen, Nicolas Markey, and Mahsa Shirmohammadi Synchronizing Words for Weighted and Timed Automata 10.4230/LIPIcs.FSTTCS.2014.121
Emmanuel Filiot, Raffaella Gentilini, and Jean-Francois Raskin Finite-Valued Weighted Automata 10.4230/LIPIcs.FSTTCS.2014.133
Emmanuel Filiot, Shankara Narayanan Krishna, and Ashutosh Trivedi First-order Definable String Transformations 10.4230/LIPIcs.FSTTCS.2014.147
Shaull Almagor, Denis Kuperberg, and Orna Kupferman Regular Sensing 10.4230/LIPIcs.FSTTCS.2014.161
Matthias Keil and Peter Thiemann Symbolic Solving of Extended Regular Expression Inequalities 10.4230/LIPIcs.FSTTCS.2014.175
Adrian Bock, Yuri Faenza, Carsten Moldenhauer, and Andres Jacinto Ruiz-Vargas Solving the Stable Set Problem in Terms of the Odd Cycle Packing Number 10.4230/LIPIcs.FSTTCS.2014.187
Konstantinos Georgiou and Edward Lee Lift & Project Systems Performing on the Partial Vertex Cover Polytope 10.4230/LIPIcs.FSTTCS.2014.199
Sonika Arora, Venkatesan T. Chakaravarthy, Kanika Gupta, Neelima Gupta, and Yogish Sabharwal Replica Placement on Directed Acyclic Graphs 10.4230/LIPIcs.FSTTCS.2014.213
Manoj Gupta Maintaining Approximate Maximum Matching in an Incremental Bipartite Graph in Polylogarithmic Update Time 10.4230/LIPIcs.FSTTCS.2014.227
Hazem Torfah and Martin Zimmermann The Complexity of Counting Models of Linear-time Temporal Logic 10.4230/LIPIcs.FSTTCS.2014.241
Fu Song and Zhilin Wu Extending Temporal Logics with Data Variable Quantifications 10.4230/LIPIcs.FSTTCS.2014.253
Thomas Colcombet and Amaldev Manuel Generalized Data Automata and Fixpoint Logic 10.4230/LIPIcs.FSTTCS.2014.267
Claire David, Nadime Francis, and Filip Murlak Consistency of Injective Tree Patterns 10.4230/LIPIcs.FSTTCS.2014.279
Gonzalo Navarro, Rajeev Raman, and Srinivasa Rao Satti Asymptotically Optimal Encodings for Range Selection 10.4230/LIPIcs.FSTTCS.2014.291
Roberto Grossi, Giulia Menconi, Nadia Pisanti, Roberto Trani, and Soren Vind Output-Sensitive Pattern Extraction in Sequences 10.4230/LIPIcs.FSTTCS.2014.303
Sariel Har-Peled and Nirman Kumar Robust Proximity Search for Balls Using Sublinear Space 10.4230/LIPIcs.FSTTCS.2014.315
Efraim Gelman and Amnon Ta-Shma The Benes Network is q*(q-1)/2n-Almost q-set-wise Independent 10.4230/LIPIcs.FSTTCS.2014.327
Dmitry Chistikov Notes on Counting with Finite Machines 10.4230/LIPIcs.FSTTCS.2014.339
Patricia Bouyer, Nicolas Markey, and Daniel Stan Mixed Nash Equilibria in Concurrent Terminal-Reward Games 10.4230/LIPIcs.FSTTCS.2014.351
Paul Hunter and Jean-Francois Raskin Quantitative Games with Interval Objectives 10.4230/LIPIcs.FSTTCS.2014.365
Thomas Colcombet, Nathanael Fijalkow, and Florian Horn Playing Safe 10.4230/LIPIcs.FSTTCS.2014.379
Flávio L. C. de Moura, Delia Kesner, and Mauricio Ayala-Rincón Metaconfluence of Calculi with Explicit Substitutions at a Distance 10.4230/LIPIcs.FSTTCS.2014.391
Paolo Baldan, Filippo Bonchi, Henning Kerstan, and Barbara König Behavioral Metrics via Functor Lifting 10.4230/LIPIcs.FSTTCS.2014.403
Nathalie Bertrand, Serge Haddad, and Engel Lefaucheux Foundation of Diagnosis and Predictability in Probabilistic Systems 10.4230/LIPIcs.FSTTCS.2014.417
Thomas A. Henzinger, Jan Otop, and Roopsha Samanta Lipschitz Robustness of Finite-state Transducers 10.4230/LIPIcs.FSTTCS.2014.431
Debasis Mandal, A. Pavan, and Rajeswari Venugopalan Separating Cook Completeness from Karp-Levin Completeness Under a Worst-Case Hardness Hypothesis 10.4230/LIPIcs.FSTTCS.2014.445
Danny Hucke, Markus Lohrey, and Eric Noeth Constructing Small Tree Grammars and Small Circuits for Formulas 10.4230/LIPIcs.FSTTCS.2014.457
Ryan O'Donnell and A. C. Cem Say One Time-traveling Bit is as Good as Logarithmically Many 10.4230/LIPIcs.FSTTCS.2014.469
Hartmut Klauck and Supartha Podder New Bounds for the Garden-Hose Model 10.4230/LIPIcs.FSTTCS.2014.481
Arnaud Durand, Meena Mahajan, Guillaume Malod, Nicolas de Rugy-Altherre, and Nitin Saurabh Homomorphism Polynomials Complete for VP 10.4230/LIPIcs.FSTTCS.2014.493
Rohit Chadha, Umang Mathur, and Stefan Schwoon Computing Information Flow Using Symbolic Model-Checking 10.4230/LIPIcs.FSTTCS.2014.505
Fabrizio Biondi, Axel Legay, Bo Friis Nielsen, Pasquale Malacaria, and Andrzej Wasowski Information Leakage of Non-Terminating Processes 10.4230/LIPIcs.FSTTCS.2014.517
Jean-Francois Raskin and Ocan Sankur Multiple-Environment Markov Decision Processes 10.4230/LIPIcs.FSTTCS.2014.531
Franck Cassez, Christian Müller, and Karla Burnett Summary-Based Inter-Procedural Analysis via Modular Trace Refinement 10.4230/LIPIcs.FSTTCS.2014.545
Mary Southern and Kaustuv Chaudhuri A Two-Level Logic Approach to Reasoning About Typed Specification Languages 10.4230/LIPIcs.FSTTCS.2014.557
Taolue Chen and Tingting Han On the Complexity of Computing Maximum Entropy for Markovian Models 10.4230/LIPIcs.FSTTCS.2014.571
Diptarka Chakraborty, A. Pavan, Raghunath Tewari, N. V. Vinodchandran, and Lin Forrest Yang New Time-Space Upperbounds for Directed Reachability in High-genus and H-minor-free Graphs 10.4230/LIPIcs.FSTTCS.2014.585
Anant Dhayal, Jayalal Sarma, and Saurabh Sawlani Polynomial Min/Max-weighted Reachability is in Unambiguous Log-space 10.4230/LIPIcs.FSTTCS.2014.597
Mohamed Faouzi Atig, Ahmed Bouajjani, K. Narayan Kumar, and Prakash Saivasan On Bounded Reachability Analysis of Shared Memory Systems 10.4230/LIPIcs.FSTTCS.2014.611
Benedikt Bollig, Paul Gastin, and Akshay Kumar Parameterized Communicating Automata: Complementation and Model Checking 10.4230/LIPIcs.FSTTCS.2014.625
Anca Muscholl and Igor Walukiewicz Distributed Synthesis for Acyclic Architectures 10.4230/LIPIcs.FSTTCS.2014.639
Parosh Aziz Abdulla, Mohamed Faouzi Atig, Ahmet Kara, and Othmane Rezine Verification of Dynamic Register Automata 10.4230/LIPIcs.FSTTCS.2014.653