Lower bounds for randomized exclusive write PRAMs

DOI10.1007/S002240000070zbMATH Open0893.68076OpenAlexW2041927040WikidataQ127121034 ScholiaQ127121034MaRDI QIDQ1384693

Philip D. MacKenzie

Publication date: 20 April 1998

Published in: Theory of Computing Systems (Search for Journal in Brave)

Full work available at URL: https://digital.library.unt.edu/ark:/67531/metadc743131/

zbMATH Keywords

randomizationexclusive write PRAM computations

Mathematics Subject Classification ID

Distributed algorithms (68W15)

Related Items (4)

\(O (\log^* n)\) algorithms on a Sum-CRCW PRAM ⋮ Parallel Time $O(\log n)$ Acceptance of Deterministic CFL<scp>s</scp> on an Exclusive-Write P-RAM ⋮ Time lower bounds do not exist for CRCW PRAMs ⋮ Unnamed Item

This page was built for publication: Lower bounds for randomized exclusive write PRAMs