- On Self-Organizing Sequential Search Heuristics by Rivest (1976)
- A Trivial Algorithm Whose Analysis Isn't by Jonassen, Knuth (1977)
- Multidimensional Divide-and-Conquer by Bentley (1980)
- An empirical study of insertion and deletion in binary search trees by Eppinger (1983)
- Amortized Analyses of Self-Organizing Sequential Search Heuristics by Bentley, McGeoch (1985)
- Analysis of the Standard Deletion Algorithms in Exact Fit Domain Binary Search Trees by Culberson, Monroe (1990)
Last active
August 29, 2015 14:25
-
-
Save mrdrozdov/7cec8e651451c3dedb30 to your computer and use it in GitHub Desktop.
EECS 586 Research Papers
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment