1. Lower bounds on the complexity of some optimal data structures;Fredman;SIAM J. Comput.,1981
2. M.L. Fredman, The complexity of maintaining an array and computing its partial sums, J. ACM, to appear.
3. The complexity of a near optimal data structure for a type of range query problem;Fredman;Proc. 11th Annual ACM Symposium on Theory of Computing,1979
4. M.L. Fredman, A lower bound on the complexity of computing orthogonal range queries, J. ACM, to appear.
5. On computing the rank function for a set of vectors;Yao,1975