Skip to main content
SpringerLink
Log in
Book cover

Mathematical Foundations of Computer Science 1981

10th Symposium Strbske Pleso, Czechoslovakia, August 31- September 4, 1981. Proceedings

  • Conference proceedings
  • © 1981

Overview

Editors:
  1. Jozef Gruska
    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  2. Michal Chytil
    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 118)

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

  1. Front Matter

    Download chapter PDF

  2. The complexity of manipulating hierarchically defined sets of rectangles

    • Jon Louis Bentley, Thomas Ottmann
    Pages 1-15

  3. The transformational machine: Theme and variations

    • Andrei P. Ershov
    Pages 16-32

  4. Probabilistic two-way machines

    • RÅ«siņš Freivalds
    Pages 33-45

  5. A survey of some recent results on computational complexity in weak theories of arithmetic

    • Deborah Joseph, Paul Young
    Pages 46-60

  6. A survey on oracle techniques

    • B. Korte, R. Schrader
    Pages 61-77

  7. Time and space bounded complexity classes and bandwidth constrained problems

    • Burkhard Monien, Ivan Hal Sudborough
    Pages 78-93

  8. Representations of graphs by means of products and their complexity

    • Jaroslav NeÅ¡etÅ™il
    Pages 94-102

  9. Parsing strategies: A concise survey

    • Anton Nijholt
    Pages 103-120

  10. The art of dynamizing

    • Jan van Leeuwen, Mark H. Overmars
    Pages 121-131

  11. Fast parallel computation of polynomials using few processors

    • L. G. Valiant, S. Skyum
    Pages 132-139

  12. Generalizations of Petri nets

    • Rüdiger Valk
    Pages 140-155

  13. Partial match retrieval in implicit data structures

    • Helmut Alt, Kurt Mehlhorn, J. Ian Munro
    Pages 156-161

  14. A characterization of Floyd-provable programs

    • H. Andréka, I. Németi, I. Sain
    Pages 162-171

  15. Semantics of CSP via translation into CCS

    • Egidio Astesiano, Elena Zucca
    Pages 172-182

  16. More about the "geography" of context-free languages

    • J. Beauquier, J. Berstel
    Pages 183-192

  17. On the power of algebraic specifications

    • J. A. Bergstra, M. Broy, J. V. Tucker, M. Wirsing
    Pages 193-204

  18. An application of the theory of free partially commutative monoids: Asymptotic densities of trace languages

    • A. Bertoni, M. Brambilla, G. Mauri, N. Sabadini
    Pages 205-215

  19. On the complexity of word problems in certain Thue systems

    • R. Book, M. Jantzen, B. Monien, C. Ó'Dúnlaing, C. Wrathall
    Pages 216-223

  20. On the transformation of derivation graphs to derivation trees

    • Franz-Josef Brandenburg
    Pages 224-233
Back to top

Keywords

Bibliographic Information

  • Book Title: Mathematical Foundations of Computer Science 1981

  • Book Subtitle: 10th Symposium Strbske Pleso, Czechoslovakia, August 31- September 4, 1981. Proceedings

  • Editors: Jozef Gruska, Michal Chytil

  • Series Title: Lecture Notes in Computer Science

  • DOI: https://doi.org/10.1007/3-540-10856-4

  • Publisher: Springer Berlin, Heidelberg

  • eBook Packages: Springer Book Archive

  • Copyright Information: Springer-Verlag Berlin Heidelberg 1981

  • Softcover ISBN: 978-3-540-10856-6Published: 01 August 1981

  • eBook ISBN: 978-3-540-38769-5Published: 01 July 2005

  • Series ISSN: 0302-9743

  • Series E-ISSN: 1611-3349

  • Edition Number: 1

  • Number of Pages: XI, 590

  • Topics: Theory of Computation, Algorithm Analysis and Problem Complexity

Publish with us

Policies and ethics

Back to top

Search

Navigation