TY  - BOOK
AU  - Joseph,M.
AU  - Shyamasundar,Rudrapatna
ED  - Conference on Foundations of Software Technology and Theoretical Computer Science
TI  - Foundations of software technology and theoretical computer science: fourth conference, Bangalore, India, Dec. 13-15, 1984, proceedings 
T2  - Lecture notes in computer science
SN  - 9783540390879
AV  - QA76.6 .F686 1984
U1  - 001.64/2 19
PY  - 1984///
CY  - Berlin, New York
PB  - Springer-Verlag
KW  - Computer programming
KW  - Congresses
KW  - Computers
KW  - Programmation (Informatique)
KW  - Congrès
KW  - Ordinateurs
KW  - Informatique
KW  - Logiciels
KW  - fast
KW  - Programmation
KW  - ram
KW  - Congress
KW  - proceedings (reports)
KW  - aat
KW  - Conference papers and proceedings
KW  - lcgft
KW  - Actes de congrès
KW  - rvmgf
N1  - " ... FST & TCS conferences"--Preface; Includes bibliographical references; 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; Electronic reproduction; [Place of publication not identified]; HathiTrust Digital Library; 2011
UR  - https://link.springer.com/10.1007/3-540-13883-8
ER  -