A Survey of Adaptive Sorting Algorithms (1992)

Cached

Download Links

by Vladimir Estivill-Castro , Derick Wood
Citations:55 - 3 self

Active Bibliography

External Sorting and Nearly Sortedness – Vladimir Estivill-Castro, Derick Wood
Finger Search on Balanced Search Trees – Maverick Woo - 2006
2 Putting your data structure on a diet – Hervé Brönnimann, Jyrki Katajainen, Pat Morin - 2007
6 Sorting and/by Merging Finger Trees – Alistair Moffat, Ola Petersson, Nicholas C. Wormald - 1992
1 An Adaptive Generic Sorting Algorithm that Uses Variable Partitioning – Vladimir Estivill-Castro, Derick Wood - 1992
18 Communication Efficient Data Structures on the BSP model with Applications – Alexandros V. Gerbessiotis, Constantinos J. Siniolakis - 1996
15 A Randomized Sorting Algorithm on the BSP model – Alexandros V. Gerbessiotis, Constantinos J. Siniolakis - 1997
25 A skip list cookbook – William Pugh - 1990
13 Logarithmic Time Cost Optimal Parallel Sorting is Not Yet Fast in Practice! – Lasse Natvig - 1990
1 Properties of Multi-Splay Trees – Jonathan Derryberry, Daniel Sleator, Chengwen Chris Wang - 2009
1 Randomized Parallel Computation – Sanguthevar Rajasekaran, John H. Reif
20 Randomized Binary Search Trees – Conrado Martínez, Salvador Roura - 1997
3 Efficient Strategies for Topics in Internet Algorithmics – Amitabha Bagchi, Advisor Michael, T. Goodrich - 2002
5 Numerical Representations as Higher-Order Nested Datatypes – Ralf Hinze - 1998
3 A General-Purpose Parallel Sorting Algorithm – Andrew Tridgell, Richard P. Brent - 1995
B.Tech. Project Report Part II – Project Title Sorting, S. S. Bansal, Supervisor Dr. Phalguni Gupta - 2002
www.stacs-conf.org COMPRESSED REPRESENTATIONS OF PERMUTATIONS, AND APPLICATIONS – unknown authors - 902
12 Compressed representations of permutations, and applications – Jérémy Barbay, Gonzalo Navarro
16 Purely Functional Representations of Catenable Sorted Lists. – Haim Kaplan, Robert E. Tarjan - 1996