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

Automata, Languages and Programming

33rd International Colloquium, ICALP 2006, Venice, Italy, July 10-14, 2006, Proceedings, Part I

Editors:

  1. Michele Bugliesi

    1. Dipartimento di Informatica, Università Ca’ Foscari, Venice

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  2. Bart Preneel

    1. Interdisciplinary Institute for BroadBand Technology (IBBT), Belgium

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  3. Vladimiro Sassone

    1. ECS, University of Southampton, UK

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  4. Ingo Wegener

    1. FB Informatik, Univ. Dortmund, Dortmund, Germany

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

Part of the book sub series: Theoretical Computer Science and General Issues (LNTCS)

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

Conference proceedings info: ICALP 2006.

Sections

Buy it now

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

  1. Approximation Algorithms II

    1. A Robust APTAS for the Classical Bin Packing Problem

      • Leah Epstein, Asaf Levin
      Pages 214-225

  2. Graph Algorithms I

    1. A Faster Deterministic Algorithm for Minimum Cycle Bases in Directed Graphs

      • Ramesh Hariharan, Telikepalli Kavitha, Kurt Mehlhorn
      Pages 250-261

    2. Finding the Smallest H-Subgraph in Real Weighted Graphs and Related Problems

      • Virginia Vassilevska, Ryan Williams, Raphael Yuster
      Pages 262-273

  3. Algorithms I

    1. Optimal Resilient Sorting and Searching in the Presence of Memory Faults

      • Irene Finocchi, Fabrizio Grandoni, Giuseppe F. Italiano
      Pages 286-298

    2. Reliable and Efficient Computational Geometry Via Controlled Perturbation

      • Kurt Mehlhorn, Ralf Osbild, Michael Sagraloff
      Pages 299-310

    3. Tight Bounds for Selfish and Greedy Load Balancing

      • Ioannis Caragiannis, Michele Flammini, Christos Kaklamanis, Panagiotis Kanellopoulos, Luca Moscardelli
      Pages 311-322

  4. Complexity I

    2. Extracting Kolmogorov Complexity with Applications to Dimension Zero-One Laws

      • Lance Fortnow, John M. Hitchcock, A. Pavan, N. V. Vinodchandran, Fengming Wang
      Pages 335-345

    3. The Connectivity of Boolean Satisfiability: Computational and Structural Dichotomies

      • Parikshit Gopalan, Phokion G. Kolaitis, Elitza N. Maneva, Christos H. Papadimitriou
      Pages 346-357

  5. Data Structures and Linear Algebra

    1. Suffix Trays and Suffix Trists: Structures for Faster Text Indexing

      • Richard Cole, Tsvi Kopelowitz, Moshe Lewenstein
      Pages 358-369

    2. Optimal Lower Bounds for Rank and Select Indexes

      • Alexander Golynski
      Pages 370-381

    3. Dynamic Interpolation Search Revisited

      • Alexis Kaporis, Christos Makris, Spyros Sioutas, Athanasios Tsakalidis, Kostas Tsichlas, Christos Zaroliagis
      Pages 382-394

    4. Dynamic Matrix Rank

      • Gudmund Skovbjerg Frandsen, Peter Frands Frandsen
      Pages 395-406

  6. Graphs

    1. Nearly Optimal Visibility Representations of Plane Graphs

      • Xin He, Huaming Zhang
      Pages 407-418

    2. Planar Crossing Numbers of Genus g Graphs

      • Hristo Djidjev, Imrich Vrt’o
      Pages 419-430
Back to top

Other Volumes

  1. Automata, Languages and Programming

  2. Automata, Languages and Programming

Back to top

Keywords

Back to top

Editors and Affiliations

  • Dipartimento di Informatica, Università Ca’ Foscari, Venice

    Michele Bugliesi

  • Interdisciplinary Institute for BroadBand Technology (IBBT), Belgium

    Bart Preneel

  • ECS, University of Southampton, UK

    Vladimiro Sassone

  • FB Informatik, Univ. Dortmund, Dortmund, Germany

    Ingo Wegener

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

Search

Navigation