L FredmanMichael

Storing a Sparse Table with 0(1) Worst Case Access Time

L FredmanMichael, KomlósJános, SzemerédiEndre, 1984 .

The Complexity of Maintaining an Array and Computing Its Partial Sums

L FredmanMichael, 1982 .

Fibonacci heaps and their uses in improved network optimization algorithms

L FredmanMichael, TarjanRobert Endre, 1987 .

A Lower Bound on the Complexity of Orthogonal Range Queries

L FredmanMichael, 1981 .

On the complexity of computing the measure of ∪[ai,bi]

L FredmanMichael, WeideBruce, 1978 .

The pairing heap: a new form of self-adjusting heap

E TarjanRobert, L FredmanMichael, SedgewickRobert, 1986 .