Sanguthevar Rajasekaran, John H. Reif  Home/Search
Context Related
| ufl.edu/~raj/sort.ps ufl.edu/~raj/sort.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: ufl.edu/~raj/PAPERS (more) From: ufl.edu/~raj/PAPERS (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: .We assume a parallel RAM model which allows both concurrent reads and concurrent writes of a global memory. Our main result is an optimal randomized parallel algorithm for INTEGER SORT (i.e., for sorting n integers in the range [1; n]). Our algorithm costs only logarithmic time and is the first known that is optimal: the product of its time and processor bounds is upper bounded by a linear function of the input size. We also give a deterministic sub-logarithmic time algorithm for prefix sum.... (Update)
Cited by: More
Conservative Algorithms for Parallel and Sequential Integer.. - Han, Shen (1995) (Correct)
Parallel Integer Sorting Is More Efficient than Parallel.. - Han, Shen (1999) (Correct)
Parallel Integer Sorting Is More Efficient Than Parallel.. - Han, Shen (1999) (Correct)
Similar documents (at the sentence level):
14.5%: Illustration of Reif Macros - Thapa (2000) (Correct)
Active bibliography (related documents): More All
0.9: Randomized Parallel Computation - Rajasekaran, Reif (Correct)
0.3: Parallel Algorithm for Cograph Recognition with Applications - He (1991) (Correct)
0.3: ATM Switch Architectures - Verma (1994) (Correct)
Similar documents based on text: More All
0.4: Computing with Sublogarithmic Space - Maciej Liskiewicz, Rüdiger Reischuk (1997) (Correct)
0.4: Unknown - Hs Ik Lf (Correct)
0.4: The Complexity World below Logarithmic Space - Liskiewicz, Reischuk (1994) (Correct)
Related documents from co-citation: More All
31: Parallel merge sort (context) - Cole - 1988
13: Optimal bounds for decision problems on the CRCW PRAM (context) - Beame, Hastad - 1987
12: Tight bounds on the complexity of parallel sorting (context) - Leighton - 1985
BibTeX entry: (Update)
S. Rajasekaran and J. H. Reif. Optimal and sublogarithmic time randomized parallel sorting algorithms. SIAM Journal on Computing, 18(3):594--607, 1989. http://citeseer.ist.psu.edu/rajasekaran89optimal.html More
@article{ rajasekaran89optimal,
author = "Sanguthevar Rajasekaran and John H. Reif",
title = "Optimal and Sublogarithmic Time Randomized Parallel Sorting Algorithms",
journal = "SIAM J. Comput.",
volume = "18",
number = "3",
pages = "594-607",
year = "1989",
url = "citeseer.ist.psu.edu/rajasekaran89optimal.html" }
Citations (may not include all citations):2003 The Art of Computer Programming (context) - KNUTH - 1973
1749 An Introduction to Probability Theory and Its Applications (context) - FELLER - 1950
1450 The Design and Analysis of Computer Algorithms (context) - HOPCROFT - 1974
405 Depth First Search and Linear Graph Algorithms (context) - TARJAN - 1972
245 A Measure of Asymptotic Efficiency for Tests of a Hypothesis.. (context) - CHERNOFF - 1952
201 Parallel Prefix Computation (context) - LADNER, FISCHER - 1980
159 Tight Bounds on the Complexity of Parallel Sorting (context) - LEIGHTON - 1984
122 Parallel Tree Contraction and Its Application (context) - MILLER, REIF - 1985
100 Optimal Bounds for Decision Problems on the CRCW PRAM (context) - BEAM, HASTAD - 1987
49 Approximate and Exact Parallel Scheduling with Applications .. (context) - COLE, VISHKIN - 1986
27 the Distribution of the Number of Successes in Independent T.. (context) - HOEFFDING - 1956
25 and Sorting in a Parallel Computation Model (context) - SHILOACH, VISHKIN et al. - 1981
21 An Optimal Parallel Algorithm for Integer Sorting (context) - REIF - 1985
18 Randomized Speed-Ups in Parallel Computation (context) - VISHKIN - 1984
17 Symmetric Complementation (context) - REIF
13 Parallel Computation and Conflicts in Memory Access (context) - KUCERA - 1982
10 The Average Complexity of Deterministic and Randomized Paral.. (context) - ALON, AZAR - 1987
10 Efficient Algorithms for Graph Manipulation (context) - HOPCROFT, TARJAN - 1973
9 Fast Probabilistic Algorithms for Hamiltonian Paths and Matc.. (context) - ANGLUIN, VALIANT - 1979
8 th ACM Symposium on Theory of Computing (context) - ATAI, KOML et al. - 1983
8 Efficient Parallel Pseudo-Random Number Generation (context) - REIF, TYGAR - 1985
3 th IEEE Symposium on Foundations of Computer Science (context) - COLE, Sort - 1986
3 Spring Joint Computer Conf (context) - BATCHER, Networks et al. - 1968
2 the Power of Probabilistic Choice in Synchronous Parallel Co.. (context) - REIF
2 Two Problems in Concrete Complexity Cycle Detection and Para.. (context) - FICH - 1982
2 nd IEEE Symposium on Foundations of Computer Science (context) - REISCHUK, Probabilistic et al. - 1981
1 Houghton Miffin Company (context) - JOHNSONAND, KATZ et al. - 1969
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www-pub.cise.ufl.edu/~raj/PAPERS.html): More
Fast Algorithms for Generating Discrete Random Variates with .. - Rajasekaran, Ross (1993) (Correct)
Sorting And Selection On Interconnection Networks - Rajasekaran (1995) (Correct)
Sorting, Selection and Routing on the Array with.. - Rajasekaran, Sahni (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