Skip to main content
SpringerLink
Log in
Book cover

Automata, Languages and Programming

37th International Colloquium, ICALP 2010, Bordeaux, France, July 6-10, 2010, Proceedings, Part II

  • Conference proceedings
  • © 2010

Overview

Editors:
  1. Samson Abramsky

    1. Computing Laboratory, Oxford University, Oxford, UK

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  2. Cyril Gavoille

    1. Université de Bordeaux (LaBRI) & INRIA, Talence Cedex, France,

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  3. Claude Kirchner

    1. INRIA, Centre de Recherche Bordeaux – Sud-Ouest, Talence Cedex, France

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  4. Friedhelm Meyer auf der Heide

    1. Heinz Nixdorf Institute, University of Paderborn, Paderborn, Germany

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  5. Paul G. Spirakis

    1. University of Patras and RACTI, Patras, Greece

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

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

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

Included in the following conference series:

Conference proceedings info: ICALP 2010.

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 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Other ways to access

Licence this eBook for your library

Institutional subscriptions

Table of contents (50 papers)

  1. Front Matter

    Download chapter PDF

  2. Invited Talks

    1. Informative Labeling Schemes

      • Pierre Fraigniaud
      Pages 1-1

    2. Noetherian Spaces in Verification

      • Jean Goubault-Larrecq
      Pages 2-21

    3. Towards a Theory of Time-Bounded Verification

      • Joël Ouaknine, James Worrell
      Pages 22-37

    4. Physical Algorithms

      • Roger Wattenhofer
      Pages 38-51

  3. Session 1-Track B. Automata

    1. Optimal Zielonka-Type Construction of Deterministic Asynchronous Automata

      • Blaise Genest, Hugo Gimbert, Anca Muscholl, Igor Walukiewicz
      Pages 52-63

    2. Pumping and Counting on the Regular Post Embedding Problem

      • Pierre Chambart, Philippe Schnoebelen
      Pages 64-75

    3. Alternation Removal in Büchi Automata

      • Udi Boker, Orna Kupferman, Adin Rosenberg
      Pages 76-87

    4. Linear Orders in the Pushdown Hierarchy

      • Laurent Braud, Arnaud Carayol
      Pages 88-99

  4. Session 1-Track C. Communication in Networks

    1. The Serializability of Network Codes

      • Anna Blasiak, Robert Kleinberg
      Pages 100-114

    2. How Efficient Can Gossip Be? (On the Cost of Resilient Information Exchange)

      • Dan Alistarh, Seth Gilbert, Rachid Guerraoui, Morteza Zadimoghaddam
      Pages 115-126

    3. Efficient Information Exchange in the Random Phone-Call Model

      • Petra Berenbrink, Jurek Czyzowicz, Robert Elsässer, Leszek GÄ…sieniec
      Pages 127-138

    4. An O(logn)-Competitive Online Centralized Randomized Packet-Routing Algorithm for Lines

      • Guy Even, Moti Medina
      Pages 139-150

  5. Session 2-Track B. Formal Languages

    1. A Topological Approach to Recognition

      • Mai Gehrke, Serge Grigorieff, Jean-Éric Pin
      Pages 151-162

    2. On LR(k)-Parsers of Polynomial Size

      • Norbert Blum
      Pages 163-174

    3. On Erasing Productions in Random Context Grammars

      • Georg Zetzsche
      Pages 175-186

  6. Session 4-Track B. Semantics

    1. Game Semantics for Call-by-Value Polymorphism

      • James Laird
      Pages 187-198

    2. What Is a Pure Functional?

      • Martin Hofmann, Aleksandr Karbyshev, Helmut Seidl
      Pages 199-210

    3. Example-Guided Abstraction Simplification

      • Roberto Giacobazzi, Francesco Ranzato
      Pages 211-222

    4. Compositional Closure for Bayes Risk in Probabilistic Noninterference

      • Annabelle McIver, Larissa Meinicke, Carroll Morgan
      Pages 223-235
Back to top

Other volumes

  1. Automata, Languages and Programming

  2. Automata, Languages and Programming

Keywords

Editors and Affiliations

  • Computing Laboratory, Oxford University, Oxford, UK

    Samson Abramsky

  • Université de Bordeaux (LaBRI) & INRIA, Talence Cedex, France,

    Cyril Gavoille

  • INRIA, Centre de Recherche Bordeaux – Sud-Ouest, Talence Cedex, France

    Claude Kirchner

  • Heinz Nixdorf Institute, University of Paderborn, Paderborn, Germany

    Friedhelm Meyer auf der Heide

  • University of Patras and RACTI, Patras, Greece

    Paul G. Spirakis

Bibliographic Information

Publish with us

Policies and ethics

Back to top

Search

Navigation