Skip to main content
SpringerLink
Log in
Book cover

Foundations of Software Technology and Theoretical Computer Science

Seventh Conference, Pune, India, December 17-19, 1987. Proceedings

  • Conference proceedings
  • © 1987

Overview

Editors:
  1. Kesav V. Nori
    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 287)

Included in the following conference series:

Conference proceedings info: FSTTCS 1987.

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

  1. Front Matter

    Download chapter PDF

  2. Algebraic operational semantics

    • Yuri Gurevich
    Pages 1-2

  3. On ambiguity of DTOL systems

    • K. G. Subramanian, Do Van Long, Rani Siromoney
    Pages 3-14

  4. The equivalence problem for n-tape finite automata with simple cycles

    • Karel Culik II, Matti Linna
    Pages 15-25

  5. Relating the degree of ambiguity of finite automata to the succinctness of their representation

    • Oscar H. Ibarra, Bala Ravikumar
    Pages 26-43

  6. Automata, games, and positive monadic theories of trees

    • Michel Parigot
    Pages 44-57

  7. An algorithm for colouring perfect planar graphs

    • Iain A. Stewart
    Pages 58-64

  8. Efficient algorithms for domination and Hamilton circuit problems on permutation graphs

    • P. Shanthi Sastry, N. Jayakumar, C. E. Veni Madhavan
    Pages 65-78

  9. Fast parallel algorithms for the subgraph homeomorphism and the subgraph isomorphism problem for classes of planar graphs

    • Andrzej Lingas, Andrzej Proskurowski
    Pages 79-94

  10. Improved bounds for covering general polygons with rectangles

    • Christos Levcopoulos
    Pages 95-102

  11. Submodule construction as equation solving in CCS

    • Joachim Parrow
    Pages 103-123

  12. Computations in undistinguished networks

    • Shaji Bhaskar, Gael N. Buckley
    Pages 124-137

  13. A distributed algorithm to implement n-party rendezvous

    • Rajive Bagrodia
    Pages 138-152

  14. Merge and termination in process algebra

    • J. C. M. Baeten, R. J. van Glabbeek
    Pages 153-172

  15. Parallelism and programming: A perspective

    • K. Mani Chandy, Jayadev Misra
    Pages 173-194

  16. On optimal parallelization of sorting networks

    • Ethan Gannett, Suraj C. Kothari, Hsu-Chun Yen
    Pages 195-206

  17. Parallel algorithms for approximate edge colouring of simple graphs

    • O. A. Ogunyode
    Pages 207-225

  18. An optimal randomized routing algorithm for the Mesh and a class of efficient Mesh-like routing networks

    • Sanguthevar Rajasekaran, Thanasis Tsantilas
    Pages 226-241

  19. An O(n2) algorithm for fan-out free query optimization

    • Pratul Dublish, S. N. Maheshwari
    Pages 242-264

  20. Weak consistency of read-only transactions: A tool to improve concurrency in heterogeneous locking protocols

    • R. C. Hansdah, L. M. Patnaik
    Pages 265-281
Back to top

Other volumes

  1. Foundations of Software Technology and Theoretical Computer Science

Keywords

Bibliographic Information

Publish with us

Policies and ethics

Back to top

Search

Navigation