1. Acar, U.A., Blelloch, G.E., Harper, R., Vittes, J.L., Woo, S.L.M.: Dynamizing static algorithms, with applications to dynamic trees and history independence. In: Proc. SODA, pp. 531–540 (2004)
2. Andersson, A., Ottmann, T.: New tight bounds on uniquely represented dictionaries. SIAM Journal of Computing 24(5), 1091–1103 (1995)
3. Blelloch, G.E.: Space-efficient dynamic orthogonal point location, segment intersection, and range reporting. In: Proc. SODA (2008)
4. Blelloch, G.E., Golovin, D.: Strongly history-independent hashing with applications. In: Proc. FOCS, pp. 272–282 (2007)
5. Blelloch, G.E., Golovin, D., Vassilevska, V.: Uniquely represented data structures for computational geometry. Technical Report CMU-CS-08-115, Carnegie Mellon University (April 2008)