Skip to main content
SpringerLink
Log in
Book cover

STACS 94

11th Annual Symposium on Theoretical Aspects of Computer Science Caen, France, February 24–26, 1994 Proceedings

  • Conference proceedings
  • © 1994

Overview

Editors:
  1. Patrice Enjalbert
    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  2. Ernst W. Mayr
    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  3. Klaus W. Wagner
    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 775)

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

  1. Front Matter

    Download chapter PDF

  2. The nature and meaning of perturbations in geometric computing

    • Raimund Seidel
    Pages 1-17

  3. One binary horn clause is enough

    • Philippe Devienne, Patrick Lebègue, Jean-Christophe Routier, Jörg Würtz
    Pages 19-32

  4. Transforming constraint logic programs

    • N. Bensaou, I. Guessarian
    Pages 33-46

  5. A hierarchy of temporal logics with past

    • F. Laroussinie, Ph. Schnoebelen
    Pages 47-58

  6. The complexity of resource-bounded first-order classical logic

    • Jean Goubault
    Pages 59-70

  7. Two proof procedures for a cardinality based language in propositional calculus

    • Belaid Benhamou, Lakhdar Sais, Pierre Siegel
    Pages 71-82

  8. The alternation hierarchy for machines with sublogarithmic space is infinite

    • Burchard von Braunmühl, Romain Gengler, Robert Rettinger
    Pages 83-96

  9. Quasilinear time complexity theory

    • Ashish V. Naik, Kenneth W. Regan, D. Sivakumar
    Pages 97-108

  10. Space-efficient deterministic simulation of probabilistic automata

    • Ioan I. Macarie
    Pages 109-122

  11. Reachability and the power of local ordering

    • Kousha Etessami, Neil Immerman
    Pages 123-135

  12. Are parallel machines always faster than sequential machines?

    • Louis Mak
    Pages 137-148

  13. Ground reducibility and automata with disequality constraints

    • Hubert Comon, Florent Jacquemard
    Pages 149-162

  14. Perpetuality and strong normalization in orthogonal term rewriting systems

    • Zurab Khasidashvili
    Pages 163-174

  15. About changing the ordering during Knuth-Bendix completion

    • Andrea Sattler-Klein
    Pages 175-186

  16. Combination of matching algorithms

    • Christophe Ringeissen
    Pages 187-198

  17. Periodic constant depth sorting networks

    • Marcin Kik, Mirosław Kutyłowski, Grzegorz Stachowiak
    Pages 199-212

  18. Optimal pattern matching on meshes

    • Bogdan S. Chlebus, Leszek Gasieniec
    Pages 213-224

  19. Faster sorting and routing on grids with diagonals

    • Manfred Kunde, Rolf Niedermeier, Peter Rossmanith
    Pages 225-236

  20. Deterministic 1 -k routing on meshes with applications to worm-hole routing

    • Jop F. Sibeyn, Michael Kaufmann
    Pages 237-248
Back to top

Keywords

About this book

This volume constitutes the proceedings of the 11th annual Symposium on Theoretical Aspects of Computer Science (STACS '94), held in Caen, France, February 24-26, 1994. Besides three prominent invited papers, the proceedings contains 60 accepted contributions chosen by the international program committee during a highly competitive reviewing process from a total of 234 submissions for 38 countries. The volume competently represents most areas of theoretical computer science with a certain emphasis on (parallel) algorithms and complexity.

Bibliographic Information

Publish with us

Policies and ethics

Back to top

Search

Navigation