Skip to main content
  • Conference proceedings
  • © 1998

STACS 98

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

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

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

Conference proceedings info: STACS 1998.

Buy it now

Buying options

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

  1. Front Matter

  2. Distributed online frequency assignment in cellular networks

    • Jeannette Janssen, Danny Krizanc, Lata Narayanan, Sunil Shende
    Pages 3-13
  3. On disguised double horn functions and extensions

    • Thomas Eiter, Toshihide Ibaraki, Kazuhisa Makino
    Pages 50-60
  4. Searching constant width mazes captures the AC 0 hierarchy

    • David A. Mix Barrington, Chi-Jen Lu, Peter Bro Miltersen, Sven Skyum
    Pages 73-83
  5. Nearly optimal language compression using extractors

    • Lance Fortnow, Sophie Laplante
    Pages 84-93
  6. Random sparse bit strings at the threshold of adjacency

    • Joel H. Spencer, Katherine St. John
    Pages 94-104
  7. Inducing an order on cellular automata by a grouping operation

    • Jacques Mazoyer, Ivan Rapaport
    Pages 116-127
  8. Attractors of D-dimensional Linear Cellular Automata

    • Giovanni Manzini, Luciano Margara
    Pages 128-138
  9. Optimal simulations between unary automata

    • Carlo Mereghetti, Giovanni Pighizzini
    Pages 139-149
  10. Shuffle of ω-words: Algebraic aspects

    • Alexandru Mateescu
    Pages 150-160
  11. 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
  12. The complexity of modular graph automorphism

    • V. Arvind, R. Beigel, A. Lozano
    Pages 172-182
  13. On the structure of valiant's complexity classes

    • Peter Bürgisser
    Pages 194-204

Other Volumes

  1. STACS 98

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

Buy it now

Buying options

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