Skip to main content
SpringerLink
Log in
Book cover

STACS 2007

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

  • Conference proceedings
  • © 2007

Overview

Editors:
  1. Wolfgang Thomas
    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  2. Pascal Weil
    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 4393)

Part of the book sub series: Theoretical Computer Science and General Issues (LNTCS)

Included in the following conference series:

Conference proceedings info: STACS 2007.

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

Access this book

Log in via an institution
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

Licence this eBook for your library

Institutional subscriptions

Table of contents (59 papers)

  1. Front Matter

    Download chapter PDF

  2. Invited Talks

    1. A Calculus and Algebra for Distributed Data Management

      • Serge Abiteboul
      Pages 1-11

    2. The Büchi Complementation Saga

      • Moshe Y. Vardi
      Pages 12-22

    3. Speed-Up Techniques for Shortest-Path Computations

      • Dorothea Wagner, Thomas Willhalm
      Pages 23-36

  3. Session 1A

    1. Compact Forbidden-Set Routing

      • Bruno Courcelle, Andrew Twigg
      Pages 37-48

    2. A New Bound for Pure Greedy Hot Potato Routing

      • Manfred Kunde
      Pages 49-60

    3. Wavelength Management in WDM Rings to Maximize the Number of Connections

      • Ioannis Caragiannis
      Pages 61-72

  4. Session 1B

    1. A First Investigation of Sturmian Trees

      • Jean Berstel, Luc Boasson, Olivier Carton, Isabelle Fagnot
      Pages 73-84

    2. On the Size of the Universal Automaton of a Regular Language

      • Sylvain Lombardy
      Pages 85-96

    3. Correlations of Partial Words

      • Francine Blanchet-Sadri, Joshua D. Gafni, Kevin H. Wilson
      Pages 97-108

  5. Session 2A

    1. Testing Convexity Properties of Tree Colorings

      • Eldar Fischer, Orly Yahalom
      Pages 109-120

    2. Why Almost All k-Colorable Graphs Are Easy

      • Amin Coja-Oghlan, Michael Krivelevich, Dan Vilenchik
      Pages 121-132

  7. Session 3A

    1. Hard Metrics from Cayley Graphs of Abelian Groups

      • Ilan Newman, Yuri Rabinovich
      Pages 157-162

    2. Broadcasting vs. Mixing and Information Dissemination on Cayley Graphs

      • Robert Elsässer, Thomas Sauerwald
      Pages 163-174

    3. Light Orthogonal Networks with Constant Geometric Dilation

      • Adrian Dumitrescu, Csaba D. Tóth
      Pages 175-187

  8. Session 3B

    1. Admissibility in Infinite Games

      • Dietmar Berwanger
      Pages 188-199

    2. Pure Stationary Optimal Strategies in Markov Decision Processes

      • Hugo Gimbert
      Pages 200-211

    3. Symmetries and the Complexity of Pure Nash Equilibrium

      • Felix Brandt, Felix Fischer, Markus Holzer
      Pages 212-223
Back to top

Other volumes

  1. STACS 2007

Keywords

Bibliographic Information

Publish with us

Policies and ethics

Back to top

Search

Navigation