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. Session 4-Track C. Fault Tolerance, Ranking

    1. Asynchronous Throughput-Optimal Routing in Malicious Networks

      • Paul Bunn, Rafail Ostrovsky
      Pages 236-248

    2. Improved Fault Tolerance and Secure Computation on Sparse Networks

      • Nishanth Chandran, Juan Garay, Rafail Ostrovsky
      Pages 249-260

    3. Sparse Reliable Graph Backbones

      • Shiri Chechik, Yuval Emek, Boaz Patt-Shamir, David Peleg
      Pages 261-272

    4. Approximation Algorithms for Diversified Search Ranking

      • Nikhil Bansal, Kamal Jain, Anna Kazeykina, Joseph (Seffi) Naor
      Pages 273-284

  2. Session 5-Track B. Graphs, Categories and Quantum Information

    1. Rewriting Measurement-Based Quantum Computations with Generalised Flow

      • Ross Duncan, Simon Perdrix
      Pages 285-296

    2. The Compositional Structure of Multipartite Quantum Entanglement

      • Bob Coecke, Aleks Kissinger
      Pages 297-308

    3. Compositionality in Graph Transformation

      • Arend Rensink
      Pages 309-320

  3. Session 6-Track B. Best Paper Award

    1. On p-Optimal Proof Systems and Logics for PTIME

      • Yijia Chen, Jörg Flum
      Pages 321-332

  4. Session 6-Track C. Best Paper Award

    1. Placing Regenerators in Optical Networks to Satisfy Multiple Sets of Requests

      • George B. Mertzios, Ignasi Sau, Mordechai Shalom, Shmuel Zaks
      Pages 333-344

  5. Session 7-Track B. Logic

    1. Maximal Decidable Fragments of Halpern and Shoham’s Modal Logic of Intervals

      • Angelo Montanari, Gabriele Puppis, Pietro Sala
      Pages 345-356

    2. B and D Are Enough to Make the Halpern–Shoham Logic Undecidable

      • Jerzy Marcinkowski, Jakub Michaliszyn, Emanuel KieroÅ„ski
      Pages 357-368

    3. Parameterized Modal Satisfiability

      • Antonis Achilleos, Michael Lampis, Valia Mitsou
      Pages 369-380

    4. Automata for Coalgebras: An Approach Using Predicate Liftings

      • Gaëlle Fontaine, Raul Leal, Yde Venema
      Pages 381-392

  6. Session 7-Track C. Privacy, Selfishness

    1. Resolving the Complexity of Some Data Privacy Problems

      • Jeremiah Blocki, Ryan Williams
      Pages 393-404

    2. Private and Continual Release of Statistics

      • T-H. Hubert Chan, Elaine Shi, Dawn Song
      Pages 405-417

    3. Envy-Free Pricing in Multi-item Markets

      • Ning Chen, Xiaotie Deng
      Pages 418-429

    4. Contention Resolution under Selfishness

      • George Christodoulou, Katrina Ligett, Evangelia Pyrga
      Pages 430-441

  7. Session 8-Track B. Concurrency

    1. On the Expressiveness of Polyadic and Synchronous Communication in Higher-Order Process Calculi

      • Ivan Lanese, Jorge A. Pérez, Davide Sangiorgi, Alan Schmitt
      Pages 442-453

    2. On Bisimilarity and Substitution in Presence of Replication

      • Daniel Hirschkoff, Damien Pous
      Pages 454-465

    3. The Downward-Closure of Petri Net Languages

      • Peter Habermehl, Roland Meyer, Harro Wimmel
      Pages 466-477
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