Parallel Algorithms and Architectures International Workshop Suhl, GDR, May 25–30, 1987 Proceedings / [electronic resource] :
edited by Andreas Albrecht, Hermann Jung, Kurt Mehlhorn.
- Berlin, Heidelberg : Springer Berlin Heidelberg, 1987.
- II, 210 p. online resource.
- Lecture Notes in Computer Science, 269 0302-9743 ; .
- Lecture Notes in Computer Science, 269 .
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^$$ time -- What can be parallelized in computational geometry? -- A co-operative programming environment for a back-end type sequential inference machine CHI.
9783540477600
10.1007/3-540-18099-0 doi
Computer science.
Computer Science.
Computation by Abstract Devices.
QA75.5-76.95
004.0151
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^$$ time -- What can be parallelized in computational geometry? -- A co-operative programming environment for a back-end type sequential inference machine CHI.
9783540477600
10.1007/3-540-18099-0 doi
Computer science.
Computer Science.
Computation by Abstract Devices.
QA75.5-76.95
004.0151