Foundations of Software Technology and Theoretical Computer Science - Taschenbuch

EAN (ISBN-13): 9783540606925
ISBN (ISBN-10): 3540606920
Taschenbuch
Erscheinungsjahr: 1995
Herausgeber: Springer Berlin
515 Seiten
Gewicht: 0,801 kg

Buch in der Datenbank seit 2007-10-18T12:20:35+02:00 (Zurich)
Detailseite zuletzt geändert am 2024-04-16T22:10:59+02:00 (Zurich)
ISBN/EAN: 9783540606925

ISBN - alternative Schreibweisen:
3-540-60692-0, 978-3-540-60692-5
Alternative Schreibweisen und verwandte Suchbegriffe:
Autor des Buches: thiagarajan
Titel des Buches: bangalore, lecture notes computer science, foundations software technology and theoretical computer science, proceedings all india

---

Daten vom Verlag:

Autor/in: P.S. Thiagarajan
Titel: Lecture Notes in Computer Science; Foundations of Software Technology and Theoretical Computer Science - 15th Conference; Bangalore, India, December 1995. Proceedings
Verlag: Springer; Springer Berlin
523 Seiten
Erscheinungsjahr: 1995-12-04
Berlin; Heidelberg; DE
Sprache: Englisch
53,49 € (DE)
54,99 € (AT)
59,00 CHF (CH)
Available
XIII, 523 p.

BC; Hardcover, Softcover / Informatik, EDV/Informatik; Theoretische Informatik; Verstehen; algorithm; algorithms; complexity; complexity theory; computational geometry; computer; computer science; logic; programming; term rewriting; verification; algorithm analysis and problem complexity; combinatorics; Theory of Computation; Algorithms; Computer Science Logic and Foundations of Programming; Formal Languages and Automata Theory; Discrete Mathematics; Algorithmen und Datenstrukturen; Diskrete Mathematik; EA

Looking for MUM and DAD: Text-text comparisons do help.- Branch and bound on the network model.- A near optimal algorithm for the extended cow-path problem in the presence of relative errors.- Efficient algorithms for vertex arboricity of planar graphs.- A condition for the three colourability of planar locally path graphs.- A framework for the specification of reactive and concurrent systems in Z.- Synthesizing different development paradigms: Combining top-down with bottom-up reasoning about distributed systems.- Verifying part of the ACCESS.bus protocol using PVS.- Reusing batch parsers as incremental parsers.- The expressive power of indeterminate primitives in asynchronous computation.- The transformation calculus.- Equational axiomatization of bicoercibility for polymorphic types.- From causal consistency to sequential consistency in shared memory systems.- Observation of software for distributed systems with RCL.- Partiality and approximation schemes for local consistency in networks of constraints.- Maximal extensions of simplification orderings.- Average polynomial time is hard for exponential time under sn-reductions.- On self-testing without the generator bottleneck.- Observing behaviour categorically.- An algorithm for reducing binary branchings.- On the complexity of bisimilarity for value-passing processes.- On the expressive power of CCS.- Polarized name passing.- Path balance heuristic for self-adjusting binary search trees.- Pattern matching in compressed texts.- All-pairs min-cut in sparse networks.- Minimizing space usage in evaluation of expression trees.- Smooth surfaces for multi-scale shape representation.- On parallel complexity of planar triangulations.- Computing a largest empty anchored cylinder, and related problems.- Computing hierarchies ofclusters from the euclidean minimum spanning tree in linear time.- Determinizing Büchi asynchronous automata.- Achilles and the tortoise climbing up the arithmetical hierarchy.- Generalized temporal verification diagrams.- Model checking of probabilistic and nondeterministic systems.