000 | 03127nam a22004575i 4500 | ||
---|---|---|---|
001 | 978-3-540-47760-0 | ||
003 | DE-He213 | ||
005 | 20160624102026.0 | ||
007 | cr nn 008mamaa | ||
008 | 121227s1987 gw | s |||| 0|eng d | ||
020 |
_a9783540477600 _9978-3-540-47760-0 |
||
024 | 7 |
_a10.1007/3-540-18099-0 _2doi |
|
050 | 4 | _aQA75.5-76.95 | |
072 | 7 |
_aUYZG _2bicssc |
|
072 | 7 |
_aCOM037000 _2bisacsh |
|
082 | 0 | 4 |
_a004.0151 _223 |
245 | 1 | 0 |
_aParallel Algorithms and Architectures _h[electronic resource] : _bInternational Workshop Suhl, GDR, May 25–30, 1987 Proceedings / _cedited by Andreas Albrecht, Hermann Jung, Kurt Mehlhorn. |
260 | 1 |
_aBerlin, Heidelberg : _bSpringer Berlin Heidelberg, _c1987. |
|
264 | 1 |
_aBerlin, Heidelberg : _bSpringer Berlin Heidelberg, _c1987. |
|
300 |
_aII, 210 p. _bonline resource. |
||
336 |
_atext _btxt _2rdacontent |
||
337 |
_acomputer _bc _2rdamedia |
||
338 |
_aonline resource _bcr _2rdacarrier |
||
347 |
_atext file _bPDF _2rda |
||
490 | 1 |
_aLecture Notes in Computer Science, _x0302-9743 ; _v269 |
|
505 | 0 | _aDeterministic 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. | |
650 | 0 | _aComputer science. | |
650 | 1 | 4 | _aComputer Science. |
650 | 2 | 4 | _aComputation by Abstract Devices. |
700 | 1 |
_aAlbrecht, Andreas. _eeditor. |
|
700 | 1 |
_aJung, Hermann. _eeditor. |
|
700 | 1 |
_aMehlhorn, Kurt. _eeditor. |
|
710 | 2 | _aSpringerLink (Online service) | |
773 | 0 | _tSpringer eBooks | |
776 | 0 | 8 |
_iPrinted edition: _z9783540180999 |
786 | _dSpringer | ||
830 | 0 |
_aLecture Notes in Computer Science, _x0302-9743 ; _v269 |
|
856 | 4 | 0 | _uhttp://dx.doi.org/10.1007/3-540-18099-0 |
942 |
_2EBK6177 _cEBK |
||
999 |
_c35471 _d35471 |