Skip to main content
SpringerLink
Log in

STACS 98

15th Annual Symposium on Theoretical Aspects of Computer Science, Paris, France, February 25-27, 1998, Proceedings

  • Conference proceedings
  • © 1998

Overview

Editors:
  1. Michel Morvan
    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  2. Christoph Meinel
    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  3. Daniel Krob
    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 1373)

Included in the following conference series:

Conference proceedings info: STACS 1998.

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

Access this book

Log in via an institution
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 (54 papers)

  1. Front Matter

    Download chapter PDF

  2. Random graphs, random walks, differential equations and the probabilistic analysis of algorithms

    • Richard M. Karp
    Pages 1-2

  3. Distributed online frequency assignment in cellular networks

    • Jeannette Janssen, Danny Krizanc, Lata Narayanan, Sunil Shende
    Pages 3-13

  4. Floats, integers, and single source shortest paths

    • Mikkel Thorup
    Pages 14-24

  5. A synthesis on partition refinement: A useful routine for strings, graphs, boolean matrices and automata

    • Michel Habib, Christophe Paul, Laurent Viennoti
    Pages 25-38

  6. Simplifying the modal mu-calculus alternation hierarchy

    • J. C. Bradfield
    Pages 39-49

  7. On disguised double horn functions and extensions

    • Thomas Eiter, Toshihide Ibaraki, Kazuhisa Makino
    Pages 50-60

  8. The complexity of propositional linear temporal logics in simple cases

    • S. Demri, Ph. Schnoebelen
    Pages 61-72

  9. Searching constant width mazes captures the AC 0 hierarchy

    • David A. Mix Barrington, Chi-Jen Lu, Peter Bro Miltersen, Sven Skyum
    Pages 73-83

  10. Nearly optimal language compression using extractors

    • Lance Fortnow, Sophie Laplante
    Pages 84-93

  11. Random sparse bit strings at the threshold of adjacency

    • Joel H. Spencer, Katherine St. John
    Pages 94-104

  12. Lower bounds for randomized read-k-times branching programs

    • Martin Sauerhoff
    Pages 105-115

  13. Inducing an order on cellular automata by a grouping operation

    • Jacques Mazoyer, Ivan Rapaport
    Pages 116-127

  14. Attractors of D-dimensional Linear Cellular Automata

    • Giovanni Manzini, Luciano Margara
    Pages 128-138

  15. Optimal simulations between unary automata

    • Carlo Mereghetti, Giovanni Pighizzini
    Pages 139-149

  16. Shuffle of ω-words: Algebraic aspects

    • Alexandru Mateescu
    Pages 150-160

  17. A generalization of resource-bounded measure, with an application (Extended abstract)

    • Harry Buhrman, Dieter van Melkebeek, Kenneth W. Regan, D. Sivakumar, Martin Strauss
    Pages 161-171

  18. The complexity of modular graph automorphism

    • V. Arvind, R. Beigel, A. Lozano
    Pages 172-182

  19. Unary quantifiers, transitive closure, and relations of large degree

    • Leonid Libkin, Limsoon Wong
    Pages 183-193

  20. On the structure of valiant's complexity classes

    • Peter Bürgisser
    Pages 194-204
Back to top

Other volumes

  1. STACS 98

Keywords

About this book

This book constitutes the strictly refereed proceedings of the 15th Annual Symposium on Theoretical Aspects of Computer Science, STACS 98, held in Paris, France, in February 1998.
The volume presents three invited surveys together with 52 revised full papers selected from a total of 155 submissions. The papers are organized in topical sections on algorithms and data structures, logic, complexity, and automata and formal languages.

Bibliographic Information

Publish with us

Policies and ethics

Back to top

Search

Navigation