scientific article; zbMATH DE number 4068238

MaRDI QIDQ3801042zbMATH OpenFDO

Authors Ian Parberry

Publication date 1987

zbMATH Keywords

complexity measuresbibliographycircuitsTuring machinesexercisesSIMDparallel RAMparallelitysubject indexmodel of parallel computersnetwork machineparallel computation hypothesissingle instruction stream multiple data stream

Mathematics Subject Classification ID

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

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

(26)

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

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)