scientific article; zbMATH DE number 3982517

MaRDI QIDQ3746885zbMATH OpenFDO

Authors Ian Parberry

Publication date 1986

zbMATH Keywords

parallel machinespolynomial speedup

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Formal languages and automata (68Q45)

Recommendations

• scientific article; zbMATH DE number 4068238
• A unified approach to models of synchronous parallel machines
• Parallelism Always Helps
• On the parallel computation thesis
• Speedups of deterministic machines by synchronous parallel machines

Cited in

(10)

• Speedups of deterministic machines by synchronous parallel machines
• A note on superlinear speedup
• On the time required to sum n semigroup elements on a parallel machine with simultaneous writes
• Parallel computation with threshold functions
• Data-movement-intensive problems: Two folk theorems in parallel computation revisited
• scientific article; zbMATH DE number 4068238 (Why is no real title available?)
• scientific article; zbMATH DE number 139618 (Why is no real title available?)
• On the parallel computation thesis
• What is the Church-Turing Thesis?
• Programmable and parallel water computing

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 Q3746885)