Foundations of Software Technology and Theoretical Computer Science - neues Buch

EAN (ISBN-13): 9783540505174
ISBN (ISBN-10): 3540505172
Gebundene Ausgabe
Taschenbuch
Erscheinungsjahr: 1988
Herausgeber: Springer Berlin Heidelberg
520 Seiten
Gewicht: 0,801 kg

Buch in der Datenbank seit 2007-05-16T03:21:47+02:00 (Zurich)
Detailseite zuletzt geändert am 2024-03-31T10:32:30+02:00 (Zurich)
ISBN/EAN: 3540505172

ISBN - alternative Schreibweisen:
3-540-50517-2, 978-3-540-50517-4
Alternative Schreibweisen und verwandte Suchbegriffe:
Autor des Buches: sanjeev kumar
Titel des Buches: nori, 1988, lecture notes computer science, foundations software technology and theoretical computer science, foundation, the science and technology the, proceedings all india

---

Daten vom Verlag:

Autor/in: Kesav V. Nori; Sanjeev Kumar
Titel: Lecture Notes in Computer Science; Foundations of Software Technology and Theoretical Computer Science - Eighth Conference, Pune, India, December 21-23, 1988. Proceedings
Verlag: Springer; Springer Berlin
528 Seiten
Erscheinungsjahr: 1988-11-17
Berlin; Heidelberg; DE
Sprache: Englisch
53,49 € (DE)
54,99 € (AT)
59,00 CHF (CH)
Available
XII, 528 p.

BC; Hardcover, Softcover / Informatik, EDV/Informatik; Software Engineering; Verstehen; Algorithms; Automat; Processing; Resolution; Variable; automata; complexity; computer; distributed computing; formal language; knowledge base; programming; proving; semantics; theorem proving; algorithm analysis and problem complexity; Software Engineering; Computer System Implementation; Theory of Computation; Algorithms; Computer Science Logic and Foundations of Programming; Systemanalyse und -design; Theoretische Informatik; Algorithmen und Datenstrukturen; EA

Planar point location revisited (A guided tour of a decade of research).- Computing a viewpoint of a set of points inside a polygon.- Analysis of preflow push algorithms for maximum network flow.- A new linear algorithm for the two path problem on chordal graphs.- Extending planar graph algorithms to K 3,3-free graphs.- Constant-space string-matching.- Inherent nonslicibility of rectangular duals in VLSI floorplanning.- Path planning with local information.- Linear broadcast routing.- Predicting deadlock in store-and-forward networks.- On parallel sorting and addition with concurrent writes.- An optimal parallel algorithm for sorting presorted files.- Superlinear speedup in parallel state-space search.- Circuit definitions of nondeterministic complexity classes.- Non-uniform proof systems: A new framework to describe non-uniform and probabilistic complexity classes.- Padding, commitment and self-reducibility.- The complexity of a counting finite-state automaton.- A hierarchy theorem for pram-based complexity classes.- A natural deduction treatment of operational semantics.- Uniformly applicative structures, a theory of computability and polyadic functions.- A proof technique for register atomicity.- Relation level semantics.- A constructive set theory for program development.- McCarthy's amb cannot implement fair merge.- GHC — A language for a new age of parallel programming.- Accumulators: New logic variable abstractions for functional languages.- A resolution rule for well-formed formulae.- Algebraic and operational semantics of positive/negative conditional algebraic specifications.- Semi-unification.- A method to check knowledge base consistency.- Knowledgebases as structured theories.- On functional independencies.- A generic algorithm for transaction processingduring network partitioning.