Skip to main content
Book cover

Automata, Languages and Programming

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

  • Conference proceedings
  • © 2008

Overview

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

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

Included in the following conference series:

Conference proceedings info: ICALP 2008.

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

Access this book

eBook USD 149.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book USD 199.00
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 (73 papers)

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

    1. Complexity: Boolean Functions and Circuits

    2. Data Structures

    3. Random Walks and Random Structures

    4. Design and Analysis of Algorithms

Other volumes

  1. Automata, Languages and Programming

  2. Automata, Languages and Programming

Keywords

About this book

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.

Editors and Affiliations

  • School of Computer Science, Reykjavik University, Reykjavík, Iceland

    Luca Aceto

  • Department of Computer Science, IT-Parken, University of Aarhus, ÅrhusN, Denmark

    Ivan Damgård

  • Department of Computer Science, University of Liverpool, Liverpool, UK

    Leslie Ann Goldberg

  • School of Computer Science, Reykjavik University, Reykjavik, Iceland

    Magnús M. Halldórsson

  • Department of Computer Science, Reykjavik University, Reykjavík, Iceland

    Anna Ingólfsdóttir

  • Université de Bordeaux-1, LaBRI, Talence cedex, France

    Igor Walukiewicz

Bibliographic Information

Publish with us