Amazon cover image
Image from Amazon.com
Image from Google Jackets

Foundations of Software Technology and Theoretical Computer Science [electronic resource] : Sixth Conference, New Delhi, India December 18–20, 1986 Proceedings / edited by Kesav V. Nori.

Contributor(s): Material type: TextTextSeries: Lecture Notes in Computer Science ; 241Publisher: Berlin, Heidelberg : Springer Berlin Heidelberg, 1986Description: XIV, 518 p. online resourceContent type:
  • text
Media type:
  • computer
Carrier type:
  • online resource
ISBN:
  • 9783540472391
Subject(s): Additional physical formats: Printed edition:: No titleDDC classification:
  • 005.1 23
LOC classification:
  • QA76.758
Online resources:
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.
In: Springer eBooks
Item type: E-BOOKS
Tags from this library: No tags from this library for this title. Log in to add tags.
Star ratings
    Average rating: 0.0 (0 votes)
Holdings
Home library Call number Materials specified URL Status Date due Barcode
IMSc Library Link to resource Available EBK6011

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.

There are no comments on this title.

to post a comment.
The Institute of Mathematical Sciences, Chennai, India