Parosh Aziz Abdulla, Mohamed Faouzi Atig, Ahmet Kara and Othmane Rezine
Verification of Dynamic Register Automata

Shaull Almagor, Denis Kuperberg and Orna Kupferman
Regular Sensing

Sonika Arora, Venkatesan Chakaravarthy, Kanika Gupta, Neelima Gupta and Yogish Sabharwal
Replica Placement on Directed Acyclic Graphs

Mohamed Faouzi Atig, Ahmed Bouajjani, K. Narayan Kumar and Prakash Saivasan
On Bounded Reachability Analysis of Shared Memory Systems

Paolo Baldan, Filippo Bonchi, Henning Kerstan and Barbara König
Behavioral Metrics via Functor Lifting

Manu Basavaraju, Fedor Fomin, Petr Golovach and Saket Saurabh
Connecting Vertices by Independent Trees

Christoph Berkholz and Michael Elberfeld
Parameterized Complexity of Fixed-Variable Logics

Nathalie Bertrand, Serge Haddad and Engel Lefaucheux
Foundation of Diagnosis and Predictability in Probabilistic Systems

Fabrizio Biondi, Axel Legay, Pasquale Malacaria, Bo Friis Nielsen and Andrzej Wasowski
Information Leakage of Non-Terminating Processes

Adrian Bock, Yuri Faenza, Carsten Moldenhauer and Andres J. Ruiz-Vargas
Solving the stable set problem in terms of the odd cycle packing number

Benedikt Bollig, Paul Gastin and Akshay Kumar
Parameterized Communicating Automata: Complementation and Model Checking

Patricia Bouyer, Nicolas Markey and Daniel Stan
Mixed Nash Equilibria in Concurrent Games

Franck Cassez, Christian Müller and Karla Burnett
Summary-Based Inter-Procedural Analysis via Modular Trace Refinement

Rohit Chadha, Umang Mathur and Stefan Schwoon
Computing Information Flow Using Symbolic Model-Checking

Diptarka Chakraborty, A Pavan, Raghunath Tewari, N. V. Vinodchandran and Lin Yang
New Time-Space Upperbounds for Directed Reachability in High-genus and H-minor-free Graphs

Taolue Chen and Tingting Han
On the Complexity of Computing Maximum Entropy for Markovian Models

Dmitry Chistikov
Notes on Counting with Finite Machines

Thomas Colcombet, Nathanaël Fijalkow and Florian Horn
Playing Safe

Thomas Colcombet and Amaldev Manuel
Generalized Data Automata and Fixpoint Logic

Konrad Kazimierz Dabrowski, Petr Golovach, Pim Van 'T Hof and Daniel Paulusma
Editing to Eulerian Graphs

Claire David, Nadime Francis and Filip Murlak
Consistency of injective tree patterns

Flavio Leonardo Cavalcanti de Moura, Delia Kesner and Mauricio Ayala-Rincon
Metaconfluence of Calculi with Explicit Substitutions at a Distance

Anant Dhayal, Jayalal Sarma and Saurabh Sawlani
Polynomial Min/Max-weighted Reachability is in Unambiguous Logspace

Laurent Doyen, Line Juhl, Kim Guldstrand Larsen, Nicolas Markey and Mahsa Shirmohammadi
Synchronizing words for weighted and timed automata

Arnaud Durand, Meena Mahajan, Guillaume Malod, Nicolas de Rugy-Altherre and Nitin Saurabh
Homomorphism polynomials complete for VP

Emmanuel Filiot, Raffaella Gentilini and Jean-François Raskin
Finite-Valued Weighted Automata

Emmanuel Filiot, Krishna S. and Ashutosh Trivedi
First-order definable string transformations

Konstantions Georgiou and Edward Lee
Lift & Project Systems Performing on the Partial Vertex Cover Polytope

Archontia Giannopoulou, Daniel Lokshtanov, Saket Saurabh and Ondrej Suchy
Tree Deletion Set Has a Polynomial Kernel (but no OPT^O(1) Approximation)

Roberto Grossi, Giulia Menconi, Nadia Pisanti, Roberto Trani and Søren Vind
Output-Sensitive Pattern Extraction in Sequences

Manoj Gupta
Maintaining (1 +ε) approximate maximum matching in an incremental bipartite graph in poly(log n, ε) update time

Sariel Har-Peled and Nirman Kumar
Robust Proximity Search for Balls using Sublinear Space

Thomas Henzinger, Jan Otop and Roopsha Samanta
Lipschitz Robustness of Finite-state Transducers

Danny Hucke, Markus Lohrey and Eric Nöth
Constructing small tree grammars and small circuits for formulas

Paul Hunter and Jean-François Raskin
Quantitative games with interval objectives

Matthias Keil and Peter Thiemann
Symbolic Solving of Regular Expression Inequalities

Hartmut Klauck and Supartha Podder
New Bounds for the Garden-Hose Model

Ramanujan M. S and Geevarghese Philip
Vertex Exponential Algorithms for Connected f-Factors

Debasis Mandal, A Pavan and Rajeswari Venugopalan
Separating Cook Completeness from Karp-Levin Completeness under a Worst-Case Hardness Hypothesis

Anca Muscholl and Igor Walukiewicz
Distributed synthesis for acyclic architectures

Gonzalo Navarro, Rajeev Raman and Srinivasa Rao Satti
Asymptotically Optimal Encodings for Range Selection

Ryan O'Donnell and A. C. Cem Say
One time-traveling bit is as good as logarithmically many

Jean-François Raskin and Ocan Sankur
Multiple-Environment Markov Decision Processes

Fu Song and Zhilin Wu
Extending temporal logics with data variable quantifications

Mary Southern and Kaustuv Chaudhuri
A Two-Level Logic Approach to Reasoning about Typed Specification Languages

Amnon Ta-Shma and Efraim Gelman
The Benes network is q(q-1)/2n almost q-wise independent

Hazem Torfah and Martin Zimmermann
The Complexity of Counting Models of Linear-time Temporal Logic