Skip to main content
SpringerLink
Log in
Book cover
  • Conference proceedings
  • © 2004

STACS 2004

21st Annual Symposium on Theoretical Aspects of Computer Science, Montpellier, France, March 25-27, 2004, Proceedings

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. Michel Habib

    1. LIAFA and the University of Paris 7, Denis Diderot,  

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

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

Conference proceedings info: STACS 2004.

Sections

Buy it now

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. Algorithms

    1. Strongly Stable Matchings in Time O(nm) and Extension to the Hospitals-Residents Problem

      • Telikepalli Kavitha, Kurt Mehlhorn, Dimitrios Michail, Katarzyna Paluch
      Pages 222-233

    2. Approximation Algorithms for Minimizing Average Distortion

      • Kedar Dhamdhere, Anupam Gupta, R. Ravi
      Pages 234-245

  2. Networks (I)

    1. Digraphs Exploration with Little Memory

      • Pierre Fraigniaud, David Ilcinkas
      Pages 246-257

    3. An Algorithmic View on OVSF Code Assignment

      • Thomas Erlebach, Riko Jacob, Matúš Mihaľák, Marc Nunkesser, Gábor Szabó, Peter Widmayer
      Pages 270-281

  3. Automata Theory and Words

    1. The Syntactic Graph of a Sofic Shift

      • Marie-Pierre Béal, Francesca Fiorenzi, Dominique Perrin
      Pages 282-293

    2. Periodicity and Unbordered Words

      • Tero Harju, Dirk Nowotka
      Pages 294-304

  6. Cryptography

    1. Lattices with Many Cycles Are Dense

      • Mårten Trolin
      Pages 370-381

    2. Automata-Based Analysis of Recursive Cryptographic Protocols

      • Ralf Küsters, Thomas Wilke
      Pages 382-393

  7. Networks (II)

    1. On Minimum Circular Arrangement

      • Murali K Ganapathy, Sachin P Lodha
      Pages 394-405

    2. Integral Symmetric 2-Commodity Flows

      • Aubin Jarry
      Pages 406-417

    3. Efficient Algorithms for Low-Energy Bounded-Hop Broadcast in Ad-Hoc Wireless Networks

      • Christoph Ambühl, Andrea E. F. Clementi, Miriam Di Ianni, Nissan Lev-Tov, Angelo Monti, David Peleg et al.
      Pages 418-427

  8. Logic and Formal Languages

    1. On the Expressiveness of Deterministic Transducers over Infinite Trees

      • Thomas Colcombet, Christof Löding
      Pages 428-439

    2. Definability and Regularity in Automatic Structures

      • Bakhadyr Khoussainov, Sasha Rubin, Frank Stephan
      Pages 440-451
Back to top

Other Volumes

  1. STACS 2004

Back to top

Keywords

Back to top

Editors and Affiliations

  • Universität Stuttgart, FMI, Germany

    Volker Diekert

  • LIAFA and the University of Paris 7, Denis Diderot,  

    Michel Habib

Back to top

Bibliographic Information

Back to top

Publish with us

Policies and ethics

Back to top
Access via your institution

Buy it now

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

Search

Navigation