+612 9045 4394
 
CHECKOUT
Foundations of Software Technology and Theoretical Computer Science : Fourth Conference, Bangalore, India December 13-15, 1984. Proceedings - M. Joseph

Foundations of Software Technology and Theoretical Computer Science

Fourth Conference, Bangalore, India December 13-15, 1984. Proceedings

By: M. Joseph (Editor), Rudrapatna K. Shyamasundar (Editor)

Paperback

Published: 1st November 1984
Ships: 15 business days
15 business days
$160.82
or 4 easy payments of $40.21 with Learn more
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.

ISBN: 9783540138839
ISBN-10: 3540138838
Series: Lecture Notes in Computer Science
Audience: General
Format: Paperback
Language: English
Number Of Pages: 470
Published: 1st November 1984
Publisher: Springer-Verlag Berlin and Heidelberg Gmbh & Co. Kg
Country of Publication: DE
Dimensions (cm): 23.39 x 15.6  x 2.46
Weight (kg): 0.67