Skip to main content
SpringerLink
Log in

Automata, Languages and Programming

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

  • Conference proceedings
  • © 2002

Overview

Editors:
  1. Peter Widmayer

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

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  2. Stephan Eidenbenz

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

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  3. Francisco Triguero

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

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  4. Rafael Morales

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

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  5. Ricardo Conejo

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

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  6. Matthew Hennessy

    1. School of Cognitive and Computing Sciences, University of Sussex, Falmer, UK

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

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

Included in the following conference series:

Conference proceedings info: ICALP 2002.

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

Access this book

Log in via an institution
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

Licence this eBook for your library

Institutional subscriptions

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. Cryptographic Hardness Based on the Decoding of Reed-Solomon Codes

      • Aggelos Kiayias, Moti Yung
      Pages 232-243

    3. Perfect Constant-Round Secure Computation via Perfect Randomizing Polynomials

      • Yuval Ishai, Eyal Kushilevitz
      Pages 244-256

    4. Exponential Lower Bound for Static Semi-algebraic Proofs

      • Dima Grigoriev, Edward A. Hirsch, Dmitrii V. Pasechnik
      Pages 257-268

    5. Paths Problems in Symmetric Logarithmic Space

      • Andreas Jakoby, Maciej Liskiewicz
      Pages 269-280

    6. Scheduling Search Procedures

      • Peter Damaschke
      Pages 281-292

    7. Removable Online Knapsack Problems

      • Kazuo Iwama, Shiro Taketomi
      Pages 293-305

    8. New Bounds for Variable-Sized and Resource Augmented Online Bin Packing

      • Leah Epstein, Steve Seiden, Rob van Stee
      Pages 306-317

    9. The Quest for Small Universal Cellular Automata

      • Nicolas Ollinger
      Pages 318-329

    10. Hyperbolic Recognition by Graph Automata

      • Christophe Papazian, Eric Rémila
      Pages 330-342

    11. Quantum and Stochastic Branching Programs of Bounded Width

      • Farid Ablayev, Cristopher Moore, Christopher Pollett
      Pages 343-354

    12. Spanning Trees with Bounded Number of Branch Vertices

      • Luisa Gargano, Pavol Hell, Ladislav Stacho, Ugo Vaccaro
      Pages 355-365

    13. Energy Optimal Routing in Radio Networks Using Geometric Data Structures

      • René Beier, Peter Sanders, Naveen Sivadasan
      Pages 366-376

    14. Gossiping with Bounded Size Messages in ad hoc Radio Networks

      • Malin Christersson, Leszek Gąsieniec, Andrzej Lingas
      Pages 377-389

    15. The Kolmogorov-Loveland Stochastic Sequences Are Not Closed under Selecting Subsequences

      • Wolfgang Merkle
      Pages 390-400

    16. The Nondeterministic Constraint Logic Model of Computation: Reductions and Applications

      • Robert A. Hearn, Erik D. Demaine
      Pages 401-413

    17. Constraint Satisfaction Problems in Non-deterministic Logarithmic Space

      • Víctor Dalmau
      Pages 414-425

    18. Cache Oblivious Distribution Sweeping

      • Gerth Stølting Brodal, Rolf Fagerberg
      Pages 426-438

    19. One-Probe Search

      • Anna Östlin, Rasmus Pagh
      Pages 439-450

    20. New Algorithms for Subset Query, Partial Match, Orthogonal Range Searching, and Related Problems

      • Moses Charikar, Piotr Indyk, Rina Panigrahy
      Pages 451-462
Back to top

Other volumes

  1. Automata, Languages and Programming

Keywords

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

Publish with us

Policies and ethics

Back to top

Search

Navigation