Skip to main content
SpringerLink
Log in
Book cover

Foundations of Software Technology and Theoretical Computer Science

Tenth Conference, Bangalore, India, December 17-19, 1990, Proceedings

  • Conference proceedings
  • © 1990

Overview

Editors:
  1. Kesav V. Nori
    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  2. C. E. Veni Madhavan
    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 472)

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

  1. Front Matter

    Download chapter PDF

  2. Reasoning about linear constraints using parametric queries

    • Tien Huynh, Leo Joskowicz, Catherine Lassez, Jean-Louis Lassez
    Pages 1-20

  3. Discriminant circumscription

    • Li Yan Yuan, Jia-Huai You
    Pages 21-32

  4. Complexity of algebraic specifications

    • Ramesh Subrahmanyam
    Pages 33-47

  5. A new method for undecidability proofs of first order theories

    • Ralf Treinen
    Pages 48-62

  6. Generating plans in linear logic

    • M. Masseron, C. Tollu, J. Vauzeilles
    Pages 63-75

  7. Automata-theoretic techniques for image generation and compression

    • Karel Culik II, Simant Dube
    Pages 76-90

  8. Recognizable infinite tree sets and their complexity

    • A. Saoudi, D. E. Muller, P. E. Schupp
    Pages 91-103

  9. The expressibility of nondeterministic auxiliary stack automata and its relation to treesize bounded alternating auxiliary pushdown automata

    • V. Vinay, V. Chandru
    Pages 104-114

  10. Towards constructive program derivation in VDM

    • Christopher P. Lewington
    Pages 115-132

  11. A new method for proving termination of AC-rewrite systems

    • Deepak Kapur, G. Sivakumar, Hantao Zhang
    Pages 133-148

  12. Efficient parallel algorithms for optical computing with the DFT primitive

    • John Reif, Akhilesh Tyagi
    Pages 149-160

  13. The power of collision: Randomized parallel algorithms for chaining and integer sorting

    • Rajeev Raman
    Pages 161-175

  14. Fast parallel algorithms for cographs

    • R. Lin, S. Olariu
    Pages 176-189

  15. Optimally representing euclidean space discretely for analogically simulating physical phenomena

    • John Case, Dayanand S. Rajan, Anil M. Shende
    Pages 190-203

  16. Optimal parallel algorithms for testing isomorphism of trees and outerplanar graphs

    • Christos Levcopoulos, Andrzej Lingas, Ola Petersson, Wojciech Rytter
    Pages 204-214

  17. Randomized parallel selection

    • Sanguthevar Rajasekaran
    Pages 215-224

  18. A fast parallel algorithm for finding a maximal bipartite set

    • David Pearson, Vijay Vazirani
    Pages 225-231

  19. On the parallel evaluation of classes of circuits

    • S. Rao Kosaraju
    Pages 232-237

  20. Voronoi diagrams of moving points in the plane

    • Jyh-Jong Fu, R. C. T. Lee
    Pages 238-254
Back to top

Keywords

About this book

This volume gives the proceedings of the Tenth Conference on Foundations of Software Technology and Theoretical Computer Science. These conferences are organized and run by the computer science research community in India, and their purpose is to provide a forum for professional interaction between members of this research community and their counterparts in different parts of the world. The volume includes four invited papers on: - reasoning about linear constraints using parametric queries, - the parallel evaluation of classes of circuits, - a theory of commonsense visual reasoning, - natural language processing, complexity theory and logic. The 26 submitted papers are organized into sections on logic, automata and formal languages, theory of programming, parallel algorithms, geometric algorithms, concurrency, distributed computing, and semantics.

Bibliographic Information

Publish with us

Policies and ethics

Back to top

Search

Navigation