Sorting in Linear Time? (1995)

Cached

Download Links

by Arne Andersson , Torben Hagerup , Stefan Nilsson
Citations:85 - 14 self

Active Bibliography

Arne Andersson – Arne Andersson, Torben Hagerup, Stefan Nilsson
1 Randomized Parallel Computation – Sanguthevar Rajasekaran, John H. Reif
17 Graph Augmentation And Related Problems: Theory And Practice – Tsan-Sheng Hsu - 1993
12 Solving the All-Pair Shortest Path Query Problem on Interval and Circular-Arc Graphs – Danny Z. Chen, D. T. Lee, R. Sridhar, Chandra N. Sekharan - 1998
17 Error Correcting Codes, Perfect Hashing Circuits, and Deterministic Dynamic Dictionaries – Peter Bro Miltersen - 1997
Equivalence Between Sorting and . . . – Mikkel Thorup - 1995
4 Fast Algorithms for Shortest Paths and Sorting – Rajeev Raman - 1996
7 Thinking in parallel: Some basic data-parallel algorithms and techniques – Uzi Vishkin - 1993
10 Parallel External Memory Graph Algorithms – Lars Arge, Michael T. Goodrich, Nodari Sitchinava
41 Improved Parallel Integer Sorting without Concurrent Writing – Susanne Albers, Torben Hagerup - 1992
70 On RAM priority queues – Mikkel Thorup - 1996
193 Programming Parallel Algorithms – Guy E. Blelloch - 1996
19 Static Dictionaries on AC^0 RAMs: Query time Θ(,/log n / log log n) is necessary and sufficient – Arne Andersson, Peter Bro Miltersen, et al. - 1996
25 On Parallel Hashing and Integer Sorting – Yossi Matias, Uzi Vishkin - 1991
Parallel Randomized Algorithms for Selection, Sorting and Convex Hulls – Sanguthevar Rajasekaran, Sandeep Sen - 2000
2 Communication-Processor Tradeoffs in Limited Resources PRAM – Adnan Agbaria , Yosi Ben-Asher , Ilan Newman
21 Sorting and Selection on Interconnection Networks – Sanguthevar Rajasekaran - 1995
5 An Optimal Parallel Matching Algorithm for Cographs – R. Lin, S. Olariu - 1994
Optimal Parallel Algorithms for Two Processor Scheduling with Tree Precedence Constraints – Ernst W. Mayr, Hans Stadtherr - 1995