Skip to main content
SpringerLink
Log in
Book cover

Foundations of Software Technology and Theoretical Computer Science

11th Conference, New Delhi, India, December 17-19, 1991. Proceedings

  • Conference proceedings
  • © 1991

Overview

Editors:
  1. Somenath Biswas
    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  2. 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 560)

Included in the following conference series:

Conference proceedings info: FSTTCS 1991.

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

  1. Front Matter

    Download chapter PDF

  2. Program checking

    • Manuel Blum
    Pages 1-9

  3. Randomizing reductions of search problems

    • Andreas Blass, Yuri Gurevich
    Pages 10-24

  4. Time analysis, cost equivalence and program refinement

    • David Sands
    Pages 25-39

  5. AC-equation solving

    • Subrata Mitra, G. Sivakumar
    Pages 40-56

  6. On the operational interpretation of complex types

    • Qing-Ping Tan, Huo-Wang Chen
    Pages 57-70

  7. Tense logics for local reasoning in distributed systems

    • Kamal Lodaya, R. Ramanujam
    Pages 71-88

  8. Failures semantics for a simple process language with refinement

    • Luca Aceto, Uffe Engberg
    Pages 89-108

  9. Correctness of programs over poor signatures

    • Hardi Hungar
    Pages 109-120

  10. Complexity issues for vacillatory function identification

    • John Case, Sanjay Jain, Arun Sharma
    Pages 121-140

  11. A purely algebraic proof of McNaughton's theorem on infinite words

    • Bertrand Le Saec, Jean-Eric Pin, Pascal Weil
    Pages 141-151

  12. The structure and complexity of minimal NFA's over a unary alphabet

    • Tao Jiang, Edward McDowell, B. Ravikumar
    Pages 152-171

  13. Relativised cellular automata and complexity classes

    • Meena Mahajan, Kamala Krithivasan
    Pages 172-185

  14. Computing the order of a locally testable automaton

    • Sam Kim, Robert McNaughton
    Pages 186-211

  15. On the structure and complexity of infinite sets with minimal perfect hash functions

    • Judy Goldsmith, Lane A. Hemachandra, Kenneth Kunen
    Pages 212-223

  16. NP-hard sets and creativeness over constant time languages

    • Manindra Agrawal
    Pages 224-241

  17. Complete problems involving boolean labelled structures and projection translations

    • Iain A. Stewart
    Pages 242-260

  18. Is BP.⊕\(\mathcal{P}\)a probabilistic class?

    • V Vinay
    Pages 261-265

  19. Fast stable in-place sorting with O(n) data moves

    • J. Ian Munro, Venkatesh Raman
    Pages 266-277

  20. A theorem on the approximation of set cover and vertex cover

    • V. Th. Paschos
    Pages 278-287
Back to top

Other volumes

  1. Foundations of Software Technology and Theoretical Computer Science

Keywords

About this book

This volume contains the proceedings of the Eleventh Conference on Foundations of Software Technology and Theoretical Computer Science held in New Dehli, India December 17-19, 1991. Three invited papers and 25 contributed papers selected from 78 submissions by authors from many different countries reflect the current research concerns of the theoreticalcomputer science community. The topics covered include: -Algorithms (sequential, parallel and geometric) -Automata theory -Functional programming -Learning -Logic of programs -Semantics -Structural complexity theory -Type theory.

Bibliographic Information

Publish with us

Policies and ethics

Back to top

Search

Navigation