1. Lect Notes Comput Sci;A. Andersson,1989
2. Lect Notes Comput Sci;A. Andersson,1990
3. A. Borodin, L. J. Guibas, N. A. Lynch, and A. C. Yao. Efficient searching using partial ordering. Information Processing Letters, 12:71–75, 1981.
4. G. S. Brodal, S. Chaudhuri, and J. Radhakrishnan. The randomized complexity of maintaining the minimum. Nordic Journal of Computing, Selected Papers of the 5th Scandinavian Workshop on Algorithm Theory (SWAT), 3(4):337–351, 1996.
5. Technical Report BRICS-RS-01-1;G. S. Brodal,2001