Name
Abstract | ||
|---|---|---|
A file ofn records can be sorted in linear time givenO(log(n)) processors. Four such algorithms are presented and analyzed. All of them have reasonable hardware requirements; no memory access conflicts are generated; a constant number of communication lines per processor are needed (except for one case); and the space requirements areO(n) orO(n log(log(n))). |
Year | DOI | Venue |
|---|---|---|
1983 | 10.1007/BF02218438 | BIT |
Keywords | DocType | Volume |
linear time | Journal | 23 |
Issue | ISSN | Citations |
2 | 1572-9125 | 3 |
PageRank | References | Authors |
2.21 | 14 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Jack A. Orenstein | 1 | 366 | 216.38 |
| T. H. Merrett | 2 | 245 | 403.50 |
| Luc Devroye | 3 | 3 | 2.21 |