Skip to main content
  • Conference proceedings
  • © 2003

Automata, Languages and Programming

30th International Colloquium, ICALP 2003, Eindhoven, The Netherlands, June 30 - July 4, 2003. Proceedings

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

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

Conference proceedings info: ICALP 2003.

Buy it now

Buying options

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

  1. Front Matter

    Pages I-XVIII
  2. Algorithms

    1. Generalized Framework for Selectors with Applications in Optimal Group Testing

      • Annalisa De Bonis, Leszek Gąsieniec, Ugo Vaccaro
      Pages 81-96
    2. Decoding of Interleaved Reed Solomon Codes over Noisy Data

      • Daniel Bleichenbacher, Aggelos Kiayias, Moti Yung
      Pages 97-108
  3. Process Algebra

    1. On the Axiomatizability of Ready Traces, Ready Simulation, and Failure Traces

      • Stefan Blom, Wan Fokkink, Sumit Nain
      Pages 109-118
    2. Resource Access and Mobility Control with Dynamic Privileges Acquisition

      • Daniele Gorla, Rosario Pugliese
      Pages 119-132
    3. Replication vs. Recursive Definitions in Channel Based Calculi

      • Nadia Busi, Maurizio Gabbrielli, Gianluigi Zavattaro
      Pages 133-144
  4. Approximation Algorithms

    1. An Improved Approximation Algorithm for Vertex Cover with Hard Capacities

      • Rajiv Gandhi, Eran Halperin, Samir Khuller, Guy Kortsarz, Aravind Srinivasan
      Pages 164-175
    2. Approximating Steiner k-Cuts

      • Chandra Chekuri, Sudipto Guha, Joseph Seffi Naor
      Pages 189-199
    3. MAX k-CUT and Approximating the Chromatic Number of Random Graphs

      • Amin Coja-Oghlan, Cristopher Moore, Vishal Sanwalani
      Pages 200-211
    4. Approximation Algorithm for Directed Telephone Multicast Problem

      • Michael Elkin, Guy Kortsarz
      Pages 212-223

Other Volumes

  1. Automata, Languages and Programming

Editors and Affiliations

  • Dept. of Mathematics and Computer Science, Technische Universiteit Eindhoven, Eindhoven, The Netherlands

    Jos C. M. Baeten

  • School of Industrial and Systems Engineering, Georgia Institute of Technology, Atlanta, USA

    Jan Karel Lenstra

  • Department of Information Technology, Uppsala University, Uppsala, Sweden

    Joachim Parrow

  • Faculty of Electrical Engineering, Mathematics and Computer Science, University of Twente, Enschede, The Netherlands

    Gerhard J. Woeginger

Bibliographic Information

Buy it now

Buying options

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