Foundations of Software Technology and Theoretical Computer Science. Lecture Notes in Computer Science, Volume 1180 - Taschenbuch

EAN (ISBN-13): 9783540620341
ISBN (ISBN-10): 3540620346
Taschenbuch
Erscheinungsjahr: 1996
Herausgeber: Springer Berlin
408 Seiten
Gewicht: 0,614 kg
Sprache: eng/Englisch

Buch in der Datenbank seit 2007-06-28T06:17:46+02:00 (Berlin)
Detailseite zuletzt geändert am 2023-05-21T18:36:53+02:00 (Berlin)
ISBN/EAN: 9783540620341

ISBN - alternative Schreibweisen:
3-540-62034-6, 978-3-540-62034-1
Alternative Schreibweisen und verwandte Suchbegriffe:
Autor des Buches: vinay
Titel des Buches: lecture notes computer science, foundations software technology and theoretical computer science, hyderabad, the science and technology the, proceedings all india, 1180

---

Daten vom Verlag:

Autor/in: Vijay Chandru; V. Vinay
Titel: Lecture Notes in Computer Science; Foundations of Software Technology and Theoretical Computer Science - 16th Conference, Hyderabad, India, December 18 - 20, 1996, Proceedings
Verlag: Springer; Springer Berlin
395 Seiten
Erscheinungsjahr: 1996-11-27
Berlin; Heidelberg; DE
Sprache: Englisch
53,49 € (DE)
54,99 € (AT)
59,00 CHF (CH)
Available
XIII, 395 p.

BC; Hardcover, Softcover / Informatik, EDV/Informatik; Theoretische Informatik; Verstehen; Algorithmen; Algorithmische Geometrie; Prozeßalgebren; Typentheorie; algorithm; algorithms; complexity; complexity theory; computational geometry; process algebras; program semantics; semantics; type theory; algorithm analysis and problem complexity; Theory of Computation; Software Engineering; Computer Science Logic and Foundations of Programming; Algorithms; Formal Languages and Automata Theory; Computer Graphics; Software Engineering; Algorithmen und Datenstrukturen; Grafikprogrammierung; EA

Circuit complexity before the dawn of the new millennium.- A lambda calculus with letrecs and barriers.- Tables.- Mechanized formal methods: Progress and prospects.- The parameter space of the d-step conjecture.- On the complexity of approximating Euclidean traveling salesman tours and minimum spanning trees.- Efficient computation of rectilinear geodesic voronoi neighbor in presence of obstacles.- Weak bisimulation and model checking for Basic Parallel Processes.- Testing processes for efficiency.- Regularity is decidable for normed PA processes in polynomial time.- Dynamic maintenance of shortest path trees in simple polygons.- Close approximations of minimum rectangular coverings.- A new competitive algorithm for agent searching in unknown streets.- On the design of hybrid control systems using automata models.- Constraint retraction in FD.- Winskel is (almost) right.- An optimal deterministic algorithm for online b-matching.- Tight bounds for prefetching and buffer management algorithms for parallel I/O systems.- Complexity of the gravitational method for linear programming.- Optimal and information theoretic syntactic Pattern Recognition involving traditional and transposition errors.- Minimal relative normalization in orthogonal expression reduction systems.- Trace consistency and inevitability.- Finite state implementations of knowledge-based programs.- Higher-order proof by consistency.- Advocating ownership.- Non-cancellative Boolean circuits: A generalization of monotone Boolean circuits.- Limitations of the QRQW and EREW PRAM models.- Pinpointing computation with modular queries in the Boolean hierarchy.- Characterization of the principal type of normal forms in an intersection type system.- Correcting type errors in the Curry System.- Immediate fixpoints andtheir use in groundness analysis.- Graph types for monadic mobile processes.