| Invited Talks |
| Informative Labeling Schemes (Abstract) / Pierre Fraigniaud |
| Noetherian Spaces in Verification / Jean Goubault-Larrecq |
| Towards a Theory of Time-Bounded Verification / Joël Ouaknine ; James Worrell |
| Physical Algorithms / Roger Wattenhofer |
| Track B. Automata / Session 1： |
| Optimal Zielonka-Type Construction of Deterministic Asynchronous Automata / Blaise Genest ; Hugo Gimbert ; Anca Muscholl ; Igor Walukiewicz |
| Pumping and Counting on the Regular Post Embedding Problem / Pierre Chambart ; Philippe Schnoebelen |
| Alternation Removal in Büchi Automata / Udi Boker ; Orna Kupferman ; Adin Rosenberg |
| Linear Orders in the Pushdown Hierarchy / Laurent Braud ; Arnaud Carayol |
| Track C. Communication in Networks |
| The Serializability of Network Codes / Anna Blasiak ; Robert Kleinberg |
| How Efficient Can Gossip Be? (On the Cost of Resilient Information Exchange) / Dan Alistarh ; Seth Gilbert ; Rachid Guerraoui ; Morteza Zadimoghaddam |
| Efficient Information Exchange in the Random Phone-Call Model / Petra Berenbrink ; Jurek Czyzowicz ; Robert Elsässer ; Leszek Gasieniec |
| An O(log n)-Competitive Online Centralized Randomized Packet-Routing Algorithm for Lines / Guy Even ; Moti Medina |
| Track B. Formal Languages / Session 2： |
| A Topological Approach to Recognition / Mai Gehrke ; Serge Grigorieff ; Jean-Éric Pin |
| On LR(k)-Parsers of polynomial Size (Extended Abstract) / Norbert Blum |
| On Erasing Productions in Random Context Grammars / Georg Zetzsche |
| Track B. Semantics / Session 4： |
| Game Semantics for Call-by-Value Polymorphism / James Laird |
| What is a Pure Functional? / Martin Hofmann ; Aleksandr Karbyshev ; Helmut Seidl |
| Example-Guided Abstraction Simplification / Roberto Giacobazzi ; Francesco Ranzato |
| Compositional Closure for Bayes Risk in Probabilistic Noninterference / Annabelle McIver ; Larissa Meinicke ; Carroll Morgan |
| Track C. Fault Tolerance, Ranking |
| Asynchronous Throughput-Optimal Routing In Malicious Networks / Paul Bunn ; Rafail Ostrovsky |
| Improved Fault Tolerance and Secure Computation on Sparse Networks / Nishanth Chandran ; Juan Garay |
| Sparse Reliable Graph Backbones / Shiri Chechik ; Yuval Emek ; Boaz Patt-Shamir ; David Peleg |
| Approximation Algorithms for Diversified Search Ranking / Nikhil Bansal ; Kamal Jain ; Anna Kazeykina ; Joseph (Seffi) Naor |
| Track B. Graphs Categories and Quantum Information / Session 5： |
| Rewriting Measurement-Based Quantum Computations with Generalised Flow / Ross Duncan ; Simon Perdrix |
| The Compositional Structure of Multipartite Quantum Entanglement / Bob Coecke ; Aleks Kissinger |
| Compositionality in Graph Transformation / Arend Rensink |
| Track B. Best Paper Award / Session 6： |
| On p-Optimal Proof Systems and Logics for PTIME / Yijia Chen ; Jörg Flum |
| Track C. Best Paper Award |
| Placing Regenerators in Optical Networks to Satisfy Multiple Sets of Requests / George B. Mertzios ; Ignasi Sau ; Mordechai Shalom ; Shmuel Zaks |
| Track B. Logic / Session 7： |
| Maximal Decidable Fragments of Halpern and Shoham's Modal Logic of Intervals / Angelo Montanari ; Gabriele Puppis ; Pietro Sala |
| B and D Are Enough to Make the Halpern-Shoham Logic Undecidable / Jerzy Marcinkowski ; Jakub Michaliszyn ; Emanuel Kieronski |
| Parameterized Modal Satisfiability / Antonis Achilleos ; Michael Lampis ; Valia Mitsou |
| Automata for Coalgebras: An Approach Using Predicate Liftings / Gaëlle Fontaine ; Raul Leal ; Yde Venema |
| Track C. Privacy, Selfishness |
| Resolving the Complexity of Some Data Privacy Problems / Jeremiah Blocki ; Ryan Williams |
| Private and Continual Release of Statistics / T-H. Hubert Chan ; Elaine Shi ; Dawn Song |
| Envy-Free Pricing in Multi-item Markets / Ning Chen ; Xiaotie Deng |
| Contention Resolution under Selfishness / George Christodoulou ; Katrina Ligett ; Evangelia Pyrga |
| Track B. Concurrency / Session 8： |
| On the Expressiveness of Polyadic and Synchronous Communication in Higher-Order Process Calculi / Ivan Lanese ; Jorge A. Pérez ; Davide Sangiorgi ; Alan Schmitt |
| On Bisimilarity and Substitution in Presence of Replication / Daniel Hirschkoff ; Damien Pous |
| The Downward-Closure of Petri Net Languages / Peter Habermehl ; Roland Meyer ; Harro Wimmel |
| Reachability Games on Extended Vector Addition Systems with State / Tomáš Brázdil ; Petr Jancar ; AntonÃn Kucera |
| Track C. Mobile Agents |
| Modelling Mobility: A Discrete Revolution (Extended Abstract) / Andrea E.F. Clementi ; Angelo Monti ; Riccardo Silvestri |
| Tell Me Where I Am So I Can Meet You Sooner: (Asynchronous Rendezvous with Location Information) / Andrew Collins ; Arnaud Labourel |
| Rendezvous of Mobile Agents without Agreement on Local Orientation / Jérémie Chalopin ; Shantanu Das |
| Track B. Probabilistic Computation / Session 9： |
| Probabilistic Automata on Finite Words: Decidable and Undecidable Problems / Youssouf Oualhadj |
| Space-Efficient Scheduling of Stochastically Generated Tasks / Javier Esparza ; Stefan Kiefer ; Michael Luttenberger |
| Exponential Lower Bounds For Policy Iteration / John Fearnley |
| Regular Temporal Cost Functions / Thomas Colcombet ; Denis Kuperberg ; Sylvain LombardySession 10： |
| Model Checking Succinct and Parametric One-Counter Automata / Stefan Göller ; Christoph Haase |
| Pebble Weighted Automata and Transitive Closure Logics / Benedikt Bollig ; Paul Gastin ; Benjamin Monmege ; Marc Zeitoun |
| Energy Parity Games / Krishnendu Chatterjee ; Laurent Doyen |
| Author Index |
| Invited Talks |
| Informative Labeling Schemes (Abstract) / Pierre Fraigniaud |
| Noetherian Spaces in Verification / Jean Goubault-Larrecq |
図書
ＥＢ
