Paper Info
Title
Communication Complexity of PRAMs (Preliminary Version)
Abstract
We propose a model for the concurrent read exclusive write PRAM that captures its communication and computational requirements. For this model, we present several results, including the following:
Year
DOI
Venue
1988
10.1007/3-540-19488-6_103
ICALP
Keywords
Field
DocType
communication complexity,preliminary version
Discrete mathematics,Binary logarithm,Combinatorics,Computer science,Matrix (mathematics),Binary tree,Communication complexity,Polynomial algorithm,Computation
Conference
Volume
ISSN
ISBN
317
0302-9743
3-540-19488-6
Citations 
PageRank 
References 
15
8.90
13
Authors
2
Name
Order
Citations
PageRank
Alok Aggarwal11890228.97
Ashok K. Chandra231161215.02