COMPLEXITY OF PARALLEL COMPARISON MERGING.

Annual Symposium on Foundations of Computer Science (Proceedings)

Volumn , Issue , 1987, Pages 195-201

  Gereb Graus, Mihaly ^a   Krizanc, Danny ^a  

^a HARVARD UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER PROGRAMMING - ALGORITHMS; COMPUTER SYSTEMS, DIGITAL - PARALLEL PROCESSING;

PARALLEL COMPARISON MERGING; PARALLEL COMPUTATION TREE MODEL; RANDOMIZED ALGORITHMS; WORST-CASE LOWER BOUND;

COMPUTER SYSTEMS PROGRAMMING;

EID: 0023532567     PISSN: 02725428     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/sfcs.1987.55     Document Type: Conference Paper

References (11)