STACS 2007

24th Annual Symposium on Theoretical Aspects of Computer Science, Aachen, Germany, February 22-24, 2007. Proceedings

Editors:

ISBN: 978-3-540-70917-6 (Print) 978-3-540-70918-3 (Online)

Table of contents (59 chapters)

previous Page of 3
  1. Front Matter

    Pages -

  2. Invited Talks

    1. No Access

      Book Chapter

      Pages 1-11

      A Calculus and Algebra for Distributed Data Management

    2. No Access

      Book Chapter

      Pages 12-22

      The Büchi Complementation Saga

    3. No Access

      Book Chapter

      Pages 23-36

      Speed-Up Techniques for Shortest-Path Computations

  3. Session 1A

    1. No Access

      Book Chapter

      Pages 37-48

      Compact Forbidden-Set Routing

    2. No Access

      Book Chapter

      Pages 49-60

      A New Bound for Pure Greedy Hot Potato Routing

    3. No Access

      Book Chapter

      Pages 61-72

      Wavelength Management in WDM Rings to Maximize the Number of Connections

  4. Session 1B

    1. No Access

      Book Chapter

      Pages 73-84

      A First Investigation of Sturmian Trees

    2. No Access

      Book Chapter

      Pages 85-96

      On the Size of the Universal Automaton of a Regular Language

    3. No Access

      Book Chapter

      Pages 97-108

      Correlations of Partial Words

  5. Session 2A

    1. No Access

      Book Chapter

      Pages 109-120

      Testing Convexity Properties of Tree Colorings

    2. No Access

      Book Chapter

      Pages 121-132

      Why Almost All k-Colorable Graphs Are Easy

  6. Session 2B

    1. No Access

      Book Chapter

      Pages 133-144

      On Defining Integers in the Counting Hierarchy and Proving Arithmetic Circuit Lower Bounds

    2. No Access

      Book Chapter

      Pages 145-156

      A New Rank Technique for Formula Size Lower Bounds

  7. Session 3A

    1. No Access

      Book Chapter

      Pages 157-162

      Hard Metrics from Cayley Graphs of Abelian Groups

    2. No Access

      Book Chapter

      Pages 163-174

      Broadcasting vs. Mixing and Information Dissemination on Cayley Graphs

    3. No Access

      Book Chapter

      Pages 175-187

      Light Orthogonal Networks with Constant Geometric Dilation

  8. Session 3B

    1. No Access

      Book Chapter

      Pages 188-199

      Admissibility in Infinite Games

    2. No Access

      Book Chapter

      Pages 200-211

      Pure Stationary Optimal Strategies in Markov Decision Processes

    3. No Access

      Book Chapter

      Pages 212-223

      Symmetries and the Complexity of Pure Nash Equilibrium

  9. Session 4A

    1. No Access

      Book Chapter

      Pages 224-235

      Computing Representations of Matroids of Bounded Branch-Width

previous Page of 3