Active Bibliography

5 Finger Search Trees – Gerth Stølting Brodal - 2005
Finger Search on Balanced Search Trees – Maverick Woo - 2006
An RFID Based . . . MOBILE OBJECT TRACKING – Pradip De - 2004
65 A Survey of Adaptive Sorting Algorithms – Vladimir Estivill-Castro, Derick Wood - 1992
Putting Your Dictionary on a Diet – Pat Morin
Undiscretized Dynamic Programming: Faster Algorithms for Facility Location and Related Problems on Trees – Rahul Shah Martin, Martin Farach-colton - 2002
8 Worst case optimal unionintersection expression evaluation – Ehsan Chiniforooshan, Arash Farzan, Mehdi Mirzazadeh - 2005
10 Space-efficient finger search on degree-balanced search trees – Guy E. Blelloch, Bruce M. Maggs, Shan Leung, Maverick Woo - 2003
5 Identifying Occurrences of Maximal Pairs in Multiple Strings – C.S. Iliopoulos, S. Sioutas, A. Tsakalidis, K. Tsichlas, Nato Grants, C. Makris, C. Makris, Royal Society - 2002
2 Putting your data structure on a diet – Hervé Brönnimann, Jyrki Katajainen, Pat Morin - 2007
16 Purely Functional Representations of Catenable Sorted Lists. – Haim Kaplan, Robert E. Tarjan - 1996
8 Key independent optimality – John Iacono - 2002
96 A New Data Structure for Representing Sorted Lists – Scott Huddleston , Kurt Mehlhorn - 1982
10 Weight Biased Leftist Trees and Modified Skip Lists – S. Cho, S. Sahni, Seonghun Cho, Sartaj Sahni - 1996
24 A Performance Comparison of Event Calendar Algorithms: an Empirical Approach – Kehsiung Chung, Janche Sang, Vernon Rego - 1993
Data Structures with Unpredictable Timing – Darrell Bethea, Michael K. Reiter
2 Skip trees, an alternative data structure to Skip lists in a concurrent approach – Xavier Messeguer - 1997
6 A Unified Approach to Concurrent and Parallel Algorithms on Balanced Data Structures – Joaquim Gabarro, Xavier Messeguer - 1997
13 A practical concurrent binary search tree – Nathan G. Bronson, Jared Casper, Hassan Chafi, Kunle Olukotun - 2010