Automata, Languages, and Programming

1. Track B: Logic, Semantics, Automata, and Theory of Programming

   1. Bisimulation Equivalence of First-Order Grammars

      • Petr Jančar

      Pages 232-243

   2. Context Unification is in PSPACE

      • Artur Jeż

      Pages 244-255

   3. Monodic Fragments of Probabilistic First-Order Logic

      • Jean Christoph Jung, Carsten Lutz, Sergey Goncharov, Lutz Schröder

      Pages 256-267

   4. Stability and Complexity of Minimising Probabilistic Automata

      • Stefan Kiefer, Björn Wachter

      Pages 268-279

   5. Kleene Algebra with Equations

      • Dexter Kozen, Konstantinos Mamouras

      Pages 280-292

   6. All–Instances Termination of Chase is Undecidable

      • Tomasz Gogacz, Jerzy Marcinkowski

      Pages 293-304

   7. Non-uniform Polytime Computation in the Infinitary Affine Lambda-Calculus

      • Damiano Mazza

      Pages 305-317

   8. On the Positivity Problem for Simple Linear Recurrence Sequences,

      • Joël Ouaknine, James Worrell

      Pages 318-329

   9. Ultimate Positivity is Decidable for Simple Linear Recurrence Sequences

      • Joël Ouaknine, James Worrell

      Pages 330-341

   10. Going Higher in the First-Order Quantifier Alternation Hierarchy on Words

       • Thomas Place, Marc Zeitoun

       Pages 342-353

   11. Hardness Results for Intersection Non-Emptiness

       • Michael Wehar

       Pages 354-362

   12. Branching Bisimilarity Checking for PRS

       • Qiang Yin, Yuxi Fu, Chaodong He, Mingzhang Huang, Xiuting Tao

       Pages 363-374

2. Track C: Foundations of Networked Computing

   1. Labeling Schemes for Bounded Degree Graphs

      • David Adjiashvili, Noy Rotbart

      Pages 375-386

   2. Bounded-Angle Spanning Tree: Modeling Networks with Angular Constraints

      • Rom Aschner, Matthew J. Katz

      Pages 387-398

   3. Distributed Computing on Core-Periphery Networks: Axiom-Based Design

      • Chen Avin, Michael Borokhovich, Zvi Lotker, David Peleg

      Pages 399-410

   4. Fault-Tolerant Rendezvous in Networks

      • Jérémie Chalopin, Yoann Dieudonné, Arnaud Labourel, Andrzej Pelc

      Pages 411-422

   5. Data Delivery by Energy-Constrained Mobile Agents on a Line

      • Jérémie Chalopin, Riko Jacob, Matúš Mihalák, Peter Widmayer

      Pages 423-434

   6. The Power of Two Choices in Distributed Voting

      • Colin Cooper, Robert Elsässer, Tomasz Radzik

      Pages 435-446

   7. Jamming-Resistant Learning in Wireless Networks

      • Johannes Dams, Martin Hoefer, Thomas Kesselheim

      Pages 447-458

   8. Facility Location in Evolving Metrics

      • David Eisenstat, Claire Mathieu, Nicolas Schabanel

      Pages 459-470

This two-volume set of LNCS 8572 and LNCS 8573 constitutes the refereed proceedings of the 41st International Colloquium on Automata, Languages and Programming, ICALP 2014, held in Copenhagen, Denmark, in July 2014. The total of 136 revised full papers presented together with 4 invited talks were carefully reviewed and selected from 484 submissions. The papers are organized in three tracks focussing on Algorithms, Complexity, and Games, Logic, Semantics, Automata, and Theory of Programming, Foundations of Networked Computation.

• approximation algorithms
• cellular automata
• computational complexity
• cryptography
• dynamic programming
• fault-tolerance
• mobile agents
• number theory algorithms
• pattern matching
• proof systems
• state compexity
• algorithm analysis and problem complexity

• Institut für Informatik, Technische Universität München, München, Germany

  Javier Esparza

• LIAFA, Université Paris Diderot-Paris 7, Paris Cedex 13, France

  Pierre Fraigniaud

• IT University of Copenhagen, Copenhagen, Denmark

  Thore Husfeldt

• Department Computer Science, University of Oxford, Oxford, UK,

  Elias Koutsoupias

Policies and ethics