scientific article
From MaRDI portal
Publication:3801042
zbMath0654.68005MaRDI QIDQ3801042
Publication date: 1987
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Turing machinesbibliographycircuitsexercisescomplexity measuresSIMDparallel RAMparallelitysubject indexmodel of parallel computersnetwork machineparallel computation hypothesissingle instruction stream multiple data stream
Analysis of algorithms and problem complexity (68Q25) Complexity of computation (including implicit computational complexity) (03D15) Research exposition (monographs, survey articles) pertaining to computer science (68-02) Turing machines and related notions (03D10)
Related Items
An insight on PRAM computational bounds, Speedup of determinism by alternation for multidimensional Turing machines, Solving H-horizon, stationary Markov decision problems in time proportional to log (H), A computer-assisted optimal depth lower bound for nine-input sorting networks, Parallel local search, The log-star revolution, Sorting networks: to the end and back again, An optimal time bound for oblivious routing, Lower bounds on the computational power of an optical model of computation, Data independence of read, write, and control structures in PRAM computations, COLLAPSING THE HIERARCHY OF PARALLEL COMPUTATIONAL MODELS, Upper envelope onion peeling, Single-exception sorting networks and the computational complexity of optimal sorting network verification, Optical computing
