Separating the power of EREW and CREW PRAMs with small communication width

DOI10.1006/inco.1997.2649zbMath0889.68069OpenAlexW2030685985MaRDI QIDQ1373140

Faith E. Fich, Rakesh Kumar Sinha, P. W. Beame

Publication date: 2 June 1998

Published in: Information and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/inco.1997.2649

zbMATH Keywords

parallel random access machines

Mathematics Subject Classification ID

Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Distributed algorithms (68W15)

Related Items (1)

Compression using efficient multicasting

Cites Work

• Unnamed Item
• Unnamed Item
• On separating the EREW and CREW PRAM models
• Exact lower time bounds for computing Boolean functions on CREW PRAMs
• Time Complexity of Boolean Functions on CREW PRAM<scp>s</scp>
• Toward Understanding Exclusive Read
• Trade-Offs between Depth and Width in Parallel Computation
• Upper and Lower Time Bounds for Parallel Random Access Machines without Simultaneous Writes
• On Parallel Searching
• CREW PRAM<scp>s</scp> and Decision Trees

This page was built for publication: Separating the power of EREW and CREW PRAMs with small communication width