Michael L. Fredman

58 papers A* 16A 1B 1Journal 36Unranked 2

Year	Rank	Type	Title / Venue / Authors
2016	J	`jnl`	Comments on Dumitrescu's "A Selectable Sloppy Heap". CoRR Michael L. Fredman
2014	J	`jnl`	An intuitive and simple bounding argument for Quicksort. Inf. Process. Lett. Michael L. Fredman
2012	J	`jnl`	Generalizing a Theorem of Wilber on Rotations in Binary Search Trees to Encompass Unordered Binary Trees. Algorithmica Michael L. Fredman
2011	B	`conf`	On the Matter of Dynamic Optimality in an Extended Model for Tree Access Operations. WADS Michael L. Fredman
2008	J	`jnl`	Adaptive sorting: an information theoretic perspective. Acta Informatica Amr Elmasry, Michael L. Fredman
2005	J	`jnl`	Worst case constant time priority queue. J. Syst. Softw. Andrej Brodnik, Svante Carlsson, Michael L. Fredman, Johan Karlsson, J. Ian Munro
2004	—	`ch.`	Binomial, Fibonacci, and Pairing Heaps. Handbook of Data Structures and Applications Michael L. Fredman
2003	A	`conf`	Adaptive Sorting and the Information Theoretic Lower Bound. STACS Amr Elmasry, Michael L. Fredman
2003	J	`jnl`	The number of tests required to search an unordered table. Inf. Process. Lett. Michael L. Fredman
1999	—	`conf`	A Priority Queue Transform. WAE Michael L. Fredman
1999	J	`jnl`	On the Efficiency of Pairing Heaps and Related Data Structures. J. ACM Michael L. Fredman
1998	A*	`conf`	Information Theoretic Implications for Pairing Heaps. STOC Michael L. Fredman
1998	J	`jnl`	Lower Bounds for Fully Dynamic Connectivity Problems in Graphs. Algorithmica Monika Rauch Henzinger, Michael L. Fredman
1998	J	`jnl`	Optimal Biweighted Binary Trees and the Complexity of Maintaining Partial Sums. SIAM J. Comput. Haripriyan Hampapuram, Michael L. Fredman
1997	J	`jnl`	The AETG System: An Approach to Testing Based on Combinatiorial Design. IEEE Trans. Software Eng. David M. Cohen, Siddhartha R. Dalal, Michael L. Fredman, Gardner C. Patton
1996	J	`jnl`	On the Complexity of Dualization of Monotone Disjunctive Normal Forms. J. Algorithms Michael L. Fredman, Leonid Khachiyan
1996	J	`jnl`	Products of Finite State Machines with Full Coverage. Theor. Comput. Sci. David M. Cohen, Michael L. Fredman
1996	J	`jnl`	Weighted Binary Trees for Concurrent Searching. J. Algorithms David M. Cohen, Michael L. Fredman
1995	J	`jnl`	Data Structures for Traveling Salesmen. J. Algorithms Michael L. Fredman, David S. Johnson, Lyle A. McGeoch, G. Ostheimer
1994	—	`conf`	Lower Bounds for Dynamic Algorithms. SWAT Michael L. Fredman
1994	J	`jnl`	Three Stacks. J. Algorithms Michael L. Fredman, Deborah L. Goldsmith
1994	J	`jnl`	Trans-Dichotomous Algorithms for Minimum Spanning Trees and Shortest Paths. J. Comput. Syst. Sci. Michael L. Fredman, Dan E. Willard
1993	A*	`conf`	Data Structures for Traveling Salesmen. SODA Michael L. Fredman, David S. Johnson, Lyle A. McGeoch, G. Ostheimer
1993	A*	`conf`	Optimal Bi-Weighted Binary Trees and the Complexity of Maintaining Partial Sums FOCS Haripriyan Hampapuram, Michael L. Fredman
1993	A*	`conf`	Products of Finite State Machines with Full Coverage. ICALP David M. Cohen, Michael L. Fredman
1993	J	`jnl`	Surpassing the Information Theoretic Bound with Fusion Trees. J. Comput. Syst. Sci. Michael L. Fredman, Dan E. Willard
1990	A*	`conf`	BLASTING through the Information Theoretic Barrier with FUSION TREES STOC Michael L. Fredman, Dan E. Willard
1990	A*	`conf`	Trans-dichotomous Algorithms for Minimum Spanning Trees and Shortest Paths FOCS Michael L. Fredman, Dan E. Willard
1989	A*	`conf`	The Cell Probe Complexity of Dynamic Data Structures STOC Michael L. Fredman, Michael E. Saks
1988	A*	`conf`	Three Stacks FOCS Michael L. Fredman, Deborah L. Goldsmith
1987	J	`jnl`	Fibonacci heaps and their uses in improved network optimization algorithms. J. ACM Michael L. Fredman, Robert Endre Tarjan
1987	J	`jnl`	Refined Complexity Analysis for Heap Operations. J. Comput. Syst. Sci. Michael L. Fredman, Thomas H. Spencer
1986	J	`jnl`	The Pairing Heap: A New Form of Self-Adjusting Heap. Algorithmica Michael L. Fredman, Robert Sedgewick, Daniel Dominic Sleator, Robert Endre Tarjan
1984	A*	`conf`	Fibonacci Heaps and Their Uses in Improved Network Optimization Algorithms FOCS Michael L. Fredman, Robert Endre Tarjan
1984	J	`jnl`	Hash Functions for Priority Queues Inf. Control. Miklós Ajtai, Michael L. Fredman, János Komlós
1984	J	`jnl`	Storing a Sparse Table with 0(1) Worst Case Access Time. J. ACM Michael L. Fredman, János Komlós, Endre Szemerédi
1983	A*	`conf`	Hash Functions for Priority Queues FOCS Miklós Ajtai, Michael L. Fredman, János Komlós
1983	A*	`ed.`	Proceedings of the 15th Annual ACM Symposium on Theory of Computing, 25-27 April, 1983, Boston, Massachusetts, USA STOC 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
1982	A*	`conf`	Storing a Sparse Table with O(1) Worst Case Access Time FOCS Michael L. Fredman, János Komlós, Endre Szemerédi
1982	J	`jnl`	The Complexity of Maintaining an Array and Computing Its Partial Sums. J. ACM Michael L. Fredman
1982	J	`jnl`	The Complexity of Partial Match Retrieval in a Dynamic Setting. J. Algorithms Michael L. Fredman, Dennis J. Volper
1981	J	`jnl`	A Lower Bound on the Complexity of Orthogonal Range Queries. J. ACM Michael L. Fredman
1981	J	`jnl`	Inherent Complexity Trade-Offs for Range Query Problems. Theor. Comput. Sci. Walter A. Burkhard, Michael L. Fredman, Daniel J. Kleitman
1981	J	`jnl`	Lower Bounds on the Complexity of Some Optimal Data Structures. SIAM J. Comput. Michael L. Fredman
1981	J	`jnl`	Observations Concerning the Complexity of a Class of On-Line Algebraic Problems. IEEE Trans. Computers Michael L. Fredman
1981	J	`jnl`	Query Time Versus Redundancy Trade-Offs for Range Queries. J. Comput. Syst. Sci. Michael L. Fredman, Dennis J. Volper
1981	J	`jnl`	The Spanning Bound as a Measure of Range Query Complexity. J. Algorithms Michael L. Fredman
1980	A*	`conf`	The Inherent Complexity of Dynamic Data Structures which Accommodate Range Queries FOCS Michael L. Fredman
1979	A*	`conf`	A Near Optimal Data Structure for a Type of Range Query Problem STOC Michael L. Fredman
1978	J	`jnl`	Observations on the Complexity of Generating Quasi-Gray Codes. SIAM J. Comput. Michael L. Fredman
1978	J	`jnl`	On the Complexity of Computing the Measure of U[ai, bi]. Commun. ACM Michael L. Fredman, Bruce W. Weide
1976	J	`jnl`	How Good is the Information Theory Bound in Sorting? Theor. Comput. Sci. Michael L. Fredman
1976	J	`jnl`	New Bounds on the Complexity of the Shortest Path Problem. SIAM J. Comput. Michael L. Fredman
1975	J	`jnl`	A Symmetry Relationship for a Class of Partitions. J. Comb. Theory A Michael L. Fredman
1975	J	`jnl`	On computing the length of longest increasing subsequences. Discret. Math. Michael L. Fredman
1975	A*	`conf`	On the Decision Tree Complexity of the Shortest Path Problems FOCS Michael L. Fredman
1975	A*	`conf`	Two Applications of a Probabilistic Search Technique: Sorting x + y and Building Balanced Search Trees STOC Michael L. Fredman
1972	—	`—`	Growth properties of a class of recursively defined functions. Michael L. Fredman