Yijie Han, Xiaojun Shen  Home/Search
Context Related
| umkc.edu/~hanyij/research/cocoon.ps Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: umkc.edu/~hanyij/research...index (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: We present a conservative CRCW parallel algorithm for integer sorting. This algorithm sorts n integers from f0; 1; :::; m \Gamma 1g in time O( n log log min(m; n) log n) using p processors. The simulation of our parallel algorithm on the sequential machine yields a sequential algorithm for integer sorting which sorts n integers from f0; 1; :::; m \Gamma 1g in time O(nmin(log log n; log )). (Update)
Similar documents based on text: More All
0.4: Parallel Integer Sorting Is More Efficient than Parallel.. - Han, Shen (1999) (Correct)
0.4: Shortest Paths on a Polyhedron, Part I: Computing Shortest Paths - Chen, Han (1992) (Correct)
0.4: An Improvement on Parallel Computation of a Maximal Matching - Han (Correct)
BibTeX entry: (Update)
Y. Han, X. Shen, Conservative algorithms for parallel and sequential integer sorting, Proc. 1995. http://citeseer.ist.psu.edu/han95conservative.html More
@inproceedings{ han95conservative,
author = "Yijie Han and Xiaojun Shen",
title = "Conservative Algorithms for Parallel and Sequential Integer Sorting",
booktitle = "Computing and Combinatorics",
pages = "324-333",
year = "1995",
url = "citeseer.ist.psu.edu/han95conservative.html" }
Citations (may not include all citations):201 Parallel prefix computation (context) - Ladner, Fischer - 1980
79 Parallelism in comparison problems (context) - Valiant - 1975
64 A parallel algorithm for the efficient solution of a general.. (context) - Kogge, Stone - 1973
57 Deterministic parallel list ranking (context) - Anderson, Miller - 1991
45 Optimal and sublogarithmic time randomized parallel sorting .. - Rajasekaran, Reif
37 Improved deterministic parallel integer sorting (context) - Bhatt, Diks et al. - 1991
31 Improved parallel integer sorting without concurrent writing - Albers, Hagerup
20 Upper bounds for sorting integers on random access machines (context) - Kirkpatrick, Reisch - 1984
20 Towards optimal parallel bucket sorting (context) - Hagerup - 1987
17 Blasting through the information theoretic barrier with fusi.. (context) - Fredman, Willard - 1990
14 New parallel-sorting schemes (context) - Preparata - 1978
14 Parallel algorithms for bucket sorting and the data dependen.. - Wagner, Han - 1986
12 On parallel integer sorting (context) - Rajasekaran, Sen - 1992
11 The power of collision: randomized parallel algorithms for c.. (context) - Raman
8 Designing fast and efficient parallel algorithms (context) - Han - 1987
[Article contains additional citations not shown here]
Documents on the same site (http://www.sice.umkc.edu/~hanyij/research/index.htm): More
Matching Partition a Linked List and Its Optimization - Han (1989) (Correct)
Time Lower Bounds for Sorting on Multi-Dimensional.. - Han, Igarashi (1990) (Correct)
An Optimal Linked List Prefix Algorithm on a Local Memory Computer - Han (1991) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC