Fredman and Tarjan: Fibonacci heaps and network optimization

What changed

Introduced Fibonacci heaps with amortized bounds improving several asymptotic network-optimization results.

Scientific scope

The record is the exact two-author 1987 JACM article. Its stated bounds are amortized and asymptotic; they do not imply universal practical superiority across workloads, implementations or hardware.

Evidence

The linked sources identify this contribution and its scope. WRS has not independently reconstructed the scientific claims. The record is the exact two-author 1987 JACM article. Its stated bounds are amortized and asymptotic; they do not imply universal practical superiority across workloads, implementations or hardware.

Contributors

• Michael L. Fredman · SCIENCE: Named source author of the scoped work; individual effort shares are not measured.
• Robert Endre Tarjan · SCIENCE: Named source author of the scoped work; individual effort shares are not measured.

• ACM page for Fibonacci heaps
• Princeton-hosted copy of Fibonacci-heaps paper

Provisional WRS assessment, edition 2026-10-16.1. Independent expert calibration is pending. This grade does not certify correctness or assign ownership.

Full scientific record · Browse contribution grades · Request a correction