1. G. M. Adelson-Velskii and E. M. Landis. An algorithm for the organization of information. In Soviet Math. Doclady 3, pages 1259–1263, 1962.
2. Alok Aggarwal and Ashok K. Chandra. Virtual memory algoithms (preliminary version). In Proceedings of the 20th Annual ACM Symposium on Theory of Computing, pages 173–185. ACM Press, May 2–4 1988.
3. P. Beame and F. E. Fich. Optimal bounds for the predecessor problem and related problems. Journal of Computer and System Sciences, 65(1):38–72, 2002.
4. Fredrik Bengtsson and Jingsen Chen. Space-efficient range-sum queries in OLAP. In Yahiko Kambayashi, Mukesh Mohania, and Wolfram Wöß, editors, Data Ware-housing and Knowledge Discovery: 6th International Conference DaWaK, volume 3181 of Lecture Notes in Computer Science, pages 87–96. Springer, September 2004.
5. Andrej Brodnik. Searching in Constant Time and Minimum Space (MininÆ Res Magni Momenti Sunt). PhD thesis, University of Waterloo, Waterloo, Ontario, Canada, 1995. (Also published as technical report CS-95-41.).