Asynchronous PRAMs are (almost) as good as synchronous PRAMs

Annual Symposium on Foundations of Computer Science - Proceedings

Volumn 2, Issue , 1990, Pages 590-599

  Martel, Charles ^a   Subramonian, Ramesh ^a   Park, Arvin ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER METATHEORY--COMPUTATIONAL COMPLEXITY;

COMPUTATIONAL MODELS; PARALLEL RANDOM-ACCESS MACHINES (PRAMS);

COMPUTER SYSTEMS, DIGITAL;

EID: 0025534910     PISSN: 02725428     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (21)