Automata, Languages, and Programming

39th International Colloquium, ICALP 2012, Warwick, UK, July 9-13, 2012, Proceedings, Part II

  • Artur Czumaj
  • Kurt Mehlhorn
  • Andrew Pitts
  • Roger Wattenhofer
Conference proceedings ICALP 2012

DOI: 10.1007/978-3-642-31585-5

Part of the Lecture Notes in Computer Science book series (LNCS, volume 7392)

Table of contents (58 papers)

  1. Front Matter
  2. Invited Talks

    1. On Multiple Keyword Sponsored Search Auctions with Budgets
      Riccardo Colini-Baldeschi, Monika Henzinger, Stefano Leonardi, Martin Starnberger
      Pages 1-12
    2. Standing on the Shoulders of a Giant
      David Harel
      Pages 16-22
    3. Session Types and Distributed Computing
      Kohei Honda
      Pages 23-23
    4. Randomized Mechanisms for Multi-unit Auctions
      Berthold Vöcking
      Pages 27-29
  3. Track B – Logic Semantics, Automata and Theory of Programming

    1. Algebraic Synchronization Trees and Processes
      Luca Aceto, Arnaud Carayol, Zoltán Ésik, Anna Ingólfsdóttir
      Pages 30-41
    2. Streaming Tree Transducers
      Rajeev Alur, Loris D’Antoni
      Pages 42-53
    3. Causal Graph Dynamics
      Pablo Arrighi, Gilles Dowek
      Pages 54-66
    4. Monadic Datalog Containment
      Michael Benedikt, Pierre Bourhis, Pierre Senellart
      Pages 79-91
    5. A Machine-Independent Characterization of Timed Languages
      Mikołaj Bojańczyk, Sławomir Lasota
      Pages 92-103
    6. Toward Model Theory with Data Values
      Mikołaj Bojańczyk, Thomas Place
      Pages 116-127
    7. Robust Reachability in Timed Automata: A Game-Based Approach
      Patricia Bouyer, Nicolas Markey, Ocan Sankur
      Pages 128-140
    8. Minimizing Expected Termination Time in One-Counter Markov Decision Processes
      Tomáš Brázdil, Antonín Kučera, Petr Novotný, Dominik Wojtczak
      Pages 141-152
    9. A Saturation Method for Collapsible Pushdown Systems
      Chris Broadbent, Arnaud Carayol, Matthew Hague, Olivier Serre
      Pages 165-176
    10. Regular Languages Are Church-Rosser Congruential
      Volker Diekert, Manfred Kufleitner, Klaus Reinhardt, Tobias Walter
      Pages 177-188

Other volumes

  1. Automata, Languages, and Programming
    39th International Colloquium, ICALP 2012, Warwick, UK, July 9-13, 2012, Proceedings, Part I
  2. Automata, Languages, and Programming
    39th International Colloquium, ICALP 2012, Warwick, UK, July 9-13, 2012, Proceedings, Part II

About these proceedings

Introduction

This two-volume set of LNCS 7391 and LNCS 7392 constitutes the refereed proceedings of the 39th International Colloquium on Automata, Languages and Programming, ICALP 2012, held in Warwick, UK, in July 2012.
The total of 123 revised full papers presented in this volume were carefully reviewed and selected from 432 submissions. They are organized in three tracks focussing on algorithms, complexity and games; logic, semantics, automata and theory of programming; and foundations of networked computation.

Keywords

approximation computational complexity dynamical networks multi-party computation regular expressions

Editors and affiliations

  • Artur Czumaj
    • 1
  • Kurt Mehlhorn
    • 2
  • Andrew Pitts
    • 3
  • Roger Wattenhofer
    • 4
  1. 1.Department of Computer Science and Centre for Discrete Mathematics and its ApplicationsUniversity of WarwickWarwickUK
  2. 2.Max-Planck-Institut für InformatikSaarbrückenGermany
  3. 3.Computer Laboratory,University of CambridgeUK
  4. 4.ETH ZurichSwitzerland

Bibliographic information

  • Copyright Information Springer-Verlag Berlin Heidelberg 2012
  • Publisher Name Springer, Berlin, Heidelberg
  • eBook Packages Computer Science
  • Print ISBN 978-3-642-31584-8
  • Online ISBN 978-3-642-31585-5
  • Series Print ISSN 0302-9743
  • Series Online ISSN 1611-3349