Chandru

Foundations of Software Technology and Theoretical Computer Science

16th Conference, Hyderabad, India, December 18 - 20, 1996, Proceedings
Mitarbeit:Chandru, Vijay; Vinay, V.

• Broschiertes Buch

Produktbeschreibung

This book constitutes the refereed proceedings of the 16th International Conference on Foundations of Software Technology and Theoretical Computer Science, FST&TCS '96, held in Hyderabad, India, in December 1996.
The volume presents 28 revised full papers selected from a total of 98 submissions; also included are four invited contributions. The papers are organized in topical sections on computational geometry, process algebras, program semantics, algorithms, rewriting and equational-temporal logics, complexity theory, and type theory.

---

Hinweis: Dieser Artikel kann nur an eine deutsche Lieferadresse ausgeliefert werden.

Produktdetails

• Lecture Notes in Computer Science 1180
• Verlag: Springer / Springer Berlin Heidelberg / Springer, Berlin
• Artikelnr. des Verlages: 978-3-540-62034-1
• 1996.
• Seitenzahl: 408
• Erscheinungstermin: 27. November 1996
• Englisch
• Abmessung: 235mm x 155mm x 23mm
• Gewicht: 528g
• ISBN-13: 9783540620341
• ISBN-10: 3540620346
• Artikelnr.: 09232343

Inhaltsangabe

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.