A Survey of Adaptive Sorting Algorithms (1992)

Cached

Download Links

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

Documents Related by Co-Citation

54 AN ALMOST OPTIMAL ALGORITHM FOR UNBOUNDED SEARCHING – Jon Louis Bentley, Andrew Chi-chih Yao - 1975
62 Adaptive Set Intersections, Unions, and Differences – Erik D. Demaine, Alejandro López-Ortiz, J. Ian Munro - 2000
38 Experiments on adaptive set intersections for text retrieval systems – E D Demaine, A López-Ortiz, J I Munro - 2001
30 Adaptive Intersection and t-Threshold Problems – Jeremy Barbay, Claire Kenyon - 2002
2354 Modern Information Retrieval – Ricardo Baeza-Yates, Berthier Ribeiro-Neto - 1999
20 A framework for adaptive sorting – O Petersson, A Moffat - 1995
37 A fast set intersection algorithm for sorted sequences – R A BAEZA-YATES
45 A simple algorithm for merging two disjoint linearly-ordered sets – F. K. Hwang, S. Lin - 1972
4 Sublinear merging and natural mergesort – S Carlsson, C Levcopoulos, O Petersson - 1993
6 Adaptive sorting and the information theoretic lower bound – Amr Elmasry, Michael L Fredman - 2003
59 A new representation for linear lists – L Guibas, E McCreight, M Plass, J Roberts - 1977
145 Data Structures and Algorithms 1: Sorting and Searching – K Mehlhorn - 1984
26 Measures of presortedness and optimal sorting algorithms – Heikki Mannila - 1985
377 Self-adjusting binary search trees – D D Sleator, R E Tarjan - 1985
646 Suffix arrays: A new method for on-line string searches – Udi Manber, Argo Gene Myerst - 1993
45 Data Structures and Algorithms – K MEHLHORN - 1984
362 Probabilistic computations: Towards a unified measure of complexity – A C Yao - 1977
9 Optimality of randomized algorithms for the intersection problem – J Barbay - 2003
98 The ultimate planar convex hull algorithm – D G Kirkpatrick, R Seidel - 1986