default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMichael L. Fredman
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2016
[i1]Michael L. Fredman:
Comments on Dumitrescu's "A Selectable Sloppy Heap". CoRR abs/1610.02953 (2016)- 2014
- [j35]Michael L. Fredman:
An intuitive and simple bounding argument for Quicksort. Inf. Process. Lett. 114(3): 137-139 (2014) - 2012
- [j34]Michael L. Fredman:
Generalizing a Theorem of Wilber on Rotations in Binary Search Trees to Encompass Unordered Binary Trees. Algorithmica 62(3-4): 863-878 (2012) - 2011
- [c19]Michael L. Fredman:
On the Matter of Dynamic Optimality in an Extended Model for Tree Access Operations. WADS 2011: 423-437
2000 – 2009
- 2008
- [j33]Amr Elmasry, Michael L. Fredman:
Adaptive sorting: an information theoretic perspective. Acta Informatica 45(1): 33-42 (2008) - 2005
- [j32]Andrej Brodnik
, Svante Carlsson, Michael L. Fredman, Johan Karlsson, J. Ian Munro:
Worst case constant time priority queue. J. Syst. Softw. 78(3): 249-256 (2005) - 2004
- [r1]Michael L. Fredman:
Binomial, Fibonacci, and Pairing Heaps. Handbook of Data Structures and Applications 2004 - 2003
- [j31]Michael L. Fredman:
The number of tests required to search an unordered table. Inf. Process. Lett. 87(2): 85-88 (2003) - [c18]Amr Elmasry, Michael L. Fredman:
Adaptive Sorting and the Information Theoretic Lower Bound. STACS 2003: 654-662
1990 – 1999
- 1999
- [j30]Michael L. Fredman:
On the Efficiency of Pairing Heaps and Related Data Structures. J. ACM 46(4): 473-501 (1999) - [c17]Michael L. Fredman:
A Priority Queue Transform. WAE 1999: 244-258 - 1998
- [j29]Monika Rauch Henzinger, Michael L. Fredman:
Lower Bounds for Fully Dynamic Connectivity Problems in Graphs. Algorithmica 22(3): 351-362 (1998) - [j28]Haripriyan Hampapuram, Michael L. Fredman:
Optimal Biweighted Binary Trees and the Complexity of Maintaining Partial Sums. SIAM J. Comput. 28(1): 1-9 (1998) - [c16]Michael L. Fredman:
Information Theoretic Implications for Pairing Heaps. STOC 1998: 319-326 - 1997
- [j27]David M. Cohen, Siddhartha R. Dalal, Michael L. Fredman, Gardner C. Patton:
The AETG System: An Approach to Testing Based on Combinatiorial Design. IEEE Trans. Software Eng. 23(7): 437-444 (1997) - 1996
- [j26]David M. Cohen, Michael L. Fredman:
Weighted Binary Trees for Concurrent Searching. J. Algorithms 20(1): 87-112 (1996) - [j25]Michael L. Fredman, Leonid Khachiyan:
On the Complexity of Dualization of Monotone Disjunctive Normal Forms. J. Algorithms 21(3): 618-628 (1996) - [j24]David M. Cohen, Michael L. Fredman:
Products of Finite State Machines with Full Coverage. Theor. Comput. Sci. 154(1): 57-65 (1996) - 1995
- [j23]Michael L. Fredman, David S. Johnson, Lyle A. McGeoch, G. Ostheimer:
Data Structures for Traveling Salesmen. J. Algorithms 18(3): 432-479 (1995) - 1994
- [j22]Michael L. Fredman, Deborah L. Goldsmith:
Three Stacks. J. Algorithms 17(1): 44-70 (1994) - [j21]Michael L. Fredman, Dan E. Willard:
Trans-Dichotomous Algorithms for Minimum Spanning Trees and Shortest Paths. J. Comput. Syst. Sci. 48(3): 533-551 (1994) - [c15]Michael L. Fredman:
Lower Bounds for Dynamic Algorithms. SWAT 1994: 167-171 - 1993
- [j20]Michael L. Fredman, Dan E. Willard:
Surpassing the Information Theoretic Bound with Fusion Trees. J. Comput. Syst. Sci. 47(3): 424-436 (1993) - [c14]Haripriyan Hampapuram, Michael L. Fredman:
Optimal Bi-Weighted Binary Trees and the Complexity of Maintaining Partial Sums. FOCS 1993: 480-485 - [c13]David M. Cohen, Michael L. Fredman:
Products of Finite State Machines with Full Coverage. ICALP 1993: 469-477 - [c12]Michael L. Fredman, David S. Johnson, Lyle A. McGeoch, G. Ostheimer:
Data Structures for Traveling Salesmen. SODA 1993: 145-154 - 1990
- [c11]Michael L. Fredman, Dan E. Willard:
Trans-dichotomous Algorithms for Minimum Spanning Trees and Shortest Paths. FOCS 1990: 719-725 - [c10]Michael L. Fredman, Dan E. Willard:
BLASTING through the Information Theoretic Barrier with FUSION TREES. STOC 1990: 1-7
1980 – 1989
- 1989
- [c9]Michael L. Fredman, Michael E. Saks:
The Cell Probe Complexity of Dynamic Data Structures. STOC 1989: 345-354 - 1988
- [c8]Michael L. Fredman, Deborah L. Goldsmith:
Three Stacks. FOCS 1988: 514-523 - 1987
- [j19]Michael L. Fredman, Robert Endre Tarjan:
Fibonacci heaps and their uses in improved network optimization algorithms. J. ACM 34(3): 596-615 (1987) - [j18]Michael L. Fredman, Thomas H. Spencer:
Refined Complexity Analysis for Heap Operations. J. Comput. Syst. Sci. 35(3): 269-284 (1987) - 1986
- [j17]Michael L. Fredman, Robert Sedgewick, Daniel Dominic Sleator, Robert Endre Tarjan:
The Pairing Heap: A New Form of Self-Adjusting Heap. Algorithmica 1(1): 111-129 (1986) - 1984
- [j16]Miklós Ajtai, Michael L. Fredman, János Komlós:
Hash Functions for Priority Queues. Inf. Control. 63(3): 217-225 (1984) - [j15]Michael L. Fredman, János Komlós, Endre Szemerédi:
Storing a Sparse Table with 0(1) Worst Case Access Time. J. ACM 31(3): 538-544 (1984) - [c7]Michael L. Fredman, Robert Endre Tarjan:
Fibonacci Heaps and Their Uses in Improved Network Optimization Algorithms. FOCS 1984: 338-346 - 1983
- [c6]Miklós Ajtai, Michael L. Fredman, János Komlós:
Hash Functions for Priority Queues. FOCS 1983: 299-303 - [e1]David S. Johnson, Ronald Fagin, Michael L. Fredman, David Harel, Richard M. Karp, Nancy A. Lynch, Christos H. Papadimitriou, Ronald L. Rivest, Walter L. Ruzzo, Joel I. Seiferas:
Proceedings of the 15th Annual ACM Symposium on Theory of Computing, 25-27 April, 1983, Boston, Massachusetts, USA. ACM 1983 [contents] - 1982
- [j14]Michael L. Fredman:
The Complexity of Maintaining an Array and Computing Its Partial Sums. J. ACM 29(1): 250-260 (1982) - [j13]Michael L. Fredman, Dennis J. Volper:
The Complexity of Partial Match Retrieval in a Dynamic Setting. J. Algorithms 3(1): 68-78 (1982) - [c5]Michael L. Fredman, János Komlós, Endre Szemerédi:
Storing a Sparse Table with O(1) Worst Case Access Time. FOCS 1982: 165-169 - 1981
- [j12]Michael L. Fredman:
A Lower Bound on the Complexity of Orthogonal Range Queries. J. ACM 28(4): 696-705 (1981) - [j11]Michael L. Fredman:
The Spanning Bound as a Measure of Range Query Complexity. J. Algorithms 2(1): 77-87 (1981) - [j10]Michael L. Fredman, Dennis J. Volper:
Query Time Versus Redundancy Trade-Offs for Range Queries. J. Comput. Syst. Sci. 23(3): 355-365 (1981) - [j9]Michael L. Fredman:
Lower Bounds on the Complexity of Some Optimal Data Structures. SIAM J. Comput. 10(1): 1-10 (1981) - [j8]Michael L. Fredman:
Observations Concerning the Complexity of a Class of On-Line Algebraic Problems. IEEE Trans. Computers 30(1): 83-86 (1981) - [j7]Walter A. Burkhard, Michael L. Fredman, Daniel J. Kleitman:
Inherent Complexity Trade-Offs for Range Query Problems. Theor. Comput. Sci. 16: 279-290 (1981) - 1980
- [c4]Michael L. Fredman:
The Inherent Complexity of Dynamic Data Structures which Accommodate Range Queries. FOCS 1980: 191-199
1970 – 1979
- 1979
- [c3]Michael L. Fredman:
A Near Optimal Data Structure for a Type of Range Query Problem. STOC 1979: 62-66 - 1978
- [j6]Michael L. Fredman, Bruce W. Weide:
On the Complexity of Computing the Measure of U[ai, bi]. Commun. ACM 21(7): 540-544 (1978) - [j5]Michael L. Fredman:
Observations on the Complexity of Generating Quasi-Gray Codes. SIAM J. Comput. 7(2): 134-146 (1978) - 1976
- [j4]Michael L. Fredman:
New Bounds on the Complexity of the Shortest Path Problem. SIAM J. Comput. 5(1): 83-89 (1976) - [j3]Michael L. Fredman:
How Good is the Information Theory Bound in Sorting? Theor. Comput. Sci. 1(4): 355-361 (1976) - 1975
- [j2]Michael L. Fredman:
On computing the length of longest increasing subsequences. Discret. Math. 11(1): 29-35 (1975) - [j1]Michael L. Fredman:
A Symmetry Relationship for a Class of Partitions. J. Comb. Theory A 18(2): 199-202 (1975) - [c2]Michael L. Fredman:
On the Decision Tree Complexity of the Shortest Path Problems. FOCS 1975: 98-99 - [c1]Michael L. Fredman:
Two Applications of a Probabilistic Search Technique: Sorting x + y and Building Balanced Search Trees. STOC 1975: 240-244 - 1972
- [b1]Michael L. Fredman:
Growth properties of a class of recursively defined functions. Stanford University, USA, 1972
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-06-10 20:30 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
