Foundations of Software Technology and Theoretical Computer Science: sixth Conference, New Delhi, India, December 18-20, 1986. Proceedings by Kesav V. NoriFoundations of Software Technology and Theoretical Computer Science: sixth Conference, New Delhi, India, December 18-20, 1986. Proceedings by Kesav V. Nori

Foundations of Software Technology and Theoretical Computer Science: sixth Conference, New Delhi…

byKesav V. Nori

Paperback | November 1, 1986

Pricing and Purchase Info

$103.95

Earn 520 plum® points

Prices and offers may vary in store

Quantity:

In stock online

Ships free on orders over $25

Not available in stores

Title:Foundations of Software Technology and Theoretical Computer Science: sixth Conference, New Delhi…Format:PaperbackDimensions:531 pages, 9.25 × 6.1 × 0.01 inPublished:November 1, 1986Publisher:Springer Berlin HeidelbergLanguage:English

The following ISBNs are associated with this title:

ISBN - 10:3540171797

ISBN - 13:9783540171799

Look for similar items by category:

Reviews

Table of Contents

Software Development Graphs a unifying concept for software development?.- Concurrent runtime checking of annotated Ada programs.- Recovery of noncurrent variables in source-level debugging of optimized code.- Automatic retargetable code generation: A new technique.- An implementation of OBJ2: An object-oriented language for abstract program specification.- Explicit representation of terms defined by counter examples.- A framework for intelligent backtracking in logic programs.- A generalization of Backus' FP.- Shortest-path motion.- Via assignment in single row routing.- Average-case analysis of the Modified Harmonic algorithm.- Covering minima and lattice point free convex bodies.- Binary decompositions and acyclic schemes.- Thin homogeneous sets of factors.- Irreducible polynomials over finite fields.- Basis reduction and evidence for transcendence of certain numbers.- A characterization of asynchronous message-passing.- Modular synthesis of deadlock-free control structures.- Distributed resource sharing in computer networks.- On proving communication closedness of distributed layers.- A distributed algorithm for edge-disjoint path problem.- Scheduling of hard real-time systems.- A polynomial approximation scheme for machine scheduling on uniform processors: Using the dual approximation approach.- Connectivity algorithms using rubber bands.- On simple and creative sets in NP.- Complexity of sufficient-completeness.- Sampling a population with a semi-random source.- An optimal parallel algorithm for dynamic expression evaluation and its applications.- Extension of the parallel nested dissection algorithm to path algebra problems.- On synthesizing systolic arrays from Recurrence Equations with Linear Dependencies.- An efficient parallel algorithm for term matching.