Skip to main content
SpringerLink
Log in
Book cover

Automata, Languages and Programming

28th International Colloquium, ICALP 2001 Crete, Greece, July 8–12, 2001 Proceedings

  • Conference proceedings
  • © 2001

Overview

Editors:
  1. Fernando Orejas

    1. Departament de Llenguatges i Sistemes Informátics, Univ. Politècnica de Catalunya, Spain

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  2. Paul G. Spirakis

    1. Computer Technology Institute (CTI), University of Patras, Patras, Greece

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  3. Jan Leeuwen

    1. Institute of Information and Computing Sciences, Utrecht University, Utrecht, The Netherlands

    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 2076)

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 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book USD 54.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 (86 papers)

  1. Approximation and Optimization

    1. On the Online Bin Packing Problem

      • Steven S. Seiden
      Pages 237-248

    2. Quick k-Median, k-Center, and Facility Location for Sparse Graphs

      • Mikkel Thorup
      Pages 249-260

  2. Complexity

    1. Parameterized Complexity: Exponential Speed-Up for Planar Graph Problems

      • Jochen Alber, Henning Fernau, Rolf Niedermeier
      Pages 261-272

    2. Subexponential Parameterized Algorithms Collapse the W-Hierarchy

      • Liming Cai, David Juedes
      Pages 273-284

    3. Improved Lower Bounds on the Randomized Complexity of Graph Properties

      • Amit Chakrabarti, Subhash Khot
      Pages 285-296

    4. New Imperfect Random Source with Applications to Coin-Flipping

      • Yevgeniy Dodis
      Pages 297-309

    5. Recognizing More Unsatisfiable Random 3-SAT Instances Efficiently

      • Joel Friedman, Andreas Goerdt
      Pages 310-321

    6. Weisfeiler-Lehman Refinement Requires at Least a Linear Number of Iterations

      • Martin Fürer
      Pages 322-333

    7. On Interactive Proofs with a Laconic Prover

      • Oded Goldreich, Salil Vadhan, Avi Wigderson
      Pages 334-345

    8. Quantum Complexities of Ordered Searching, Sorting, and Element Distinctness

      • Peter Høyer, Jan Neerbek, Yaoyun Shi
      Pages 346-357

    9. Lower Bounds in the Quantum Cell Probe Model

      • Pranab Sen, S. Venkatesh
      Pages 358-369

  3. Concurrency

    1. Axiomatizations for Probabilistic Bisimulation

      • Emanuele Bandini, Roberto Segala
      Pages 370-381

    2. Noninterference for Concurrent Programs

      • Gérard Boudol, Ilaria Castellani
      Pages 382-395

    3. Distributed Controller Synthesis for Local Specifications

      • P. Madhusudan, P.S. Thiagarajan
      Pages 396-407

    4. A Distributed Abstract Machine for Safe Ambients

      • Davide Sangiorgi, Andrea Valente
      Pages 408-420

    5. Towards Quantitative Verification of Probabilistic Transition Systems

      • Franck van Breugel, James Worrell
      Pages 421-432

  4. Efficient Datastructures

    1. Efficient Generation of Plane Triangulations without Repetitions

      • Zhangjian Li, Shin-ichi Nakano
      Pages 433-443

    2. The Longest Common Subsequence Problem for Sequences with Nested Arc Annotations

      • Guo-Hui Lin, Zhi-Zhong Chen, Tao Jiang, Jianjun Wen
      Pages 444-455

    3. Visibility-Based Pursuit-Evasion in a Polygonal Region by a Searcher

      • Sang-Min Park, Jae-Ha Lee, Kyung-Yong Chwa
      Pages 456-468

    4. A New Method for Balancing Binary Search Trees

      • Salvador Roura
      Pages 469-480
Back to top

Keywords

Editors and Affiliations

  • Departament de Llenguatges i Sistemes Informátics, Univ. Politècnica de Catalunya, Spain

    Fernando Orejas

  • Computer Technology Institute (CTI), University of Patras, Patras, Greece

    Paul G. Spirakis

  • Institute of Information and Computing Sciences, Utrecht University, Utrecht, The Netherlands

    Jan Leeuwen

Bibliographic Information

Publish with us

Policies and ethics

Back to top

Search

Navigation