Skip to main content
Springer Nature Link
Log in

STACS 2002

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

  • Conference proceedings
  • © 2002

Overview

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)

Included in the following conference series:

Conference proceedings info: STACS 2002.

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

Access this book

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

eBook USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

Tax calculation will be finalised at checkout

Other ways to access

Licence this eBook for your library

Institutional subscriptions

Keywords

Table of contents (53 papers)

  1. Front Matter

    Pages I-XIV
    Download chapter PDF

  2. Invited Papers

    1. Hyper-Encryption and Everlasting Security

      • Yan Zong Ding, Michael O. Rabin
      Pages 1-26

    2. Models and Techniques for Communication in Dynamic Networks

      • Christian Scheideler
      Pages 27-49

    3. What Is a Theory?

      • Gilles Dowek
      Pages 50-64

  3. Algorithms

    1. A Space Lower Bound for Routing in Trees

      • Pierre Fraigniaud, Cyril Gavoille
      Pages 65-75

    2. Labeling Schemes for Dynamic Tree Networks

      • Amos Korman, David Peleg, Yoav Rodeh
      Pages 76-87

    3. Tight Bounds for the Performance of Longest-in-System on DAGs

      • Micah Adler, Adi Rosén
      Pages 88-99

    4. Approximate Strong Separation with Application in Fractional Graph Coloring and Preemptive Scheduling

      • Klaus Jansen
      Pages 100-111

    5. Balanced Coloring: Equally Easy for All Numbers of Colors?

      • Benjamin Doerr
      Pages 112-120

    6. The Complexity of Graph Isomorphism for Colored Graphs with Color Classes of Size 2 and 3

      • Johannes Köbler, Jacobo Torán
      Pages 121-132

    7. On the Complexity of Generating Maximal Frequent and Minimal Infrequent Sets

      • E. Boros, V. Gurvich, L. Khachiyan, K. Makino
      Pages 133-141

    8. On Dualization in Products of Forests

      • Khaled M. Elbassioni
      Pages 142-153

    9. An Asymptotic \( \mathcal{O} \) (ln ρ/ ln ln ρ)-Approximation Algorithm for the Scheduling Problem with Duplication on Large Communication Delay Graphs

      • R. Lepere, C. Rapine
      Pages 154-165

    10. Scheduling at Twilight the EasyWay

      • Hannah Bast
      Pages 166-178

    11. Complexity of Multi-dimensional Loop Alignment

      • Alain Darte, Guillaume Huard
      Pages 179-191

    12. A Probabilistic 3—SAT Algorithm Further Improved

      • Thomas Hofmeister, Uwe Schöning, Rainer Schuler, Osamu Watanabe
      Pages 192-202

    13. The Secret of Selective Game Tree Search, When Using Random-Error Evaluations

      • U. Lorenz, B. Monien
      Pages 203-214

    14. Randomized Acceleration of Fundamental Matrix Computations

      • Victor Y. Pan
      Pages 215-226

    15. Approximations for ATSP with Parametrized Triangle Inequality

      • L. Sunil Chandran, L. Shankar Ram
      Pages 227-237

    16. A New Diagram from Disks in the Plane

      • Joachim Giesen, Matthias John
      Pages 238-249
Back to top

Other volumes

  1. STACS 2002

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

Bibliographic Information

Publish with us

Policies and ethics

Back to top