| |
|
|
|
|
|
|
|
|
1. |
Record Nr. |
UNISA996465831103316 |
|
|
Titolo |
Parallel Algorithms and Architectures [[electronic resource] ] : International Workshop Suhl, GDR, May 25-30, 1987; Proceedings / / edited by Andreas Albrecht, Hermann Jung, Kurt Mehlhorn |
|
|
|
|
|
|
|
Pubbl/distr/stampa |
|
|
Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1987 |
|
|
|
|
|
|
|
|
|
ISBN |
|
|
|
|
|
|
Edizione |
[1st ed. 1987.] |
|
|
|
|
|
Descrizione fisica |
|
1 online resource (IX, 200 p.) |
|
|
|
|
|
|
Collana |
|
Lecture Notes in Computer Science, , 0302-9743 ; ; 269 |
|
|
|
|
|
|
Disciplina |
|
|
|
|
|
|
Soggetti |
|
Computers |
Computation by Abstract Devices |
|
|
|
|
|
|
|
|
Lingua di pubblicazione |
|
|
|
|
|
|
Formato |
Materiale a stampa |
|
|
|
|
|
Livello bibliografico |
Monografia |
|
|
|
|
|
Note generali |
|
Bibliographic Level Mode of Issuance: Monograph |
|
|
|
|
|
|
Nota di contenuto |
|
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 ^{O(\sqrt n )} time -- What can be parallelized in computational geometry? -- A co-operative programming environment for a back-end type sequential inference |
|
|
|
|
| |