STACS 2005

22nd Annual Symposium on Theoretical Aspects of Computer Science, Stuttgart, Germany, February 24-26, 2005. Proceedings

Editors:

ISBN: 978-3-540-24998-6 (Print) 978-3-540-31856-9 (Online)

Table of contents (57 chapters)

previous Page of 3
  1. Front Matter

    Pages -

  2. Invited Talks

    1. No Access

      Book Chapter

      Pages 1-17

      Automorphisms of Finite Rings and Applications to Complexity of Problems

    2. No Access

      Book Chapter

      Pages 18-35

      Algebraic Generating Functions in Enumerative Combinatorics and Context-Free Languages

    3. No Access

      Book Chapter

      Pages 36-43

      Algorithmics in Exponential Time

  3. Session 1A

    1. No Access

      Book Chapter

      Pages 44-56

      Worst-Case and Average-Case Approximations by Simple Randomized Search Heuristics

    2. No Access

      Book Chapter

      Pages 57-68

      Sampling Sub-problems of Heterogeneous Max-cut Problems and Approximation Algorithms

    3. No Access

      Book Chapter

      Pages 69-82

      Truthful Approximation Mechanisms for Scheduling Selfish Related Machines

  4. Session 1B

    1. No Access

      Book Chapter

      Pages 83-96

      Counting in the Two Variable Guarded Logic with Transitivity

    2. No Access

      Book Chapter

      Pages 97-109

      The Variable Hierarchy of the μ-Calculus Is Strict

    3. No Access

      Book Chapter

      Pages 110-120

      The Core of a Countably Categorical Structure

  5. Session 2A

    1. No Access

      Book Chapter

      Pages 121-132

      How Common Can Be Universality for Cellular Automata?

    2. No Access

      Book Chapter

      Pages 133-144

      Cellular Automata: Real-Time Equivalence Between One-Dimensional Neighborhoods

  6. Session 2B

    1. No Access

      Book Chapter

      Pages 145-157

      On the Decidability of Temporal Properties of Probabilistic Pushdown Automata

    2. No Access

      Book Chapter

      Pages 158-169

      Deciding Properties of Contract-Signing Protocols

  7. Session 3A

    1. No Access

      Book Chapter

      Pages 170-181

      Polylog-Time Reductions Decrease Dot-Depth

    2. No Access

      Book Chapter

      Pages 182-193

      On the Computational Complexity of the Forcing Chromatic Number

    3. No Access

      Book Chapter

      Pages 194-205

      More Efficient Queries in PCPs for NP and Improved Approximation Hardness of Maximum CSP

  8. Session 3B

    1. No Access

      Book Chapter

      Pages 206-217

      Three Optimal Algorithms for Balls of Three Colors

    2. No Access

      Book Chapter

      Pages 218-230

      Cost Sharing and Strategyproof Mechanisms for Set Cover Games

    3. No Access

      Book Chapter

      Pages 231-243

      On Weighted Balls-into-Bins Games

  9. Session 4A

    1. No Access

      Book Chapter

      Pages 244-255

      Computing Minimal Multi-homogeneous Bézout Numbers Is Hard

previous Page of 3