Skip to main content
Springer Nature Link
Log in

Automata, Languages, and Programming

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

  • Conference proceedings
  • © 2012

Overview

Editors:
  1. Artur Czumaj

    1. Department of Computer Science and Centre for Discrete Mathematics and its Applications, University of Warwick, Warwick, UK

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  2. Kurt Mehlhorn

    1. Max-Planck-Institut für Informatik, Saarbrücken, Germany

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  3. Andrew Pitts

    1. Computer Laboratory,, University of Cambridge, UK

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  4. Roger Wattenhofer

    1. ETH Zurich, Switzerland

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  • Up-to-date results
  • Fast-track conference proceedings
  • State-of-the-art research

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

Part of the book sub series: Theoretical Computer Science and General Issues (LNTCS)

Included in the following conference series:

Conference proceedings info: ICALP 2012.

This is a preview of subscription content, log in via an institution to check access.

Access this book

Log in via an institution
eBook USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

Tax calculation will be finalised at checkout

Other ways to access

Licence this eBook for your library

Institutional subscriptions

About this book

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.

Similar content being viewed by others

Keywords

Table of contents (58 papers)

  1. Front Matter

    Download chapter PDF

  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. A Theory Independent Curry-De Bruijn-Howard Correspondence

      • Gilles Dowek
      Pages 13-15

    3. Standing on the Shoulders of a Giant

      • David Harel
      Pages 16-22

    4. Session Types and Distributed Computing

      • Kohei Honda
      Pages 23-23

    5. Algorithms, Graph Theory, and the Solution of Laplacian Linear Equations

      • Daniel A. Spielman
      Pages 24-26

    6. 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. Degree Lower Bounds of Tower-Type for Approximating Formulas with Parity Quantifiers

      • Albert Atserias, Anuj Dawar
      Pages 67-78

    5. Monadic Datalog Containment

      • Michael Benedikt, Pierre Bourhis, Pierre Senellart
      Pages 79-91

    6. A Machine-Independent Characterization of Timed Languages

      • Mikołaj Bojańczyk, Sławomir Lasota
      Pages 92-103

    7. Regular Languages of Infinite Trees That Are Boolean Combinations of Open Sets

      • Mikołaj Bojańczyk, Thomas Place
      Pages 104-115

    8. Toward Model Theory with Data Values

      • Mikołaj Bojańczyk, Thomas Place
      Pages 116-127

    9. Robust Reachability in Timed Automata: A Game-Based Approach

      • Patricia Bouyer, Nicolas Markey, Ocan Sankur
      Pages 128-140

    10. Minimizing Expected Termination Time in One-Counter Markov Decision Processes

      • Tomáš Brázdil, Antonín Kučera, Petr Novotný, Dominik Wojtczak
      Pages 141-152

    11. Prefix Rewriting for Nested-Words and Collapsible Pushdown Automata

      • Christopher Broadbent
      Pages 153-164

    12. A Saturation Method for Collapsible Pushdown Systems

      • Chris Broadbent, Arnaud Carayol, Matthew Hague, Olivier Serre
      Pages 165-176

    13. Regular Languages Are Church-Rosser Congruential

      • Volker Diekert, Manfred Kufleitner, Klaus Reinhardt, Tobias Walter
      Pages 177-188
Back to top

Other volumes

  1. Automata, Languages, and Programming

  2. Automata, Languages, and Programming

Editors and Affiliations

  • Department of Computer Science and Centre for Discrete Mathematics and its Applications, University of Warwick, Warwick, UK

    Artur Czumaj

  • Max-Planck-Institut für Informatik, Saarbrücken, Germany

    Kurt Mehlhorn

  • Computer Laboratory,, University of Cambridge, UK

    Andrew Pitts

  • ETH Zurich, Switzerland

    Roger Wattenhofer

Bibliographic Information

Publish with us

Policies and ethics

Back to top