Amazon cover image
Image from Amazon.com

Foundations of software technology and theoretical computer science : fourth conference, Bangalore, India, Dec. 13-15, 1984, proceedings / edited by Mathai Joseph and Rudrapatna Shyamasundar.

By: Contributor(s): Material type: TextTextSeries: Lecture notes in computer science ; 181.Publication details: Berlin ; New York : Springer-Verlag, 1984.Description: 1 online resource (viii, 468 pages) : illustrationsContent type:
  • text
Media type:
  • computer
Carrier type:
  • online resource
ISBN:
  • 9783540390879
  • 3540390871
  • 9783540138839
  • 3540138838
Other title:
  • Also known as: FST & TCS
Subject(s): Genre/Form: Additional physical formats: Print version:11370092: No titleDDC classification:
  • 001.64/2 19
LOC classification:
  • QA76.6 .F686 1984
Online resources:
Contents:
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.
Action note:
  • digitized 2011 HathiTrust Digital Library committed to preserve
Holdings
Item type Current library Collection Call number Status Date due Barcode Item holds
eBook eBook e-Library eBook LNCS Available
Total holds: 0

" ... 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.

Use copy Restrictions unspecified star MiAaHDL

Electronic reproduction. [Place of publication not identified] : HathiTrust Digital Library, 2011. MiAaHDL

Master and use copy. Digital master created according to Benchmark for Faithful Digital Reproductions of Monographs and Serials, Version 1. Digital Library Federation, December 2002. MiAaHDL

http://purl.oclc.org/DLF/benchrepro0212

digitized 2011 HathiTrust Digital Library committed to preserve pda MiAaHDL

Powered by Koha