Foundations of Software Technology and Theoretical Computer Science
11th Conference, New Delhi, India, December 17-19. Proceedings.
(Sprache: Englisch)
This volume contains the proceedings of the EleventhConference on Foundations of Software Technology andTheoretical Computer Science held in New Dehli, IndiaDecember 17-19, 1991. Three invited papers and 25contributed papers selected from 78...
Leider schon ausverkauft
versandkostenfrei
Buch
93.08 €
Produktdetails
Produktinformationen zu „Foundations of Software Technology and Theoretical Computer Science “
Klappentext zu „Foundations of Software Technology and Theoretical Computer Science “
This volume contains the proceedings of the EleventhConference on Foundations of Software Technology andTheoretical Computer Science held in New Dehli, IndiaDecember 17-19, 1991. Three invited papers and 25contributed papers selected from 78 submissions by authorsfrom many different countries reflect the current researchconcerns of the theoreticalcomputer science community. Thetopics covered include:-Algorithms (sequential, parallel and geometric)-Automata theory-Functional programming-Learning-Logic of programs-Semantics-Structural complexity theory-Type theory.
Inhaltsverzeichnis zu „Foundations of Software Technology and Theoretical Computer Science “
Program checking.- Randomizing reductions of search problems.- Time analysis, cost equivalence and program refinement.- AC-equation solving.- On the operational interpretation of complex types.- Tense logics for local reasoning in distributed systems.- Failures semantics for a simple process language with refinement.- Correctness of programs over poor signatures.- Complexity issues for vacillatory function identification.- A purely algebraic proof of McNaughton's theorem on infinite words.- The structure and complexity of minimal NFA's over a unary alphabet.- Relativised cellular automata and complexity classes.- Computing the order of a locally testable automaton.- On the structure and complexity of infinite sets with minimal perfect hash functions.- NP-hard sets and creativeness over constant time languages.- Complete problems involving boolean labelled structures and projection translations.- Is BP.? $$\mathcal{P}$$ a probabilistic class?.- Fast stable in-place sorting with O(n) data moves.- A theorem on the approximation of set cover and vertex cover.- A fast algorithm for the principal partition of a graph.- Uniform circuits and exclusive read PRAMs.- Contracting planar graphs efficiently in parallel.- Fast deterministic selection on mesh-connected processor arrays.- Improved selection in totally monotone arrays.- Designing secure communication protocols from trust specifications.- Computing the shortest path tree in a weak visibility polygon.- Usefulness of angle-sweep over line-sweep.- Petri nets and transition systems (Abstract for an invited talk).
Bibliographische Angaben
- 1991, 1991, 425 Seiten, Maße: 15,5 x 23,5 cm, Kartoniert (TB), Englisch
- Mitarbeit:Biswas, Somenath; Nori, Kesav V.
- Herausgegeben: Kesav V. Nori, Somenath Biswas
- Verlag: Springer
- ISBN-10: 3540549676
- ISBN-13: 9783540549673
- Erscheinungsdatum: 27.11.1991
Sprache:
Englisch
Kommentar zu "Foundations of Software Technology and Theoretical Computer Science"
0 Gebrauchte Artikel zu „Foundations of Software Technology and Theoretical Computer Science“
Zustand | Preis | Porto | Zahlung | Verkäufer | Rating |
---|
Schreiben Sie einen Kommentar zu "Foundations of Software Technology and Theoretical Computer Science".
Kommentar verfassen