Optimal Time-Space Trade-Offs for Non-Comparison-Based Sorting (2001)

View PDF

Download Links

by Rasmus Pagh , Jakob Pagter
Citations:3 - 0 self

Active Bibliography

Optimal Time-Space Trade-Offs for Non-Comparison-Based Sorting ∗ – unknown authors
62 Models of Computation -- Exploring the Power of Computing – John E. Savage
R-way Branching Programs and the Hamming Distance Problem – Jakob Pagter, Jakob Pagter, Jakob Pagter
Time-space tradeoff lower bounds for randomized computation of decision – Paul Beamey, Michael Saksz, Xiaodong Sunz, Erik Veey - 2002
5 Comparison-Based Time–Space Lower Bounds for Selection – Timothy M. Chan
Time-Space Tradeoffs Abstract – Denis X. Charles, Kenneth W. Regan
2 Binary Decision Diagrams – Beate Bollig, Martin Sauerhoff, Detlef Sieling, Ingo Wegener
333 External Memory Algorithms and Data Structures – Jeffrey Scott Vitter - 1998
249 Algorithms for Parallel Memory I: Two-Level Memories – Jeffrey Scott Vitter, Elizabeth A.M. Shriver - 1992