scientific article; zbMATH DE number 512845

MaRDI QIDQ4281540zbMATH OpenFDO

Authors Russell Impagliazzo, Bruce M. Kapron, Valerie King, Mirosław Kutyłowski, Faith E. Fich

Publication date 29 July 1996

zbMATH Keywords

ROBUST PRAMs

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Distributed algorithms (68W15)

Recommendations

• Limits on the power of parallel random access machines with weak forms of write conflict resolution
• Limits on the power of concurrent-write parallel machines
• Upper and Lower Time Bounds for Parallel Random Access Machines without Simultaneous Writes
• Improved Upper and Lower Time Bounds for Parallel Random Access Machines without Simultaneous Writes
• On the power of concurrent-write PRAMs with read-only memory
• Parallel random access machines with bounded memory wordsize
• Parallel Time $O(\log n)$ Acceptance of Deterministic CFL<scp>s</scp> on an Exclusive-Write P-RAM
• Lower bounds for randomized exclusive write PRAMs
• On the Capacity of Write-Constrained Memories
• Parallelism in random access machines

Cited in

(8)

• ERCW PRAMs and optical communication
• Lower bounds for randomized exclusive write PRAMs
• Limits on the power of parallel random access machines with weak forms of write conflict resolution
• Retrieval of scattered information by EREW, CREW, and CRCW PRAMs
• Computing OR on a randomized fixed adversary CRCW PRAM
• Parallel Time $O(\log n)$ Acceptance of Deterministic CFL<scp>s</scp> on an Exclusive-Write P-RAM
• Retrieval of scattered information by EREW, CREW and CRCW PRAMs
• On the power of concurrent-write PRAMs with read-only memory

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