STACS 2004

21st Annual Symposium on Theoretical Aspects of Computer Science, Montpellier, France, March 25-27, 2004. Proceedings

Editors:

ISBN: 978-3-540-21236-2 (Print) 978-3-540-24749-4 (Online)

Table of contents (57 chapters)

previous Page of 3
  1. Front Matter

    Pages -

  2. Invited Lectures

    1. No Access

      Book Chapter

      Pages 1-3

      Approximation Schemes for Metric Clustering Problems

    2. No Access

      Book Chapter

      Pages 4-18

      Positional Determinacy of Infinite Games

  3. Structural Complexity (I)

    1. No Access

      Book Chapter

      Pages 19-30

      Individual Communication Complexity

    2. No Access

      Book Chapter

      Pages 31-43

      The Complexity of Satisfiability Problems over Finite Lattices

    3. No Access

      Book Chapter

      Pages 44-55

      Constant Width Planar Computation Characterizes ACC0

  4. Graph Algorithms (I)

    1. No Access

      Book Chapter

      Pages 56-67

      A Simple and Fast Approach for Solving Problems on Planar Graphs

    2. No Access

      Book Chapter

      Pages 68-80

      Sum-Multicoloring on Paths

    3. No Access

      Book Chapter

      Pages 81-92

      Matching Algorithms Are Fast in Sparse Random Graphs

  5. Quantum Computations

    1. No Access

      Book Chapter

      Pages 93-104

      Algebraic Results on Quantum Automata

    2. No Access

      Book Chapter

      Pages 105-116

      Quantum Identification of Boolean Oracles

  6. Pattern Inference and Statistics

    1. No Access

      Book Chapter

      Pages 117-128

      Local Limit Distributions in Pattern Statistics: Beyond the Markovian Models

    2. No Access

      Book Chapter

      Pages 129-140

      A Discontinuity in Pattern Inference

  7. Satisfiability – Constraint Satisfaction Problem

    1. No Access

      Book Chapter

      Pages 141-151

      Algorithms for SAT Based on Search in Hamming Balls

    2. No Access

      Book Chapter

      Pages 152-163

      Identifying Efficiently Solvable Cases of Max CSP

    3. No Access

      Book Chapter

      Pages 164-175

      The Complexity of Boolean Constraint Isomorphism

  8. Scheduling (I)

    1. No Access

      Book Chapter

      Pages 176-186

      On Minimizing the Total Weighted Tardiness on a Single Machine

    2. No Access

      Book Chapter

      Pages 187-198

      Online Competitive Algorithms for Maximizing Weighted Throughput of Unit Jobs

    3. No Access

      Book Chapter

      Pages 199-210

      Optimal and Online Preemptive Scheduling on Uniformly Related Machines

  9. Algorithms

    1. No Access

      Book Chapter

      Pages 211-221

      Parallel Prefetching and Caching Is Hard

    2. No Access

      Book Chapter

      Pages 222-233

      Strongly Stable Matchings in Time O(nm) and Extension to the Hospitals-Residents Problem

previous Page of 3