Foundations of software technology and theoretical computer science : tenth conference, Bangalore, India, December 17-19, 1990 : proceedings : FST and TCS 10
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...
Uloženo v:
| Korporativní autor: | |
|---|---|
| Další autoři: | , |
| Médium: | Livre numérique |
| Jazyk: | Anglais |
| Vydáno: |
Berlin [etc.] :
Springer
[20..].
Cham : Springer Nature |
| Edice: | Lecture notes in computer science
472 |
| Témata: | |
| On-line přístup: | Accès sur la plateforme de l'éditeur Accès sur la plateforme Istex Accès Université d'Orléans Accès INSA CVL |
| Poznámka: |
Archives Springer e-books (Licence nationale) Archives Springer e-books (Licence nationale) |
| Autres localisations: | Voir dans le Sudoc |
| Edition sous un autre format: | • Foundations of software technology and theoretical computer science, tenth conference, Bangalore, India, December 17-19, 1990, proceedings, K.V. Nori, C.E. Veni Madhavan (eds.), Berlin, Springer-Verlag, 1990, 1 vol. (X-420 p.), Lecture notes in computer science, 0-387-53487-3 • Foundations of Software Technology and Theoretical Computer Science, Texte imprimé, 9783662209011 |
Obsah:
- Reasoning about linear constraints using parametric queries
- Discriminant circumscription
- Complexity of algebraic specifications
- A new method for undecidability proofs of first order theories
- Generating plans in linear logic
- Automata-theoretic techniques for image generation and compression
- Recognizable infinite tree sets and their complexity
- The expressibility of nondeterministic auxiliary stack automata and its relation to treesize bounded alternating auxiliary pushdown automata
- Towards constructive program derivation in VDM
- A new method for proving termination of AC-rewrite systems
- Efficient parallel algorithms for optical computing with the DFT primitive
- The power of collision: Randomized parallel algorithms for chaining and integer sorting
- Fast parallel algorithms for cographs
- Optimally representing euclidean space discretely for analogically simulating physical phenomena
- Optimal parallel algorithms for testing isomorphism of trees and outerplanar graphs
- Randomized parallel selection
- A fast parallel algorithm for finding a maximal bipartite set
- On the parallel evaluation of classes of circuits
- Voronoi diagrams of moving points in the plane
- Efficient algorithms for identifying all maximal isothetic empty rectangles in VLSI layout design
- On some largest empty orthoconvex polygons in a point set
- Defining process fairness for non-interleaving concurrency
- Observational logics and concurrency models
- Distributed reset
- Refinement and composition of transition-based rely-guarantee specifications with auxiliary variables
- Efficient algorithms for crash recovery in distributed systems
- A non-standard inductive semantics
- Relating full abstraction results for different programming languages
- Towards a theory of commonsense visual reasoning
- Natural language processing, complexity theory and logic.