Skip to main content
  • Conference proceedings
  • © 2003

STACS 2003

20th Annual Symposium on Theoretical Aspects of Computer Science, Berlin, Germany, February 27 - March 1, 2003. Proceedings

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

Conference series link(s): STACS: Annual Symposium on Theoretical Aspects of Computer Science

Conference proceedings info: STACS 2003.

Buy it now

Buying options

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

  1. Front Matter

    Pages I-XVII
  2. Invited Papers

  3. Contributed Papers

    1. Approximating Geometric Bottleneck Shortest Paths

      • Prosenjit Bose, 1Anil Maheshwari, Giri Narasimhan, Michiel Smid, Norbert Zeh
      Pages 38-49
    2. Optimization in Arrangements

      • Stefan Langerman, William Steiger
      Pages 50-61
    3. The Commutation with Codes and Ternary Sets of Words

      • Juhani Karhumäki, Michel Latteux, Ion Petre
      Pages 74-84
    4. On the Confluence of Linear Shallow Term Rewrite Systems

      • Guillem Godoy, Ashish Tiwari, Rakesh Verma
      Pages 85-96
    5. Faster Deterministic Broadcasting in Ad Hoc Radio Networks

      • Dariusz R. Kowalski, Andrzej Pelc
      Pages 109-120
    6. Private Computations in Networks: Topology versus Randomness

      • Andreas Jakoby, Maciej Liśkiewicz, Rüdiger Reischuk
      Pages 121-132
    7. On the Effective Jordan Decomposability

      • Xizhong Zheng, Robert Rettinger, Burchard von Braunmühl
      Pages 167-178
    8. Fast Algorithms for Extended Regular Expression Matching and Searching

      • Lucian Ilie, Baozhen Shan, Sheng Yu
      Pages 179-190
    9. Algorithms for Transposition Invariant String Matching (Extended Abstract)

      • Veli Mäkinen, Gonzalo Navarro, Esko Ukkonen
      Pages 191-202

Other Volumes

  1. STACS 2003

Editors and Affiliations

  • Institut für Informatik, Freie Universität Berlin, Berlin, Germany

    Helmut Alt

  • LIRMM, Montpellier Cedex 5, France

    Michel Habib

Bibliographic Information

Buy it now

Buying options

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