Foundations of Software Technology and Theoretical Computer Science

11th Conference, New Delhi, India, December 17-19, 1991. Proceedings
Buch | Softcover
XI, 425 Seiten
1991 | 1991
Springer Berlin (Verlag)
978-3-540-54967-3 (ISBN)

Lese- und Medienproben

Foundations of Software Technology and Theoretical Computer Science -
53,49 inkl. MwSt
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.

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

Erscheint lt. Verlag 27.11.1991
Reihe/Serie Lecture Notes in Computer Science
Zusatzinfo XI, 425 p.
Verlagsort Berlin
Sprache englisch
Maße 155 x 233 mm
Gewicht 723 g
Themenwelt Mathematik / Informatik Informatik Software Entwicklung
Informatik Theorie / Studium Compilerbau
Schlagworte algorithm • algorithms • Automat • Automata • Automata Theory • Complexity • Complexity theory • Computational Geometry • Computer • Computer Science • Formale Sprache • Formal Languages • Grammars • Grammatiken • Graphentheorie • graph theory • Informatik • logische Syntax • Network Operations • Netzwerk (EDV) • Netzwerk-Operationen • programming • Semantics
ISBN-10 3-540-54967-6 / 3540549676
ISBN-13 978-3-540-54967-3 / 9783540549673
Zustand Neuware
Haben Sie eine Frage zum Produkt?
Mehr entdecken
aus dem Bereich
Grundlagen und Anwendungen

von Hanspeter Mössenböck

Buch | Softcover (2024)
dpunkt (Verlag)
29,90
a beginner's guide to learning llvm compiler tools and core …

von Kai Nacke

Buch | Softcover (2024)
Packt Publishing Limited (Verlag)
49,85