Skip to main content
  • Conference proceedings
  • © 2006

Automata, Languages and Programming

33rd International Colloquium, ICALP 2006, Venice, Italy, July 10-14, 2006, Proceedings, Part I

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

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

Conference series link(s): ICALP: International Colloquium on Automata, Languages, and Programming

Conference proceedings info: ICALP 2006.

Buy it now

Buying options

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

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

Table of contents (62 papers)

  1. Front Matter

  2. Invited Lectures

    1. Additive Approximation for Edge-Deletion Problems (Abstract)

      • Noga Alon, Asaf Shapira, Benny Sudakov
      Pages 1-2
  3. Graph Theory I

    1. Testing Graph Isomorphism in Parallel by Playing a Game

      • Martin Grohe, Oleg Verbitsky
      Pages 3-14
    2. The Spectral Gap of Random Graphs with Given Expected Degrees

      • Amin Coja-Oghlan, André Lanka
      Pages 15-26
    3. Embedding Bounded Bandwidth Graphs into ℓ1

      • Douglas E. Carroll, Ashish Goel, Adam Meyerson
      Pages 27-37
    4. On Counting Homomorphisms to Directed Acyclic Graphs

      • Martin Dyer, Leslie Ann Goldberg, Mike Paterson
      Pages 38-49
  4. Quantum Computing

    1. Self-testing of Quantum Circuits

      • Frédéric Magniez, Dominic Mayers, Michele Mosca, Harold Ollivier
      Pages 72-83
    2. Deterministic Extractors for Independent-Symbol Sources

      • Chia-Jung Lee, Chi-Jen Lu, Shi-Chun Tsai
      Pages 84-95
  5. Randomness

    1. Gap Amplification in PCPs Using Lazy Random Walks

      • Jaikumar Radhakrishnan
      Pages 96-107
    2. Stopping Times, Metrics and Approximate Counting

      • Magnus Bordewich, Martin Dyer, Marek Karpinski
      Pages 108-119
  6. Formal Languages

    1. P-completeness of Cellular Automaton Rule 110

      • Turlough Neary, Damien Woods
      Pages 132-143
    2. Small Sweeping 2NFAs Are Not Closed Under Complement

      • Christos A. Kapoutsis
      Pages 144-156
    3. Expressive Power of Pebble Automata

      • Mikołaj Bojańczyk, Mathias Samuelides, Thomas Schwentick, Luc Segoufin
      Pages 157-168
  7. Approximation Algorithms I

    1. A Push-Relabel Algorithm for Approximating Degree Bounded MSTs

      • Kamalika Chaudhuri, Satish Rao, Samantha Riesenfeld, Kunal Talwar
      Pages 191-201
    2. Edge Disjoint Paths in Moderately Connected Graphs

      • Satish Rao, Shuheng Zhou
      Pages 202-213

Other Volumes

  1. Automata, Languages and Programming

Editors and Affiliations

  • Dipartimento di Informatica, Università Ca’ Foscari, Venice

    Michele Bugliesi

  • Interdisciplinary Institute for BroadBand Technology (IBBT), Belgium

    Bart Preneel

  • ECS, University of Southampton, UK

    Vladimiro Sassone

  • FB Informatik, Univ. Dortmund, Dortmund, Germany

    Ingo Wegener

Bibliographic Information

Buy it now

Buying options

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