Cantitate/Preț
Produs

Parallel Algorithms and Architectures

Editat de Andreas Albrecht, Hermann Jung, Kurt Mehlhorn
en Limba Engleză Paperback – 9 dec 1987

Preț: 29024 lei

Preț vechi: 36280 lei
-20%

Puncte Express: 435

Carte tipărită la comandă

Livrare economică 14-28 iulie

Livrare prin curier în România Termenul estimat este afișat lângă disponibilitate.
Transport gratuit de la 40000 lei Plată online sau ramburs, în funcție de opțiunile comenzii.
Retur gratuit în 14 zile Comandă securizată și suport în română.

Specificații

ISBN-13: 9783540180999
ISBN-10: 3540180990
Pagini: 212
Ilustrații: IX, 200 p.
Dimensiuni: 155 x 235 x 12 mm
Greutate: 0.33 kg
Ediția:1987
Editura: Springer
Locul publicării:Berlin, Heidelberg, Germany

Public țintă

Research

Cuprins

Deterministic simulation of idealized parallel computers on more realistic ones.- Convex hull of randomly chosen points from a polytope.- Dataflow computing.- Parallel in sequence — Towards the architecture of an elementary cortical processor.- Parallel algorithms and static analysis of parallel programs.- Parallel processing of combinatorial search trees.- An O(nlogn) cost parallel algorithm for the single function coarsest partition problem.- Systolic algorithms for computing the visibility polygon and triangulation of a polygonal region.- RELACS — A recursive layout computing system.- Parallel linear conflict-tree subtree access.- A formal definition for systolic systems.- Parallel recognition of outerplanar graphs.- Solutions for the distributed termination problem.- Memories for parallel subtree-access.- Synapse: A multi-microprocessor lisp machine with parallel garbage collector.- A note on optimal parallel transformations of regular expressions to nondeterministic finite automata.- Optimal parallel parsing of bracket languages.- On reliable networks from unreliable gates.- Area-time tradeoffs for selection.- Optimization of special permutation networks using simple algebraic relations.- Computing a rectilinear steiner minimal tree in $$n^{O(\sqrt n )}$$ time.- What can be parallelized in computational geometry?.- A co-operative programming environment for a back-end type sequential inference machine CHI.