Skip to main content
SpringerLink
Log in
Book cover

STACS 2005

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

  • Conference proceedings
  • © 2005

Overview

Editors:
  1. Volker Diekert

    1. Universität Stuttgart, FMI, Germany

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  2. Bruno Durand

    1. LIF, CNRS & Univ. de Provence,, Marseille

    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 3404)

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

Included in the following conference series:

Conference proceedings info: STACS 2005.

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 (57 papers)

  1. Front Matter

    Download chapter PDF

  4. Session 1B

    1. Counting in the Two Variable Guarded Logic with Transitivity

      • Lidia Tendera
      Pages 83-96

    2. The Variable Hierarchy of the μ-Calculus Is Strict

      • Dietmar Berwanger, Giacomo Lenzi
      Pages 97-109

    3. The Core of a Countably Categorical Structure

      • Manuel Bodirsky
      Pages 110-120

  6. Session 2B

    1. On the Decidability of Temporal Properties of Probabilistic Pushdown Automata

      • Tomáš Brázdil, Antonín Kučera, Oldřich Stražovský
      Pages 145-157

    2. Deciding Properties of Contract-Signing Protocols

      • Detlef Kähler, Ralf Küsters, Thomas Wilke
      Pages 158-169

  7. Session 3A

    1. Polylog-Time Reductions Decrease Dot-Depth

      • Christian Glaßer
      Pages 170-181

    2. On the Computational Complexity of the Forcing Chromatic Number

      • Frank Harary, Wolfgang Slany, Oleg Verbitsky
      Pages 182-193

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

      • Lars Engebretsen, Jonas Holmerin
      Pages 194-205

  8. Session 3B

    1. Three Optimal Algorithms for Balls of Three Colors

      • Zdeněk Dvořák, Vít Jelínek, Daniel Král’, Jan Kynčl, Michael Saks
      Pages 206-217

    2. Cost Sharing and Strategyproof Mechanisms for Set Cover Games

      • Xiang-Yang Li, Zheng Sun, Weizhao Wang
      Pages 218-230

    3. On Weighted Balls-into-Bins Games

      • Petra Berenbrink, Tom Friedetzky, Zengjian Hu, Russell Martin
      Pages 231-243
Back to top

Other volumes

  1. STACS 2005

Keywords

Editors and Affiliations

  • Universität Stuttgart, FMI, Germany

    Volker Diekert

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

    Bruno Durand

Bibliographic Information

Publish with us

Policies and ethics

Back to top

Search

Navigation