Sorting in Linear Time?

Sorting in Linear Time? (1995)

Cached

Download Links

by Arne Andersson , Torben Hagerup , Stefan Nilsson , Rajeev Raman

Citations:

BibTeX

@MISC{Andersson95sortingin,
    author = {Arne Andersson and Torben Hagerup and Stefan Nilsson and Rajeev Raman},
    title = {    Sorting in Linear Time? },
    year = {1995}
}

Bookmark

OpenURL

Abstract

Citations

1206	Introduction to Parallel Algorithms and Architectures: Arrays - Leighton - 1992
590	Universal classes of hash functions - Carter, Wegman - 1979
325	Expected time bounds for selection - Floyd, Rivest - 1975
321	The Art of Computer Programming, vol. 3: Sorting and Searching - Knuth - 1973
314	R.: Three partition refinement algorithms - Paige, Tarjan - 1987
297	Computer Organization and Design: The Hardware-Software Interface (Appendix A, by James R - Hennessy, Patterson - 1993
281	Parallel merge sort - Cole
190	A guided tour of Chernoff bounds - Hagerup, Rub - 1990
179	An O(n log n) sorting network - Ajtai, Koml'os, et al. - 1983
146	Scaling and related techniques for geometry problems - Gabow, Bentley, et al. - 1984
135	Surpassing the information theoretic bound with fusion trees - Fredman, Willard - 1993
96	Deterministic coin tossing with applications to optimal parallel list ranking - Cole, Vishkin - 1986
91	An efficient parallel biconnectivity algorithm - Tarjan, Vishkin - 1985
71	Explicit constructions of linear-sized superconcentrators - Gabber, Galil - 1981
57	J.L.Hennessy,"Computer Organization & Design: The Hardware / Software Interface”, Second Edition - Patterson - 1998
55	A reliable randomized algorithm for the closest-pair problem - Dietzfelbinger, Hagerup, et al. - 1993
44	Approximate parallel scheduling. Part I: The basic technique with applications to optimal parallel list ranking in logarithmic time - Cole, Vishkin - 1988
43	Deterministic parallel list ranking - Anderson, Miller - 1988
42	Optimal bounds for decision problems - Beame, Hastad - 1989
39	Priority queues: small, monotone and trans-dichotomous - Raman - 1996
38	Improved parallel integer sorting without concurrent writing - Albers, Hagerup - 1992
35	Faster deterministic sorting and searching in linear space - Andersson - 1996
34	Adaptive bitonic sorting: An optimal parallel algorithm for shared-memory machines - Bilardi, Nicolau - 1989
31	merging, and sorting in parallel computation - Kruskal, Searching - 1983
31	Decision trees and random access machines - Paul, Simon - 1980
29	A new efficient radix sort - Andersson, Nilsson - 1994
24	Improved deterministic parallel integer sorting - Bhatt, Diks, et al. - 1991
21	Optimal merging and sorting - Hagerup, Rub - 1989
19	Upper bounds for sorting integers on random access machines, Theoret - Kirkpatrick, Reisch - 1984
14	merging, and sorting in parallel computation - Searching - 1983
13	Communication networks - Pippenger - 1990
11	When can we sort in o(n log n) time - Ben-Amram, Galil - 1993
7	Simulations among concurrent-write PRAMs - Fich, Ragde, et al. - 1988
7	Optimal parallel string algorithms: Merging, sorting and computing the minimum - Hagerup - 1994
7	Improved nonconservative sequential and parallel integer sorting - Hagerup, Shen - 1990
6	Simulations among concurrent-write PRAMs, Algorithmica 3 - Fich, Ragde, et al. - 1988
5	Parallel algorithms for bucket sorting and the data dependent prefix problem - Wagner, Han - 1986
2	Fast and reliable parallel hashing, Manuscript. A preliminary version appeared - Bast, Hagerup - 1991
1	The Art of ComputerProgramming, Vol. 3: Sorting and Searching - Knuth - 1973