Michael L. Fredman
- Michael L. Fredman. A
lower bound on the complexity of orthogonal range queries.
Journal of the ACM, 28(4):696-705, October 1981.
Citations.
- Michael L. Fredman. The
complexity of maintaining an array and computing its partial sums.
Journal of the ACM, 29(1):250-260, January 1982.
Citations.
- Michael L. Fredman, János Komlós, and Endre
Szemerédi. Storing a sparse table with
O(1) worst case access time. Journal of the
ACM, 31(3):538-544, July 1984.
Citations.
- Michael L. Fredman and Robert Endre Tarjan. Fibonacci heaps and their uses in
improved network optimization algorithms. Journal of the
ACM, 34(3):596-615, July 1987.
Citations.
Shortcuts: