Skip to main content
  • Conference proceedings
  • © 2002

Automata, Languages and Programming

29th International Colloquium, ICALP 2002, Malaga, Spain, July 8-13, 2002. Proceedings

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

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

Conference proceedings info: ICALP 2002.

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 (90 papers)

  1. Front Matter

    Pages I-XXI
  2. Invited Talks

    1. Equivariant Syntax and Semantics

      • Andrew M. Pitts
      Pages 32-36
    2. Discrete Tomography: Reconstruction under Periodicity Constraints

      • Alberto Del Lungo, Andrea Frosini, Maurice Nivat, Laurent Vuillon
      Pages 38-56
    3. Program Debugging and Validation Using Semantic Approximations and Partial Specifications

      • M. Hermenegildo, G. Puebla, F. Bueno, P. López-García
      Pages 69-72
  3. Contributions

    1. Heuristically Optimized Trade-Offs: A New Paradigm for Power Laws in the Internet

      • Alex Fabrikant, Elias Koutsoupias, Christos H. Papadimitriou
      Pages 110-122
    2. The Structure and Complexity of Nash Equilibria for a Selfish Routing Game

      • Dimitris Fotakis, Spyros Kontogiannis, Elias Koutsoupias, Marios Mavronicolas, Paul Spirakis
      Pages 123-134
    3. Control Message Aggregation in Group Communication Protocols

      • Sanjeev Khanna, Joseph Seffi Naor, Dan Raz
      Pages 135-146
    4. Church-Rosser Languages vs. UCFL

      • Tomasz Jurdziński, Krzysztof Loryś
      Pages 147-158
    5. Exponential Structures for Efficient Cache-Oblivious Algorithms

      • Michael A. Bender, Richard Cole, Rajeev Raman
      Pages 195-207

Other Volumes

  1. Automata, Languages and Programming

Editors and Affiliations

  • Institute of Theoretical Computer Science, ETH Zentrum, ETH Zürich, Zürich, Switzerland

    Peter Widmayer, Stephan Eidenbenz

  • Department of Languages and Sciences of the Computation E.T.S. de Ingeniería Informática, University of Málaga, Málaga, Spain

    Francisco Triguero, Rafael Morales, Ricardo Conejo

  • School of Cognitive and Computing Sciences, University of Sussex, Falmer, UK

    Matthew Hennessy

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