Active Bibliography

4 Deletion Without Rebalancing in Balanced Binary Trees ∗ – Siddhartha Sen, Robert E. Tarjan
5 Rank-Balanced Trees – Bernhard Haeupler, Siddhartha Sen, Robert E. Tarjan
3 Deletion Without Rebalancing in Multiway Search Trees – Siddhartha Sen, Robert E. Tarjan
Red-Black Balanced Trie Hashing – E. J. Otoo, S. Effah - 1995
An Evaluation of Search Tree Techniques In The Presence of Caches – Costin Iancu, Anurag Acharya - 2001
On Consulting a Set of Experts and Searching – Igal Galperin - 1996
Contents – Oliver Friedmann, Martin Lange - 2010
4 Red-Black Trie Hashing – E.J. Otoo, S. Effah - 1995
2 Untangling binary trees via rotations – Joan M. Lucas
Deletion Without Rebalancing in Multiway Search Trees – unknown authors
Self-Adjusting Distributed Trees – Michael K. Reiter, Asad Samar, Chenxi Wang - 2005
Binary Trees: A Challenge Problem For Separating Concerns – Scott M. Pike - 2001
A Comparison of Dictionary Implementations – Mark P Neyer - 2009
2 Exploring the Duality Between Skip Lists and Binary Search Trees – Brian C. Dean, et al. - 2007
5 A flexible framework for learning-based surface reconstruction – Waqar Saleem - 2004
2 Efficient Techniques for Maintaining Multidimensional Keys in Linked Data Structures (Extended Abstract) – Roberto Grossi, Giuseppe F. Italiano - 1999
4 A Speculation-Friendly Binary Search Tree – Tyler Crain, Vincent Gramoli, Michel Raynal
2 Concurrent Perfect Balancing of Binary Search Trees – Jürgen Eckerle, Otto Nurmi
13 A practical concurrent binary search tree – Nathan G. Bronson, Jared Casper, Hassan Chafi, Kunle Olukotun - 2010