An insight on PRAM computational bounds

DOI10.1016/S0020-0190(97)00130-0zbMath1336.68078OpenAlexW2049650639MaRDI QIDQ287202

Linda Pagli, Fabrizio Luccio

Publication date: 26 May 2016

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0020-0190(97)00130-0

zbMATH Keywords

parallel algorithmsCREW PRAMlower bound theory

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Parallel algorithms in computer science (68W10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Cites Work

• Exact lower time bounds for computing Boolean functions on CREW PRAMs
• Improved Upper and Lower Time Bounds for Parallel Random Access Machines without Simultaneous Writes
• Time Complexity of Boolean Functions on CREW PRAM<scp>s</scp>
• Upper and Lower Time Bounds for Parallel Random Access Machines without Simultaneous Writes
• On Parallel Searching
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: An insight on PRAM computational bounds