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. Contributions

    1. On the Complexity of Resolution with Bounded Conjunctions

      • Juan Luis Esteban, Nicola Galesi, Jochen Messner
      Pages 220-231
    2. Exponential Lower Bound for Static Semi-algebraic Proofs

      • Dima Grigoriev, Edward A. Hirsch, Dmitrii V. Pasechnik
      Pages 257-268
    3. Paths Problems in Symmetric Logarithmic Space

      • Andreas Jakoby, Maciej Liskiewicz
      Pages 269-280
    4. Scheduling Search Procedures

      • Peter Damaschke
      Pages 281-292
    5. Removable Online Knapsack Problems

      • Kazuo Iwama, Shiro Taketomi
      Pages 293-305
    6. New Bounds for Variable-Sized and Resource Augmented Online Bin Packing

      • Leah Epstein, Steve Seiden, Rob van Stee
      Pages 306-317
    7. The Quest for Small Universal Cellular Automata

      • Nicolas Ollinger
      Pages 318-329
    8. Hyperbolic Recognition by Graph Automata

      • Christophe Papazian, Eric Rémila
      Pages 330-342
    9. Quantum and Stochastic Branching Programs of Bounded Width

      • Farid Ablayev, Cristopher Moore, Christopher Pollett
      Pages 343-354
    10. Spanning Trees with Bounded Number of Branch Vertices

      • Luisa Gargano, Pavol Hell, Ladislav Stacho, Ugo Vaccaro
      Pages 355-365
    11. Energy Optimal Routing in Radio Networks Using Geometric Data Structures

      • René Beier, Peter Sanders, Naveen Sivadasan
      Pages 366-376
    12. Gossiping with Bounded Size Messages in ad hoc Radio Networks

      • Malin Christersson, Leszek Gąsieniec, Andrzej Lingas
      Pages 377-389
    13. Cache Oblivious Distribution Sweeping

      • Gerth Stølting Brodal, Rolf Fagerberg
      Pages 426-438
    14. One-Probe Search

      • Anna Östlin, Rasmus Pagh
      Pages 439-450

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