Growth properties of a class of recursively defined functions. - Michael L. Fredman (1972)

On the Decision Tree Complexity of the Shortest Path Problems - Michael L. Fredman (FOCS, 1975)

Two Applications of a Probabilistic Search Technique: Sorting x + y and Building Balanced Search Trees - Michael L. Fredman (STOC, 1975)

On computing the length of longest increasing subsequences. - Michael L. Fredman (Discret. Math., 1975)

A Symmetry Relationship for a Class of Partitions. - Michael L. Fredman (J. Comb. Theory A, 1975)

New Bounds on the Complexity of the Shortest Path Problem. - Michael L. Fredman (SIAM J. Comput., 1976)

How Good is the Information Theory Bound in Sorting? - Michael L. Fredman (Theor. Comput. Sci., 1976)

On the Complexity of Computing the Measure of U[ai, bi]. - Michael L. Fredman; Bruce W. Weide (Commun. ACM, 1978)

Observations on the Complexity of Generating Quasi-Gray Codes. - Michael L. Fredman (SIAM J. Comput., 1978)

A Near Optimal Data Structure for a Type of Range Query Problem - Michael L. Fredman (STOC, 1979)

The Inherent Complexity of Dynamic Data Structures which Accommodate Range Queries - Michael L. Fredman (FOCS, 1980)

A Lower Bound on the Complexity of Orthogonal Range Queries. - Michael L. Fredman (J. ACM, 1981)

The Spanning Bound as a Measure of Range Query Complexity. - Michael L. Fredman (J. Algorithms, 1981)

Query Time Versus Redundancy Trade-Offs for Range Queries. - Michael L. Fredman; Dennis J. Volper (J. Comput. Syst. Sci., 1981)

Lower Bounds on the Complexity of Some Optimal Data Structures. - Michael L. Fredman (SIAM J. Comput., 1981)

Observations Concerning the Complexity of a Class of On-Line Algebraic Problems. - Michael L. Fredman (IEEE Trans. Computers, 1981)

Inherent Complexity Trade-Offs for Range Query Problems. - Walter A. Burkhard; Michael L. Fredman; Daniel J. Kleitman (Theor. Comput. Sci., 1981)

Storing a Sparse Table with O(1) Worst Case Access Time - Michael L. Fredman; János Komlós; Endre Szemerédi (FOCS, 1982)

The Complexity of Maintaining an Array and Computing Its Partial Sums. - Michael L. Fredman (J. ACM, 1982)

The Complexity of Partial Match Retrieval in a Dynamic Setting. - Michael L. Fredman; Dennis J. Volper (J. Algorithms, 1982)

Storing a Sparse Table with 0(1) Worst Case Access Time. - Michael L. Fredman; János Komlós; Endre Szemerédi (J. ACM, 1984)

Hash Functions for Priority Queues - Miklós Ajtai; Michael L. Fredman; János Komlós (Inf. Control., 1984)

The Pairing Heap: A New Form of Self-Adjusting Heap. - Michael L. Fredman; Robert Sedgewick; Daniel Dominic Sleator; Robert Endre Tarjan (Algorithmica, 1986)

Fibonacci heaps and their uses in improved network optimization algorithms. - Michael L. Fredman; Robert Endre Tarjan (J. ACM, 1987)

Refined Complexity Analysis for Heap Operations. - Michael L. Fredman; Thomas H. Spencer (J. Comput. Syst. Sci., 1987)

The Cell Probe Complexity of Dynamic Data Structures - Michael L. Fredman; Michael E. Saks (STOC, 1989)

BLASTING through the Information Theoretic Barrier with FUSION TREES - Michael L. Fredman; Dan E. Willard (STOC, 1990)

Optimal Bi-Weighted Binary Trees and the Complexity of Maintaining Partial Sums - Haripriyan Hampapuram; Michael L. Fredman (FOCS, 1993)

Surpassing the Information Theoretic Bound with Fusion Trees. - Michael L. Fredman; Dan E. Willard (J. Comput. Syst. Sci., 1993)

Lower Bounds for Dynamic Algorithms. - Michael L. Fredman (SWAT, 1994)

Three Stacks. - Michael L. Fredman; Deborah L. Goldsmith (J. Algorithms, 1994)

Trans-Dichotomous Algorithms for Minimum Spanning Trees and Shortest Paths. - Michael L. Fredman; Dan E. Willard (J. Comput. Syst. Sci., 1994)

Data Structures for Traveling Salesmen. - Michael L. Fredman; David S. Johnson 001; Lyle A. McGeoch; G. Ostheimer (J. Algorithms, 1995)

Weighted Binary Trees for Concurrent Searching. - David M. Cohen; Michael L. Fredman (J. Algorithms, 1996)

On the Complexity of Dualization of Monotone Disjunctive Normal Forms. - Michael L. Fredman; Leonid Khachiyan (J. Algorithms, 1996)

Products of Finite State Machines with Full Coverage. - David M. Cohen; Michael L. Fredman (Theor. Comput. Sci., 1996)

The AETG System: An Approach to Testing Based on Combinatiorial Design. - David M. Cohen; Siddhartha R. Dalal; Michael L. Fredman; Gardner C. Patton (IEEE Trans. Software Eng., 1997)

Information Theoretic Implications for Pairing Heaps. - Michael L. Fredman (STOC, 1998)

Lower Bounds for Fully Dynamic Connectivity Problems in Graphs. - Monika Rauch Henzinger; Michael L. Fredman (Algorithmica, 1998)

Optimal Biweighted Binary Trees and the Complexity of Maintaining Partial Sums. - Haripriyan Hampapuram; Michael L. Fredman (SIAM J. Comput., 1998)

A Priority Queue Transform. - Michael L. Fredman (WAE, 1999)

On the Efficiency of Pairing Heaps and Related Data Structures. - Michael L. Fredman (J. ACM, 1999)

Adaptive Sorting and the Information Theoretic Lower Bound. - Amr Elmasry; Michael L. Fredman (STACS, 2003)

The number of tests required to search an unordered table. - Michael L. Fredman (Inf. Process. Lett., 2003)

Binomial, Fibonacci, and Pairing Heaps. - Michael L. Fredman (Handbook of Data Structures and Applications, 2004)

Worst case constant time priority queue. - Andrej Brodnik; Svante Carlsson; Michael L. Fredman; Johan Karlsson 003; J. Ian Munro (J. Syst. Softw., 2005)

Adaptive sorting: an information theoretic perspective. - Amr Elmasry; Michael L. Fredman (Acta Informatica, 2008)

On the Matter of Dynamic Optimality in an Extended Model for Tree Access Operations. - Michael L. Fredman (WADS, 2011)

Generalizing a Theorem of Wilber on Rotations in Binary Search Trees to Encompass Unordered Binary Trees. - Michael L. Fredman (Algorithmica, 2012)

An intuitive and simple bounding argument for Quicksort. - Michael L. Fredman (Inf. Process. Lett., 2014)

Comments on Dumitrescu's "A Selectable Sloppy Heap". - Michael L. Fredman (CoRR, 2016)