# Michael L. Fredman

According to our database

Collaborative distances:

^{1}, Michael L. Fredman authored at least 50 papers between 1975 and 2016.Collaborative distances:

## Timeline

#### Legend:

Book In proceedings Article PhD thesis Other## Links

#### On csauthors.net:

## Bibliography

2016

CoRR, 2016

2014

Inf. Process. Lett., 2014

2012

Generalizing a Theorem of Wilber on Rotations in Binary Search Trees to Encompass Unordered Binary Trees.

Algorithmica, 2012

2011

On the Matter of Dynamic Optimality in an Extended Model for Tree Access Operations.

Proceedings of the Algorithms and Data Structures - 12th International Symposium, 2011

2008

Acta Informatica, 2008

2005

J. Syst. Softw., 2005

2004

Proceedings of the Handbook of Data Structures and Applications., 2004

2003

Inf. Process. Lett., 2003

Proceedings of the STACS 2003, 20th Annual Symposium on Theoretical Aspects of Computer Science, Berlin, Germany, February 27, 2003

1999

J. ACM, 1999

Proceedings of the Algorithm Engineering, 1999

1998

SIAM J. Comput., 1998

Algorithmica, 1998

Proceedings of the Thirtieth Annual ACM Symposium on the Theory of Computing, 1998

1997

IEEE Trans. Software Eng., 1997

1996

Theor. Comput. Sci., 1996

J. Algorithms, 1996

J. Algorithms, 1996

1995

J. Algorithms, 1995

1994

J. Comput. Syst. Sci., 1994

J. Algorithms, 1994

Proceedings of the Algorithm Theory, 1994

1993

J. Comput. Syst. Sci., 1993

Proceedings of the 34th Annual Symposium on Foundations of Computer Science, 1993

1990

Proceedings of the 22nd Annual ACM Symposium on Theory of Computing, 1990

1989

Proceedings of the 21st Annual ACM Symposium on Theory of Computing, 1989

1987

J. Comput. Syst. Sci., 1987

J. ACM, 1987

1986

Algorithmica, 1986

1984

Inf. Control., December, 1984

J. ACM, 1984

1982

J. Algorithms, 1982

J. ACM, 1982

Proceedings of the 23rd Annual Symposium on Foundations of Computer Science, 1982

1981

Theor. Comput. Sci., 1981

IEEE Trans. Computers, 1981

SIAM J. Comput., 1981

J. Comput. Syst. Sci., 1981

J. Algorithms, 1981

J. ACM, 1981

1980

The Inherent Complexity of Dynamic Data Structures which Accommodate Range Queries

Proceedings of the 21st Annual Symposium on Foundations of Computer Science, 1980

1979

Proceedings of the 11h Annual ACM Symposium on Theory of Computing, April 30, 1979

1978

SIAM J. Comput., 1978

Commun. ACM, 1978

1976

Theor. Comput. Sci., 1976

SIAM J. Comput., 1976

1975

J. Comb. Theory, Ser. A, 1975

Discret. Math., 1975

Two Applications of a Probabilistic Search Technique: Sorting x + y and Building Balanced Search Trees

Proceedings of the 7th Annual ACM Symposium on Theory of Computing, 1975

Proceedings of the 16th Annual Symposium on Foundations of Computer Science, 1975