03367nam 22005055 450 99646583110331620220714144810.03-540-47760-810.1007/3-540-18099-0(CKB)1000000000230651(SSID)ssj0000325497(PQKBManifestationID)11268461(PQKBTitleCode)TC0000325497(PQKBWorkID)10322192(PQKB)10221094(DE-He213)978-3-540-47760-0(PPN)155192434(EXLCZ)99100000000023065120121227d1987 u| 0engurnn#|||mamaatxtccrParallel Algorithms and Architectures[electronic resource] International Workshop Suhl, GDR, May 25-30, 1987; Proceedings /edited by Andreas Albrecht, Hermann Jung, Kurt Mehlhorn1st ed. 1987.Berlin, Heidelberg :Springer Berlin Heidelberg :Imprint: Springer,1987.1 online resource (IX, 200 p.)Lecture Notes in Computer Science,0302-9743 ;269Bibliographic Level Mode of Issuance: Monograph3-540-18099-0 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 machine CHI.Lecture Notes in Computer Science,0302-9743 ;269ComputersComputation by Abstract Deviceshttps://scigraph.springernature.com/ontologies/product-market-codes/I16013Computers.Computation by Abstract Devices.004.0151Albrecht Andreasedthttp://id.loc.gov/vocabulary/relators/edtJung Hermannedthttp://id.loc.gov/vocabulary/relators/edtMehlhorn Kurtedthttp://id.loc.gov/vocabulary/relators/edtBOOK996465831103316Parallel Algorithms and Architectures2829772UNISA