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

STACS 2002

19th Annual Symposium on Theoretical Aspects of Computer Science, Antibes - Juan les Pins, France, March 14-16, 2002, Proceedings

Editors:

  1. Helmut Alt

    1. Institute for Computer Science, Free University of Berlin, Berlin, Germany

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  2. Afonso Ferreira

    1. CNRS - I3S - INRIA Sophia Antipolis, Sophia Antipolis, France

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

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

Conference proceedings info: STACS 2002.

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

  1. Algorithms

    1. Computing the Maximum Detour and Spanning Ratio of Planar Paths, Trees, and Cycles

      • Stefan Langerman, Pat Morin, Michael Soss
      Pages 250-261

  2. Current Challenges

    1. On the Parameterized Intractability of Closest Substring and Related Problems

      • Michael R. Fellows, Jens Gramm, Rolf Niedermeier
      Pages 262-273

    2. On the Complexity of Protein Similarity Search under mRNA Structure Constraints

      • Rolf Backofen, N.S. Narayanaswamy, Firas Swidan
      Pages 274-286

    3. Pure Dominance Constraints

      • Manuel Bodirsky, Martin Kutz
      Pages 287-298

    5. On Quantum Computation with Some Restricted Amplitudes

      • Harumichi Nishimura
      Pages 311-322

    7. On Quantum and Approximate Privacy

      • Hartmut Klauck
      Pages 335-346

    8. On Quantum Versions of the Yao Principle

      • Mart de Graaf, Ronald de Wolf
      Pages 347-358

  3. Computational and Structural Complexity

    1. Describing Parameterized Complexity Classes

      • Jörg Flum, Martin Grohe
      Pages 359-371

    4. Games with a Uniqueness Property

      • Shin Aida, Marcel Crasmaru, Kenneth Regan, Osamu Watanabe
      Pages 396-407

    5. Bi-Immunity Separates Strong NP-Completeness Notions

      • A. Pavan, Alan L. Selman
      Pages 408-418

    6. Complexity of Semi-algebraic Proofs

      • Dima Grigoriev, Edward A. Hirsch, Dmitrii V. Pasechnik
      Pages 419-430

    8. The Complexity of Constraints on Intervals and Lengths

      • Andrei Krokhin, Peter Jeavons, Peter Jonsson
      Pages 443-454

  4. Automata and Formal Languages

    1. Nesting Until and Since in Linear Temporal Logic

      • Denis Thérien, Thomas Wilke
      Pages 455-464

    3. On the Average Parallelism in Trace Monoids

      • Daniel Krob, Jean Mairesse, Ioannis Michos
      Pages 477-488
Back to top

Other Volumes

  1. STACS 2002

Back to top

Keywords

Back to top

Editors and Affiliations

  • Institute for Computer Science, Free University of Berlin, Berlin, Germany

    Helmut Alt

  • CNRS - I3S - INRIA Sophia Antipolis, Sophia Antipolis, France

    Afonso Ferreira

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