Nicht aus der Schweiz? Besuchen Sie lehmanns.de

Foundations of Software Technology and Theoretical Computer Science

Sixth Conference, New Delhi, India, December 18-20, 1986. Proceedings

(Autor)

Buch | Softcover
XIV, 518 Seiten
1986 | 1986
Springer Berlin (Verlag)
978-3-540-17179-9 (ISBN)

Lese- und Medienproben

Foundations of Software Technology and Theoretical Computer Science - Kesav V. Nori
CHF 74,85 inkl. MwSt
  • Versand in 10-14 Tagen
  • Versandkostenfrei
  • Auch auf Rechnung
  • Artikel merken

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.

Erscheint lt. Verlag 1.11.1986
Reihe/Serie Lecture Notes in Computer Science
Zusatzinfo XIV, 518 p.
Verlagsort Berlin
Sprache englisch
Maße 155 x 235 mm
Gewicht 744 g
Themenwelt Mathematik / Informatik Informatik Software Entwicklung
Mathematik / Informatik Informatik Theorie / Studium
Informatik Weitere Themen Hardware
Schlagworte algorithms • Approximation • Ban • Code • Communication • Complexity • Debugging • Logic • Matching • theoretical computer science
ISBN-10 3-540-17179-7 / 3540171797
ISBN-13 978-3-540-17179-9 / 9783540171799
Zustand Neuware
Haben Sie eine Frage zum Produkt?
Mehr entdecken
aus dem Bereich
entwickle, drucke und baue deine DIY-Objekte

von Stephan Regele

Buch | Hardcover (2023)
Hanser, Carl (Verlag)
CHF 48,95