Skip to main content
  • Conference proceedings
  • © 1995

STACS 95

12th Annual Symposium on Theoretical Aspects of Computer Science, Munich, Germany, March 2-4, 1995. Proceedings

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

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

Conference proceedings info: STACS 1995.

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

  1. On the synthesis of discrete controllers for timed systems

    • Oded Maler, Amir Pnueli, Joseph Sifakis
    Pages 229-242
  2. A fully abstract semantics for causality in the π-calculus

    • Michele Boreale, Davide Sangiorgi
    Pages 243-254
  3. On the sizes of permutation networks and consequences for efficient simulation of hypercube algorithms on bounded-degree networks

    • J. Hromkovič, K. Loryś, P. Kanarek, R. Klasing, W. Unger, H. Wagener
    Pages 255-266
  4. Exploiting storage redundancy to speed up randomized shared memory simulations

    • Friedhelm Meyer, Christian Scheideier, Volker Stemann
    Pages 267-278
  5. Interval routing schemes

    • Michele Flammini, Giorgio Gambosi, Sandro Salomone
    Pages 279-290
  6. A packet routing protocol for arbitrary networks

    • Friedhelm Meyer, Berthold Vöcking
    Pages 291-302
  7. A family of tag systems for paperfolding sequences

    • Christiane Bercoff
    Pages 303-312
  8. Growing context-sensitive languages and Church-Rosser languages

    • Gerhard Buntrock, Friedrich Otto
    Pages 313-324
  9. Deterministic generalized automata

    • Dora Giammarresi, Rosa Montalbano
    Pages 325-336
  10. Optimal lower bounds on the multiparty communication complexity

    • Pavol Ďuriš, José D. P. Rolim
    Pages 350-360
  11. Simultaneous messages vs. communication

    • László Babai, Peter G. Kimmel, Satyanarayana V. Lokam
    Pages 361-372
  12. Coding and strong coding in trace monoids

    • Véronique Bruyère, Clelia De Eelice
    Pages 373-384
  13. On codings of traces

    • Volker Diekert, Anca Muscholl, Klaus Reinhardt
    Pages 385-396
  14. Finding largest common embeddable subtrees

    • Arvind Gupta, Naomi Nishimura
    Pages 397-408
  15. The χt-coloring problem

    • Damon Kaller, Arvind Gupta, Tom Shermer
    Pages 409-420
  16. Expander properties in random regular graphs with edge faults

    • Sotiris E. Nikoletseas, Paul G. Spirakis
    Pages 421-432
  17. Dynamic analysis of the sizes of relations

    • Danièle Gardy, Guy Louchard
    Pages 433-444
  18. On slender context-free languages

    • Danny Raz
    Pages 445-454

Other Volumes

  1. STACS 95

About this book

This book presents the proceedings of the 12th Annual Symposium on Theoretical Aspects of Computer Science (STACS 95), held in Munich, Germany in March 1995.
Besides three invited talks, the book contains revised versions of 53 research papers selected from a total of 180 submissions. The contributions address all current aspects of theoretical computer science; they are organized in sections on complexity theory, automata theory, algorithms, logic, theory of parallel computing, communication theory, graph theory and databases, and computational geometry.

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