Skip to main content
  • Conference proceedings
  • © 2006

STACS 2006

23rd Annual Symposium on Theoretical Aspects of Computer Science, Marseille, France, February 23-25, 2006, Proceedings

Part of the book series: Lecture Notes in Computer Science (LNCS, volume 3884)

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

Conference series link(s): STACS: Annual Symposium on Theoretical Aspects of Computer Science

Conference proceedings info: STACS 2006.

Buy it now

Buying options

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

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

Table of contents (57 papers)

  1. Conflict-Free Colorings of Rectangles Ranges

    • Khaled Elbassioni, Nabil H. Mustafa
    Pages 254-263
  2. Grid Vertex-Unfolding Orthogonal Polyhedra

    • Mirela Damian, Robin Flatland, Joseph O’Rourke
    Pages 264-276
  3. Weighted Picture Automata and Weighted Logics

    • Ina Mäurer
    Pages 313-324
  4. Markov Decision Processes with Multiple Objectives

    • Krishnendu Chatterjee, Rupak Majumdar, Thomas A. Henzinger
    Pages 325-336
  5. Convergence and Approximation in Potential Games

    • George Christodoulou, Vahab S. Mirrokni, Anastasios Sidiropoulos
    Pages 349-360
  6. Fast FPT-Algorithms for Cleaning Grids

    • Josep Díaz, Dimitrios M. Thilikos
    Pages 361-371
  7. Tradeoffs in Depth-Two Superconcentrators

    • Chinmoy Dutta, Jaikumar Radhakrishnan
    Pages 372-383
  8. On Hypergraph and Graph Isomorphism with Bounded Color Classes

    • V. Arvind, Johannes Köbler
    Pages 384-395
  9. Forbidden Substrings, Kolmogorov Complexity and Almost Periodic Sequences

    • A. Yu. Rumyantsev, M. A. Ushakov
    Pages 396-407
  10. Regularity Problems for Visibly Pushdown Languages

    • Vince Bárány, Christof Löding, Olivier Serre
    Pages 420-431
  11. Redundancy in Complete Sets

    • Christian Glaßer, A. Pavan, Alan L. Selman, Liyu Zhang
    Pages 444-454
  12. Sparse Selfreducible Sets and Polynomial Size Circuit Lower Bounds

    • Harry Buhrman, Leen Torenvliet, Falk Unger
    Pages 455-468
  13. Linear Advice for Randomized Logarithmic Space

    • Lance Fortnow, Adam R. Klivans
    Pages 469-476
  14. Nested Pebbles and Transitive Closure

    • Joost Engelfriet, Hendrik Jan Hoogeboom
    Pages 477-488

Other Volumes

  1. STACS 2006

Editors and Affiliations

  • LIF, CNRS & Univ. de Provence,, Marseille, France

    Bruno Durand

  • RWTH Aachen University,, Aachen,, Germany

    Wolfgang Thomas

Bibliographic Information

Buy it now

Buying options

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