Limits on the power of parallel random access machines with weak forms of write conflict resolution
type: Item
instance of: scholarly article
title: Limits on the power of parallel random access machines with weak forms of write conflict resolution
zbMATH Open document ID: 0859.68023
author: Faith E. Fich
author: Russell Impagliazzo
author: Valerie King
author: Mirosław Kutyłowski
author: Bruce M. Kapron
published in: Journal of Computer and System Sciences
publication date: 1997-03-31T00:00:00Z
Mathematics Subject Classification ID: 68Q10
zbMATH DE Number: 950763
zbMATH Keywords: robust pram
zbMATH Keywords: crew pram
zbMATH Keywords: priority pram
MaRDI profile type: Publication
full work available at URL: jcss.1996.0052
OpenAlex ID: W2062634550
DOI: 10.1006/JCSS.1996.0052
Recommended article: Q4281540
Recommended article: Limits on the power of concurrent-write parallel machines
Recommended article: Upper and Lower Time Bounds for Parallel Random Access Machines without Simultaneous Writes
Recommended article: Improved Upper and Lower Time Bounds for Parallel Random Access Machines without Simultaneous Writes
Recommended article: On the power of concurrent-write PRAMs with read-only memory
Recommended article: Parallel random access machines with bounded memory wordsize
Recommended article: Parallel Time $O(\log n)$ Acceptance of Deterministic CFL<scp>s</scp> on an Exclusive-Write P-RAM
Recommended article: Lower bounds for randomized exclusive write PRAMs
Recommended article: On the Capacity of Write-Constrained Memories
Recommended article: Parallelism in random access machines
description: scientific article; zbMATH DE number 950763