Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
TIGHT COMPLEXITY BOUNDS FOR PARALLEL COMPARISON SORTING Department of Mathematics
 

Summary: TIGHT COMPLEXITY BOUNDS FOR PARALLEL COMPARISON SORTING
Noga Alon
Department of Mathematics
Tel Aviv University
and
Bell Communications Research
Yossi Azar
Department of Computer Science
School of Mathematical Sciences
Tel Aviv University
Uzi Vishkin
Department of Computer Science
Courant Institute of Mathematical Sciences
New York University
and
Tel Aviv University
ABSTRACT
The time complexity of sorting n elements using
p ~ n processors on Valiant's parallel comparison tree
model is considered. The following results are obtained.

  

Source: Alon, Noga - School of Mathematical Sciences, Tel Aviv University

 

Collections: Mathematics