| Document Date: 2004-09-15 12:26:58
Open Document File Size: 507,43 KBShare Result on Facebook
Company ARTICLE IN PRESS / Oðn2 / Oða / / Country United States / / Currency pence / / / Event M&A / / Facility A.V. Williams Building / College Park / University of Maryland / / IndustryTerm non-constructive algorithms / nonconstructive algorithms / parallel algorithms / ðn2Þ processors / p-processor algorithm / polynomial time algorithm / nonconstructive algorithm / nonconstructive randomized algorithms / rst k-round sorting algorithm / constructive algorithm / parallel sorting algorithms / enough processors / constant-time parallel sorting algorithms / constructive randomized algorithms / / Organization National Science Foundation / University of Maryland / Department of Computer Science / Institute for Adv. / University of Maryland / College Park / / Person Clyde Kruskala / Azar / Alon / William Gasarch / / Position Corresponding author / / ProvinceOrState Maryland / / Technology nonconstructive algorithm / using ðn2Þ processors / randomized algorithm / following algorithm / ðlog log nÞ1 1=k Algorithm / sorting algorithm / polynomial time algorithm / interesting constant-time parallel sorting algorithms / constructive randomized algorithms / constructive algorithm / rst k-round sorting algorithm / nonconstructive randomized algorithms / ðn2Þ processors / The algorithm / parallel sorting algorithms / simulation / non-constructive algorithms / nonconstructive algorithms / 91 Algorithm / p-processor algorithm / / URL http /
SocialTag |
ARTICLE IN PRESS Journal of Computer and System Sciences[removed]–91 http://www.elsevier.com/locate/jcss Constant time parallel sorting: an empirical view