Skip to main content
SpringerLink
Log in
Book cover

Mathematical Foundations of Computer Science 1986

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

  • Conference proceedings
  • © 1986

Overview

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)

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 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

Licence this eBook for your library

Institutional subscriptions

Table of contents (62 papers)

  1. Front Matter

    Download chapter 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

  4. Partial interpretations of higher order algebraic types

    • Manfred Broy
    Pages 29-43

  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

  7. A semantical model for integration and modularization of rules

    • Peter van Emde Boas
    Pages 78-92

  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

  11. Systolic arrays: Characterizations and complexity

    • Oscar H. Ibarra
    Pages 140-153

  12. Geometric location problems and their complexity

    • D. T. Lee
    Pages 154-167

  13. Developing implicit data structures

    • J. Ian Munro
    Pages 168-176

  14. Higher-order arrays and stacks in programming. An application of complexity theory to logics of programs

    • Jerzy Tiuryn
    Pages 177-198

  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

  20. Polynomial complexity of the Newton-Puiseux algorithm

    • A. L. Chistov
    Pages 247-255
Back to top

Keywords

Bibliographic Information

Publish with us

Policies and ethics

Back to top

Search

Navigation