The SCEAS System
Navigation Menu
Introduction
Collection Based
Clustering
Ranking
Paper Based
Journals
Conferences
DB Status
Statistics
Search

Search the dblp DataBase

Title:
Author:
Michael L. Fredman: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

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

  50. Adaptive sorting: an information theoretic perspective. [Citation Graph (, )][DBLP]


Search in 0.004secs, Finished in 0.007secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
Introduction Collection Based Clustering Ranking Paper Based Journals Conferences DB Status Statistics Search
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002