Foundations of Software Technology and Theoretical Computer Science - nouveau livre

EAN (ISBN-13): 9783540390879
Editeur: Springer Science+Business Media

Livre dans la base de données depuis 2017-01-15T10:01:53+01:00 (Zurich)
Page de détail modifiée en dernier sur 2018-05-17T05:54:02+02:00 (Zurich)
ISBN/EAN: 9783540390879

ISBN - Autres types d'écriture:
978-3-540-39087-9
Autres types d'écriture et termes associés:
Auteur du livre: joseph
Titre du livre: software, technology technology, foundations science

---

Données de l'éditeur

Auteur: M. Joseph; R. Shyamasundar
Titre: Lecture Notes in Computer Science; Foundations of Software Technology and Theoretical Computer Science - Fourth Conference, Bangalore, India December 13-15, 1984. Proceedings
Editeur: Springer; Springer Berlin
470 Pages
Date de parution: 2005-07-05
Berlin; Heidelberg; DE
Langue: Anglais
53,49 € (DE)
55,00 € (AT)
59,00 CHF (CH)
Available
X, 470 p.

EA; E107; eBook; Nonbooks, PBS / Informatik, EDV/Informatik; Software Engineering; Verstehen; Computer; Software; algorithm; algorithms; computer science; database; design; functional programming; knowledge representation; logic; modeling; petri net; programming; theoretical computer science; algorithm analysis and problem complexity; C; Software Engineering; Algorithms; Computer Science; Algorithmen und Datenstrukturen; BC

Logic for knowledge representation.- Logical specification and implementation.- Process specification of logic programs.- Functional programming systems revisited.- Models and transformations for nondeterministic extensions of functional programming.- Degrees of non-determinism and concurrency: A Petri net view.- Proof rules for communication abstractions.- A distributed algorithm for detecting communication deadlocks.- On the existence and construction of robust communication protocols for unreliable channels.- Heuristic search approach to optimal routing in a distributed architecture.- Replacement in monotone Boolean networks: An algebraic perspective.- A new characterization of BPP.- Treating terminals as function values of time.- Logics of knowledge, games and dynamic logic.- Persistent first class procedures are enough.- Abstraction concepts for modeling screen oriented dialogue interfaces.- VLSI systems for design rule checks.- Bounds on the length of convex partitions of polygons.- On mapping cube graphs onto VLSI arrays.- A linear-time algorithm for determining the intersection type of two star polygons.- Eliminating cascading rollback in structured databases.- Recognition and top-down generation of ?-acyclic database schemes.- Universal and representative instances using unmarked nulls.- On some computational problems related to data base coding.- Generic oracles.- Approximation algorithm for maximum independent set in planar traingle-free graphs.- Grid file algorithms: An analysis in the biased case.- On the mean weight balance factor of binary trees.- An efficient algorithm for random sampling without replacement.- Proof rules for communication abstractions.