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

Mathematical Foundations of Computer Science 1986

12th Symposium held at Bratislava, Czechoslovakia, August 25-29, 1986. Proceedings

Editors:

  1. Jozef Gruska
    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  2. Branislav Rovan
    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  3. Juraj Wiedermann
    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 233)

Sections

Buy it now

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

  1. Front Matter

    PDF

  2. Why sometimes probabilistic algorithms can be more effective

    • Farid M. Ablaev, RÅ«siņš Freivalds
    Pages 1-14

  3. Recent results in the theory of rational sets

    • Jean Berstel, Jacques Sakarovitch
    Pages 15-28

  5. Kins of context-free languages

    • Michal P. Chytil
    Pages 44-58

  6. Algebraic theory of module specifications with constraints

    • H. Ehrig, W. Fey, F. Parisi-Presicce, E. K. Blum
    Pages 59-77

  8. Parallel arithmetic computations: A survey

    • Joachim von zur Gathen
    Pages 93-112

  9. An approach to proof checker

    • Ken Hirose
    Pages 113-127

  10. The promise of electronic prototyping

    • John Hopcroft
    Pages 128-139

  13. Developing implicit data structures

    • J. Ian Munro
    Pages 168-176

  15. Deterministic simulation of idealized parallel computers on more realistic ones

    • H. Alt, T. Hagerup, K. Mehlhorn, F. P. Preparata
    Pages 199-208

  16. Relational specifications and observational semantics

    • Egidio Astesiano, Gianna Reggio, Martin Wirsing
    Pages 209-217

  17. Efficient testing of optimal time adders

    • Bernd Becker
    Pages 218-229

  18. Properties of complexity measures for PRAMs and WARMs

    • Siegfried Bublitz, Ute Schürfeld, Bernd Voigt, Ingo Wegener
    Pages 230-238

  19. Iterative systems of equations

    • Virgil Emil CÄ‚zÄ‚nescu
    Pages 239-246
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 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

Search

Navigation