Automata, Languages and Programming

35th International Colloquium, ICALP 2008, Reykjavik, Iceland, July 7-11, 2008, Proceedings, Part I

  • Luca Aceto
  • Ivan Damgård
  • Leslie Ann Goldberg
  • Magnús M. Halldórsson
  • Anna Ingólfsdóttir
  • Igor Walukiewicz
Conference proceedings ICALP 2008

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

Table of contents

  1. Front Matter
  2. Invited Lectures

  3. Track A: Algorithms, Automata, Complexity, and Games

    1. Complexity: Boolean Functions and Circuits

      1. David Buchfuhrer, Christopher Umans
        Pages 24-35
      2. Dana Dachman-Soled, Homin K. Lee, Tal Malkin, Rocco A. Servedio, Andrew Wan, Hoeteck Wee
        Pages 36-47
      3. Endre Boros, Khaled Elbassioni, Kazuhisa Makino
        Pages 48-59
    2. Data Structures

      1. Susanne Albers, Sonja Lauer
        Pages 96-107
      2. Guy E. Blelloch, Virginia Vassilevska, Ryan Williams
        Pages 108-120
    3. Random Walks and Random Structures

      1. Augustin Chaintreau, Pierre Fraigniaud, Emmanuelle Lebhar
        Pages 133-144
      2. Prasad Chebolu, Alan Frieze, Páll Melsted
        Pages 161-172
    4. Design and Analysis of Algorithms

      1. Ferdinando Cicalese, Eduardo Sany Laber
        Pages 173-185
      2. Yossi Azar, Benjamin Birnbaum, Anna R. Karlin, Claire Mathieu, C. Thach Nguyen
        Pages 186-197
      3. Andreas Björklund, Thore Husfeldt, Petteri Kaski, Mikko Koivisto
        Pages 198-209
      4. Fedor V. Fomin, Yngve Villanger
        Pages 210-221
    5. Scheduling

    6. Codes and Coding

      1. Noga Alon, Rani Hod
        Pages 258-270
      2. Kazuo Iwama, Harumichi Nishimura, Mike Paterson, Rudy Raymond, Shigeru Yamashita
        Pages 271-282
      3. Qi Cheng, Daqing Wan
        Pages 283-293
    7. Coloring

      1. Sriram Pemmaraju, Aravind Srinivasan
        Pages 306-319
      2. Flavio Chierichetti, Andrea Vattani
        Pages 320-332
      3. Ken-ichi Kawarabayashi
        Pages 333-344
    8. Randomness in Computation

      1. Markus Bläser, Moritz Hardt, David Steurer
        Pages 345-356
      2. Alexandr Andoni, Robert Krauthgamer
        Pages 357-369
      3. Ming-Yang Kao, Robert Schweller
        Pages 370-384
    9. Online and Dynamic Algorithms

      1. Nedialko B. Dimitrov, C. Greg Plaxton
        Pages 397-408
      2. Nikhil Bansal, Ho-Leung Chan, Tak-Wah Lam, Lap-Kei Lee
        Pages 409-420
      3. Bernhard Haeupler, Telikepalli Kavitha, Rogers Mathew, Siddhartha Sen, Robert E. Tarjan
        Pages 421-433
      4. Gudmund Skovbjerg Frandsen, Piotr Sankowski
        Pages 434-446
    10. Approximation Algorithms

      1. Jeff M. Phillips
        Pages 447-458
      2. Eduardo Laber, Marco Molinaro
        Pages 459-471
      3. Chandra Chekuri, Sanjeev Khanna
        Pages 472-484
      4. Glencora Borradaile, Philip Klein
        Pages 485-501
    11. Property Testing

      1. Ilias Diakonikolas, Homin K. Lee, Kevin Matulef, Rocco A. Servedio, Andrew Wan
        Pages 502-514
      2. Satyen Kale, C. Seshadhri
        Pages 527-538
      3. Yuichi Yoshida, Hiro Ito
        Pages 539-550
    12. Parameterized Algorithms and Complexity

      1. Igor Razgon, Barry O’Sullivan
        Pages 551-562
      2. Hans L. Bodlaender, Rodney G. Downey, Michael R. Fellows, Danny Hermelin
        Pages 563-574
      3. Yijia Chen, Marc Thurley, Mark Weyer
        Pages 587-596
    13. Graph Algorithms

      1. Feodor F. Dragan, Fedor V. Fomin, Petr A. Golovach
        Pages 597-608

Other volumes

  1. Automata, Languages and Programming
    35th International Colloquium, ICALP 2008, Reykjavik, Iceland, July 7-11, 2008, Proceedings, Part I
  2. 35th International Colloquium, ICALP 2008, Reykjavik, Iceland, July 7-11, 2008, Proceedings, Part II

About these proceedings


The two-volume set LNCS 5125 and LNCS 5126 constitutes the refereed proceedings of the 35th International Colloquium on Automata, Languages and Programming, ICALP 2008, held in Reykjavik, Iceland, in July 2008.

The 126 revised full papers presented together with 4 invited lectures were carefully reviewed and selected from a total of 407 submissions. The papers are grouped in three major tracks on algorithms, automata, complexity and games, on logic, semantics, and theory of programming, and on security and cryptography foundations. LNCS 5125 contains 70 contributions of track A selected from 269 submissions as well as 2 invited lectures. The papers are organized in topical sections on complexity: boolean functions and circuits, data structures, random walks and random structures, design and analysis of algorithms, scheduling, codes and coding, coloring, randomness in computation, online and dynamic algorithms, approximation algorithms, property testing, parameterized algorithms and complexity, graph algorithms, computational complexity, games and automata, group testing, streaming, and quantum, algorithmic game theory, and quantum computing.


algorithmic game theory algorithms complexity data structures design logic programming scheduling testing

Editors and affiliations

  • Luca Aceto
    • 1
  • Ivan Damgård
    • 2
  • Leslie Ann Goldberg
    • 3
  • Magnús M. Halldórsson
    • 4
  • Anna Ingólfsdóttir
    • 5
  • Igor Walukiewicz
    • 6
  1. 1.School of Computer ScienceReykjavik UniversityReykjavíkIceland
  2. 2.Department of Computer Science, IT-ParkenUniversity of AarhusÅrhusNDenmark
  3. 3.Department of Computer ScienceUniversity of LiverpoolLiverpoolUK
  4. 4.School of Computer ScienceReykjavik UniversityReykjavikIceland
  5. 5.Department of Computer ScienceReykjavik UniversityReykjavíkIceland
  6. 6.Université de Bordeaux-1, LaBRITalence cedexFrance

Bibliographic information

  • DOI
  • Copyright Information Springer-Verlag Berlin Heidelberg 2008
  • Publisher Name Springer, Berlin, Heidelberg
  • eBook Packages Computer Science Computer Science (R0)
  • Print ISBN 978-3-540-70574-1
  • Online ISBN 978-3-540-70575-8
  • Series Print ISSN 0302-9743
  • Series Online ISSN 1611-3349
  • Buy this book on publisher's site