Skip to main content
SpringerLink
Log in
Book cover
  • Conference proceedings
  • © 2001

Automata, Languages and Programming

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

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)

Sections

Buy it now

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

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

Table of contents (86 papers)

  1. Front Matter

    Pages I-XIV
    PDF

  2. Keynote Papers

    1. Algorithms, Games, and the Internet

      • Christos H. Papadimitriou
      Pages 1-3

  4. Algebraic and Circuit Complexity

    2. On Generating All Minimal Integer Solutions for a Monotone System of Linear Inequalities

      • E. Boros, K. Elbassioni, V. Gurvich, L. Khachiyan, K. Makino
      Pages 92-103

    3. Division Is In Uniform TC0

      • William Hesse
      Pages 104-114

  5. Algorithm Analysis

    1. A Framework for Index Bulk Loading and Dynamization

      • Pankaj K. Agarwal, Lars Arge, Octavian Procopiuc, Jeffrey Scott Vitter
      Pages 115-127

    3. The Complexity of Constructing Evolutionary Trees Using Experiments

      • Gerth Stølting Brodal, Rolf Fagerberg, Christian N.S. Pedersen, Anna Östlin
      Pages 140-151

    4. Hidden Pattern Statistics

      • Philippe Flajolet, Yves Guivarc’h, Wojciech Szpankowski, Brigitte Vallée
      Pages 152-165

    5. Combinatorics and Algorithms on Low-Discrepancy Roundings of a Real Sequence

      • Kunihiko Sadakane, Nadia Takki-Chebihi, Takeshi Tokuyama
      Pages 166-177

  6. Approximation and Optimization

    1. Approximating the Minimum Spanning Tree Weight in Sublinear Time

      • Bernard Chazelle, Ronitt Rubinfeld, Luca Trevisan
      Pages 190-200

    2. Approximation Hardness of TSP with Bounded Metrics

      • Lars Engebretsen, Marek Karpinski
      Pages 201-212

    3. The RPR 2 Rounding Technique for Semidefinite Programs

      • Uriel Feige, Michael Langberg
      Pages 213-224

    4. Approximation Algorithms for Partial Covering Problems

      • Rajiv Gandhi, Samir Khuller, Aravind Srinivasan
      Pages 225-236
Back to top

Keywords

Back to top

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

Back to top

Bibliographic Information

Back to top

Publish with us

Policies and ethics

Back to top
Access via your institution

Buy it now

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

Search

Navigation