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

STACS 94

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

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)

Sections

Buy it now

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

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

Table of contents (63 papers)

  1. Front Matter

    PDF

  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

  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

  11. Reachability and the power of local ordering

    • Kousha Etessami, Neil Immerman
    Pages 123-135

  13. Ground reducibility and automata with disequality constraints

    • Hubert Comon, Florent Jacquemard
    Pages 149-162

  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
Back to top

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.
Back to top

Keywords

Back to top

Bibliographic Information

Back to top

Publish with us

Policies and ethics

Back to top
Access via your institution

Buy it now

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

Search

Navigation