scientific article; zbMATH DE number 4068238

MaRDI QIDQ3801042zbMATH OpenFDO

Authors Ian Parberry

Publication date 1987

zbMATH Keywords

bibliographycircuitscomplexity measuresexercisesmodel of parallel computersnetwork machineparallel computation hypothesisparallel RAMparallelitySIMDsingle instruction stream multiple data streamsubject indexTuring machines

Mathematics Subject Classification ID

Turing machines and related notions (03D10) Complexity of computation (including implicit computational complexity) (03D15) Research exposition (monographs, survey articles) pertaining to computer science (68-02) Analysis of algorithms and problem complexity (68Q25)

Recommendations

• scientific article; zbMATH DE number 3982517
• A unified approach to models of synchronous parallel machines
• Parallel computation with threshold functions
• scientific article; zbMATH DE number 3988712
• scientific article; zbMATH DE number 4074482

Cited in

(27)

• Optical computing
• Complexity theory of parallel time and hardware
• Speedup of determinism by alternation for multidimensional Turing machines
• Parallel local search
• Data independence of read, write, and control structures in PRAM computations
• Sorting networks: to the end and back again
• Solving H-horizon, stationary Markov decision problems in time proportional to log (H)
• An insight on PRAM computational bounds
• A computer-assisted optimal depth lower bound for nine-input sorting networks
• Single-exception sorting networks and the computational complexity of optimal sorting network verification
• Collapsing the hierarchy of parallel computational models
• On similarity and duality of computation (I)
• scientific article; zbMATH DE number 3960998 (Why is no real title available?)
• scientific article; zbMATH DE number 3982517 (Why is no real title available?)
• scientific article; zbMATH DE number 3988712 (Why is no real title available?)
• scientific article; zbMATH DE number 139618 (Why is no real title available?)
• Expressibility and Parallel Complexity
• The Dynamic Parallel Complexity of Computational Circuits
• scientific article; zbMATH DE number 512920 (Why is no real title available?)
• Parallel Multivariate Meta-Theorems
• Upper envelope onion peeling
• The log-star revolution
• Relations among parallel and sequential computation models
• Parallel machine models: how they are and where are they going
• Computing functions with parallel queries to NP
• An optimal time bound for oblivious routing
• Lower bounds on the computational power of an optical model of computation

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3801042)