Michael L. Fredman

	2012
53		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
52		Michael L. Fredman: On the Matter of Dynamic Optimality in an Extended Model for Tree Access Operations. WADS 2011: 423-437
	2008
51		Amr Elmasry, Michael L. Fredman: Adaptive sorting: an information theoretic perspective. Acta Inf. 45(1): 33-42 (2008)
	2005
50		Andrej Brodnik, Svante Carlsson, Michael L. Fredman, Johan Karlsson, J. Ian Munro: Worst case constant time priority queue. Journal of Systems and Software 78(3): 249-256 (2005)
	2003
49		Amr Elmasry, Michael L. Fredman: Adaptive Sorting and the Information Theoretic Lower Bound. STACS 2003: 654-662
48		Michael L. Fredman: The number of tests required to search an unordered table. Inf. Process. Lett. 87(2): 85-88 (2003)
	1999
47		Michael L. Fredman: A Priority Queue Transform. Algorithm Engineering 1999: 244-258
46		Michael L. Fredman: On the Efficiency of Pairing Heaps and Related Data Structures. J. ACM 46(4): 473-501 (1999)
	1998
45		Michael L. Fredman: Information Theoretic Implications for Pairing Heaps. STOC 1998: 319-326
44		Monika Rauch Henzinger, Michael L. Fredman: Lower Bounds for Fully Dynamic Connectivity Problems in Graphs. Algorithmica 22(3): 351-362 (1998)
43		Haripriyan Hampapuram, Michael L. Fredman: Optimal Biweighted Binary Trees and the Complexity of Maintaining Partial Sums. SIAM J. Comput. 28(1): 1-9 (1998)
	1997
42		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
41		David M. Cohen, Michael L. Fredman: Weighted Binary Trees for Concurrent Searching. J. Algorithms 20(1): 87-112 (1996)
40		Michael L. Fredman, Leonid Khachiyan: On the Complexity of Dualization of Monotone Disjunctive Normal Forms. J. Algorithms 21(3): 618-628 (1996)
39		David M. Cohen, Michael L. Fredman: Products of Finite State Machines with Full Coverage. Theor. Comput. Sci. 154(1): 57-65 (1996)
	1995
38		Michael L. Fredman, David S. Johnson, Lyle A. McGeoch, G. Ostheimer: Data Structures for Traveling Salesmen. J. Algorithms 18(3): 432-479 (1995)
	1994
37		Michael L. Fredman: Lower Bounds for Dynamic Algorithms. SWAT 1994: 167-171
36		Michael L. Fredman, Deborah L. Goldsmith: Three Stacks. J. Algorithms 17(1): 44-70 (1994)
35		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)
	1993
34		Haripriyan Hampapuram, Michael L. Fredman: Optimal Bi-Weighted Binary Trees and the Complexity of Maintaining Partial Sums FOCS 1993: 480-485
33		David M. Cohen, Michael L. Fredman: Products of Finite State Machines with Full Coverage. ICALP 1993: 469-477
32		Michael L. Fredman, David S. Johnson, Lyle A. McGeoch, G. Ostheimer: Data Structures for Traveling Salesmen. SODA 1993: 145-154
31		Michael L. Fredman, Dan E. Willard: Surpassing the Information Theoretic Bound with Fusion Trees. J. Comput. Syst. Sci. 47(3): 424-436 (1993)
	1990
30		Michael L. Fredman, Dan E. Willard: Trans-dichotomous Algorithms for Minimum Spanning Trees and Shortest Paths FOCS 1990: 719-725
29		Michael L. Fredman, Dan E. Willard: BLASTING through the Information Theoretic Barrier with FUSION TREES STOC 1990: 1-7
	1989
28		Michael L. Fredman, Michael E. Saks: The Cell Probe Complexity of Dynamic Data Structures STOC 1989: 345-354
	1988
27		Michael L. Fredman, Deborah L. Goldsmith: Three Stacks FOCS 1988: 514-523
	1987
26		Michael L. Fredman, Robert Endre Tarjan: Fibonacci heaps and their uses in improved network optimization algorithms. J. ACM 34(3): 596-615 (1987)
25		Michael L. Fredman, Thomas H. Spencer: Refined Complexity Analysis for Heap Operations. J. Comput. Syst. Sci. 35(3): 269-284 (1987)
	1986
24		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
23		Michael L. Fredman, Robert Endre Tarjan: Fibonacci Heaps and Their Uses in Improved Network Optimization Algorithms FOCS 1984: 338-346
22		Miklós Ajtai, Michael L. Fredman, János Komlós: Hash Functions for Priority Queues Information and Control 63(3): 217-225 (1984)
21		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)
	1983
20		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
19		Miklós Ajtai, Michael L. Fredman, János Komlós: Hash Functions for Priority Queues FOCS 1983: 299-303
	1982
18		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
17		Michael L. Fredman: The Complexity of Maintaining an Array and Computing Its Partial Sums. J. ACM 29(1): 250-260 (1982)
16		Michael L. Fredman, Dennis J. Volper: The Complexity of Partial Match Retrieval in a Dynamic Setting. J. Algorithms 3(1): 68-78 (1982)
	1981
15		Michael L. Fredman: Observations Concerning the Complexity of a Class of On-Line Algebraic Problems. IEEE Trans. Computers 30(1): 83-86 (1981)
14		Michael L. Fredman: A Lower Bound on the Complexity of Orthogonal Range Queries. J. ACM 28(4): 696-705 (1981)
13		Michael L. Fredman: The Spanning Bound as a Measure of Range Query Complexity. J. Algorithms 2(1): 77-87 (1981)
12		Michael L. Fredman, Dennis J. Volper: Query Time Versus Redundancy Trade-Offs for Range Queries. J. Comput. Syst. Sci. 23(3): 355-365 (1981)
11		Michael L. Fredman: Lower Bounds on the Complexity of Some Optimal Data Structures. SIAM J. Comput. 10(1): 1-10 (1981)
10		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
9		Michael L. Fredman: The Inherent Complexity of Dynamic Data Structures which Accommodate Range Queries FOCS 1980: 191-199
	1979
8		Michael L. Fredman: A Near Optimal Data Structure for a Type of Range Query Problem STOC 1979: 62-66
	1978
7		Michael L. Fredman, Bruce W. Weide: On the Complexity of Computing the Measure of U[ai, bi]. Commun. ACM 21(7): 540-544 (1978)
6		Michael L. Fredman: Observations on the Complexity of Generating Quasi-Gray Codes. SIAM J. Comput. 7(2): 134-146 (1978)
	1976
5		Michael L. Fredman: New Bounds on the Complexity of the Shortest Path Problem. SIAM J. Comput. 5(1): 83-89 (1976)
4		Michael L. Fredman: How Good is the Information Theory Bound in Sorting? Theor. Comput. Sci. 1(4): 355-361 (1976)
	1975
3		Michael L. Fredman: On the Decision Tree Complexity of the Shortest Path Problems FOCS 1975: 98-99
2		Michael L. Fredman: Two Applications of a Probabilistic Search Technique: Sorting x + y and Building Balanced Search Trees STOC 1975: 240-244
1		Michael L. Fredman: A Symmetry Relationship for a Class of Partitions. J. Comb. Theory, Ser. A 18(2): 199-202 (1975)

Coauthor Index

1	Miklós Ajtai	[19] [22]
2	Andrej Brodnik	[50]
3	Walter A. Burkhard	[10]
4	Svante Carlsson	[50]
5	David M. Cohen	[33] [39] [41] [42]
6	Siddhartha R. Dalal	[42]
7	Amr Elmasry	[49] [51]
8	Ronald Fagin	[20]
9	Deborah L. Goldsmith	[27] [36]
10	Haripriyan Hampapuram	[34] [43]
11	David Harel	[20]
12	Monika Rauch Henzinger (Monika Henzinger, Monika Rauch)	[44]
13	David S. Johnson	[20] [32] [38]
14	Johan Karlsson	[50]
15	Richard M. Karp	[20]
16	Leonid Khachiyan (Leonid G. Khachiyan)	[40]
17	Daniel J. Kleitman	[10]
18	János Komlós	[18] [19] [21] [22]
19	Nancy A. Lynch	[20]
20	Lyle A. McGeoch	[32] [38]
21	J. Ian Munro	[50]
22	G. Ostheimer	[32] [38]
23	Christos H. Papadimitriou	[20]
24	Gardner C. Patton	[42]
25	Ronald L. Rivest	[20]
26	Walter L. Ruzzo	[20]
27	Michael E. Saks (Michael Saks)	[28]
28	Robert Sedgewick (Bob Sedgewick)	[24]
29	Joel I. Seiferas	[20]
30	Daniel Dominic Sleator	[24]
31	Thomas H. Spencer	[25]
32	Endre Szemerédi	[18] [21]
33	Robert Endre Tarjan	[23] [24] [26]
34	Dennis J. Volper	[12] [16]
35	Bruce W. Weide	[7]
36	Dan E. Willard	[29] [30] [31] [35]

Colors in the list of coauthors

Last update Fri May 25 01:42:58 2012 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page