scientific article; zbMATH DE number 4068238

zbMATH Open0654.68005MaRDI QIDQ3801042FDOQ3801042

Authors: Ian Parberry 

Publication date: 1987

Title of this publication is not available (Why is that?)

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

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)

Cited In (24)

• Sorting networks: to the end and back again
• Lower bounds on the computational power of an optical model of computation
• Single-exception sorting networks and the computational complexity of optimal sorting network verification
• Optical computing
• 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
• The Dynamic Parallel Complexity of Computational Circuits
• Computing functions with parallel queries to NP
• Parallel Multivariate Meta-Theorems
• Upper envelope onion peeling
• Title not available (Why is that?)
• An optimal time bound for oblivious routing
• On similarity and duality of computation (I)
• Speedup of determinism by alternation for multidimensional Turing machines
• Title not available (Why is that?)
• Title not available (Why is that?)
• Complexity theory of parallel time and hardware
• Title not available (Why is that?)
• Expressibility and Parallel Complexity
• Data independence of read, write, and control structures in PRAM computations

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)