Foundations of Software Technology and Theoretical Computer Science - neues Buch

EAN (ISBN-13): 9783540472391
Herausgeber: Springer Science+Business Media

Buch in der Datenbank seit 2017-01-15T10:01:52+01:00 (Zurich)
Detailseite zuletzt geändert am 2023-12-02T15:34:30+01:00 (Zurich)
ISBN/EAN: 9783540472391

ISBN - alternative Schreibweisen:
978-3-540-47239-1
Alternative Schreibweisen und verwandte Suchbegriffe:
Titel des Buches: software, technology technology, foundations science, computer science

---

Daten vom Verlag:

Autor/in: Kesav V. Nori
Titel: Lecture Notes in Computer Science; Foundations of Software Technology and Theoretical Computer Science - Sixth Conference, New Delhi, India, December 18-20, 1986. Proceedings
Verlag: Springer; Springer Berlin
518 Seiten
Erscheinungsjahr: 2005-06-29
Berlin; Heidelberg; DE
Sprache: Englisch
53,49 € (DE)
55,00 € (AT)
59,00 CHF (CH)
Available
XIV, 518 p.

EA; E107; eBook; Nonbooks, PBS / Informatik, EDV/Informatik; Software Engineering; Verstehen; Approximation; Ban; Code; Debugging; Matching; algorithms; communication; complexity; logic; theoretical computer science; C; Software Engineering; Programming Techniques; Theory of Computation; Arithmetic and Logic Structures; Computer Science; Computerprogrammierung und Softwareentwicklung; Theoretische Informatik; Computerhardware; BC

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.