Michael L. Fredman

Best Publications

• Fibonacci heaps and their uses in improved network optimization algorithms

  Michael L. Fredman;Robert Endre Tarjan

  4470
  Citations

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

  Michael L. Fredman;János Komlós;Endre Szemerédi

  1221
  Citations

• The AETG system: an approach to testing based on combinatorial design

  Unknown

  1016
  Citations

• On the Complexity of Dualization of Monotone Disjunctive Normal Forms

  Unknown

  495
  Citations

• The cell probe complexity of dynamic data structures

  M. Fredman;M. Saks

  462
  Citations

• Trans-dichotomous algorithms for minimum spanning trees and shortest paths

  Unknown

  416
  Citations

• Surpassing the information theoretic bound with fusion trees

  Unknown

  411
  Citations

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

  Michael L. Fredman;Robert Sedgewick;Daniel D. Sleator;Robert E. Tarjan

  406
  Citations

• Fibonacci Heaps And Their Uses In Improved Network Optimization Algorithms

  M.L. Fredman;R.E. Tarjan

  290
  Citations

• On the Size of Separating Systems and Families of Perfect Hash Functions

  Michael L. Fredman;János Komlós

  288
  Citations

• New Bounds on the Complexity of the Shortest Path Problem

  Unknown

  262
  Citations

• On computing the length of longest increasing subsequences

  Unknown

  226
  Citations

• How good is the information theory bound in sorting?

  Unknown

  167
  Citations

• A Lower Bound on the Complexity of Orthogonal Range Queries

  Unknown

  114
  Citations

• The Complexity of Maintaining an Array and Computing Its Partial Sums

  Unknown

  97
  Citations

• Lower Bounds for Fully Dynamic Connectivity Problems in Graphs

  Michael Fredman;Monika Henzinger

  92
  Citations

• On the complexity of computing the measure of ∪[a _i ,b _i ]

  Unknown

  85
  Citations

• Hash functions for priority queues

  M Ajtai;M Fredman;J Komlós

  82
  Citations

• BLASTING through the information theoretic barrier with FUSION TREES

  Unknown

  79
  Citations

• Storing a sparse table with O(1) worst case access time

  Unknown

  77
  Citations