3. Search Trees and Skip Lists

A. Andersson: “Balanced Search Trees Made Simple”

M. L. Fredman and R. E. Tarjan: “Fibonacci Heaps and Their Used in Improved Network Optimization Algorithms

I. Galperin and R. L. Rivest: “Scapegoat Trees”

C. Martinez and S. Roura: “Randomized Binary Search Trees

M. V. Ramakrishna and J. Zobel: ”Performance of String Hashing Functions”

R. Seidel and C. R. Aragon: “Randomized Search Trees”

H. E. Williams, J. Zobel and S. Heinz: “Self-adjusting trees in practice for large text collections”




Tilbage til hovedsiden


Februar 2005 Keld Helsgaun