Michael L. Fredman - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 55 from 55

2014

An intuitive and simple bounding argument for QuicksortMichael L. Fredman. ipl, 114(3):137-139, 2014. [doi]

2012

Generalizing a Theorem of Wilber on Rotations in Binary Search Trees to Encompass Unordered Binary TreesMichael L. Fredman. algorithmica, 62(3-4):863-878, 2012. [doi]

2011

On the Matter of Dynamic Optimality in an Extended Model for Tree Access OperationsMichael L. Fredman. wads 2011: 423-437 [doi]

2008

Adaptive sorting: an information theoretic perspectiveAmr Elmasry, Michael L. Fredman. ACTA, 45(1):33-42, 2008. [doi]

2005

Worst case constant time priority queueAndrej Brodnik, Svante Carlsson, Michael L. Fredman, Johan Karlsson, J. Ian Munro. jss, 78(3):249-256, 2005. [doi]

2003

Adaptive Sorting and the Information Theoretic Lower BoundAmr Elmasry, Michael L. Fredman. STACS 2003: 654-662 [doi]

The number of tests required to search an unordered tableMichael L. Fredman. ipl, 87(2):85-88, 2003. [doi]

1999

On the Efficiency of Pairing Heaps and Related Data StructuresMichael L. Fredman. JACM, 46(4):473-501, 1999. [doi]

A Priority Queue TransformMichael L. Fredman. wae 1999: 244-258 [doi]

1998

Information Theoretic Implications for Pairing HeapsMichael L. Fredman. stoc 1998: 319-326 [doi]

Optimal Biweighted Binary Trees and the Complexity of Maintaining Partial SumsHaripriyan Hampapuram, Michael L. Fredman. SICOMP, 28(1):1-9, 1998.

Lower Bounds for Fully Dynamic Connectivity Problems in GraphsMonika Rauch Henzinger, Michael L. Fredman. algorithmica, 22(3):351-362, 1998. [doi]

1997

The AETG System: An Approach to Testing Based on Combinatiorial DesignDavid M. Cohen, Siddhartha R. Dalal, Michael L. Fredman, Gardner C. Patton. TSE, 23(7):437-444, 1997. [doi]

1996

Weighted Binary Trees for Concurrent SearchingDavid M. Cohen, Michael L. Fredman. jal, 20(1):87-112, 1996.

Products of Finite State Machines with Full CoverageDavid M. Cohen, Michael L. Fredman. TCS, 154(1):57-65, 1996. [doi]

On the Complexity of Dualization of Monotone Disjunctive Normal FormsMichael L. Fredman, Leonid Khachiyan. jal, 21(3):618-628, 1996.

1995

Data Structures for Traveling SalesmenMichael L. Fredman, David S. Johnson, Lyle A. McGeoch, G. Ostheimer. jal, 18(3):432-479, 1995.

1994

Trans-Dichotomous Algorithms for Minimum Spanning Trees and Shortest PathsMichael L. Fredman, Dan E. Willard. jcss, 48(3):533-551, 1994.

Three StacksMichael L. Fredman, Deborah L. Goldsmith. jal, 17(1):44-70, 1994.

Lower Bounds for Dynamic AlgorithmsMichael L. Fredman. swat 1994: 167-171

1993

Products of Finite State Machines with Full CoverageDavid M. Cohen, Michael L. Fredman. icalp 1993: 469-477

Surpassing the Information Theoretic Bound with Fusion TreesMichael L. Fredman, Dan E. Willard. jcss, 47(3):424-436, 1993.

Data Structures for Traveling SalesmenMichael L. Fredman, David S. Johnson, Lyle A. McGeoch, G. Ostheimer. soda 1993: 145-154

Optimal Bi-Weighted Binary Trees and the Complexity of Maintaining Partial SumsHaripriyan Hampapuram, Michael L. Fredman. focs 1993: 480-485

1990

Trans-dichotomous Algorithms for Minimum Spanning Trees and Shortest PathsMichael L. Fredman, Dan E. Willard. focs 1990: 719-725

BLASTING through the Information Theoretic Barrier with FUSION TREESMichael L. Fredman, Dan E. Willard. stoc 1990: 1-7

1989

The Cell Probe Complexity of Dynamic Data StructuresMichael L. Fredman, Michael E. Saks. stoc 1989: 345-354

1988

Three StacksMichael L. Fredman, Deborah L. Goldsmith. focs 1988: 514-523

1987

Refined Complexity Analysis for Heap OperationsMichael L. Fredman, Thomas H. Spencer. jcss, 35(3):269-284, 1987.

Fibonacci heaps and their uses in improved network optimization algorithmsMichael L. Fredman, Robert Endre Tarjan. JACM, 34(3):596-615, 1987. [doi]

1986

The Pairing Heap: A New Form of Self-Adjusting HeapMichael L. Fredman, Robert Sedgewick, Daniel Dominic Sleator, Robert Endre Tarjan. algorithmica, 1(1):111-129, 1986.

1984

Hash Functions for Priority QueuesMiklós Ajtai, Michael L. Fredman, János Komlós. iandc, 63(3):217-225, December 1984.

Storing a Sparse Table with 0(1) Worst Case Access TimeMichael L. Fredman, János Komlós, Endre Szemerédi. JACM, 31(3):538-544, 1984. [doi]

Fibonacci Heaps and Their Uses in Improved Network Optimization AlgorithmsMichael L. Fredman, Robert Endre Tarjan. focs 1984: 338-346

1983

Hash Functions for Priority QueuesMiklós Ajtai, Michael L. Fredman, János Komlós. focs 1983: 299-303

1982

Storing a Sparse Table with O(1) Worst Case Access TimeMichael L. Fredman, János Komlós, Endre Szemerédi. focs 1982: 165-169

The Complexity of Partial Match Retrieval in a Dynamic SettingMichael L. Fredman, Dennis J. Volper. jal, 3(1):68-78, 1982.

The Complexity of Maintaining an Array and Computing Its Partial SumsMichael L. Fredman. JACM, 29(1):250-260, 1982. [doi]

1981

Inherent Complexity Trade-Offs for Range Query ProblemsWalter A. Burkhard, Michael L. Fredman, Daniel J. Kleitman. TCS, 16:279-290, 1981.

Query Time Versus Redundancy Trade-Offs for Range QueriesMichael L. Fredman, Dennis J. Volper. jcss, 23(3):355-365, 1981.

Observations Concerning the Complexity of a Class of On-Line Algebraic ProblemsMichael L. Fredman. TC, 30(1):83-86, 1981.

Lower Bounds on the Complexity of Some Optimal Data StructuresMichael L. Fredman. SICOMP, 10(1):1-10, 1981.

The Spanning Bound as a Measure of Range Query ComplexityMichael L. Fredman. jal, 2(1):77-87, 1981.

A Lower Bound on the Complexity of Orthogonal Range QueriesMichael L. Fredman. JACM, 28(4):696-705, 1981. [doi]

1980

The Inherent Complexity of Dynamic Data Structures which Accommodate Range QueriesMichael L. Fredman. focs 1980: 191-199

1979

A Near Optimal Data Structure for a Type of Range Query ProblemMichael L. Fredman. stoc 1979: 62-66

1978

On the Complexity of Computing the Measure of U[ai, bi]Michael L. Fredman, Bruce W. Weide. CACM, 21(7):540-544, 1978.

Observations on the Complexity of Generating Quasi-Gray CodesMichael L. Fredman. SICOMP, 7(2):134-146, 1978.

1976

How Good is the Information Theory Bound in Sorting?Michael L. Fredman. TCS, 1(4):355-361, 1976.

New Bounds on the Complexity of the Shortest Path ProblemMichael L. Fredman. SICOMP, 5(1):83-89, 1976.

1975

A Symmetry Relationship for a Class of PartitionsMichael L. Fredman. JCT, 18(2):199-202, 1975.

Two Applications of a Probabilistic Search Technique: Sorting x + y and Building Balanced Search TreesMichael L. Fredman. stoc 1975: 240-244

On the Decision Tree Complexity of the Shortest Path ProblemsMichael L. Fredman. focs 1975: 98-99

On computing the length of longest increasing subsequencesMichael L. Fredman. DM, 11(1):29-35, 1975. [doi]

1972

Growth properties of a class of recursively defined functionsMichael L. Fredman. PhD thesis, Stanford University, USA, 1972. [doi]

Sign in or sign up to see more results.

runs on WebDSL