Active Bibliography

8 A Simple Implementation Technique for Priority Search Queues – Ralf Hinze - 2001
5 Numerical Representations as Higher-Order Nested Datatypes – Ralf Hinze - 1998
5 Rank-Balanced Trees – Bernhard Haeupler, Siddhartha Sen, Robert E. Tarjan
11 Binary Search Trees of Almost Optimal Height – Arne Andersson, et al. - 1990
14 Fast updating of well-balanced trees – Arne Andersson - 1990
21 Improving Partial Rebuilding by Using Simple Balance Criteria – Arne Andersson
21 Balanced search trees made simple – Arne Andersson - 1993
3 Deletion Without Rebalancing in Multiway Search Trees – Siddhartha Sen, Robert E. Tarjan
Red-Black Balanced Trie Hashing – E. J. Otoo, S. Effah - 1995
4 Red-Black Trie Hashing – E.J. Otoo, S. Effah - 1995
5 Functional Pearls: Explaining Binomial Heaps – Ralf Hinze - 1999
24 Manufacturing Datatypes – Ralf Hinze - 1999
19 General balanced trees – Arne Andersson - 1999
1 Quick Decoding and Encoding of Prüfer Strings: Exercises in Data Structures – Bryant A. Julstrom
An Evaluation of Search Tree Techniques In The Presence of Caches – Costin Iancu, Anurag Acharya - 2001
20 Algebra of logic programming – Silvija Seres - 1999
Potentials and Limitations of Visual Methods for the Exploration of Complex Data Structures – Tobias Lauer - 2007
Maintaining alpha-balanced Trees by Partial Rebuilding – Arne Andersson - 1991
6 Relaxed Balancing Made Simple – Th. Ottmann, E. Soisalon-Soininen - 1995