Fakultät für Informatik
-
Technische Universität München
Lehrstuhl für Effiziente Algorithmen
Die bibliographische Datenbank LEABib
Suchen
•
Liste der Journale
•
Liste der Serien
•
Liste der Konferenzen
•
Ausgewählte Publikationen
Hilfe
Suche: Author="Fredman, Michael L."
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
An intuitive and simple bounding argument for Quicksort
Michael L. Fredman
Information Processing Letters
114
(3), 2014, pp. 137-139
Generalizing a theorem of Wilber on rotations in binary search trees to encompass unordered binary trees
Michael L. Fredman
Algorithmica
62
(3-4), 2012, pp. 863-878
On the matter of dynamic optimality in an extended model for tree access operations
Michael L. Fredman
Lecture Notes in Computer Science
6844
, 2011, pp. 423-437
Adaptive sorting: An information theoretic perspective
Amr Elmasry
,
Michael L. Fredman
Acta Informatica
45
(1), 2008, pp. 33-42
Adaptive sorting and the information theoretic lower bound
Amr Elmasry
,
Michael L. Fredman
Lecture Notes in Computer Science
2607
, 2003, pp. 654-662
The number of tests required to search an unordered table
Michael L. Fredman
Information Processing Letters
87
(2), 2003, pp. 85-88
On the efficiency of pairing heaps and related data structures
Michael L. Fredman
Journal of the ACM
46
(4), 1999, pp. 473-501
A priority queue transform
Michael L. Fredman
Lecture Notes in Computer Science
1668
, 1999, pp. 243-257
Information theoretic implications for pairing heaps
Michael L. Fredman
Proceedings of the 30th Annual ACM Symposium on Theory of Computing, STOC'98 (Dallas, Texas, May 23-26, 1998)
, 1998, pp. 319-326
Optimal biweighted binary trees and the complexity of maintaining partial sums
Haripriyan Hampapuram
,
Michael L. Fredman
SIAM Journal on Computing
28
(1), 1998, pp. 1-9
Weighted binary trees for concurrent searching
David Cohen
,
Michael L. Fredman
Journal of Algorithms
20
(1), 1996, pp. 87-112
Products of finite state machines with full coverage
David M. Cohen
,
Michael L. Fredman
Theoretical Computer Science
154
(1), 1996, pp. 57-65
On the complexity of dualization of monotone disjunctive normal forms
Michael L. Fredman
,
Leonid Khachiyan
Journal of Algorithms
21
(3), 1996, pp. 618-628
Trans-dichotomous algorithms for minimum spanning trees and shortest paths
Michael L. Fredman
,
Dan E. Willard
Journal of Computer and System Sciences
48
(3), 1994, pp. 533-551
Lower bounds for dynamic algorithms
Michael L. Fredman
Proceedings of the 4th Scandinavian Workshop on Algorithm Theory - SWAT '94 (Aarhus, Denmark, July 6-8, 1994)
LNCS 824
, 1994, pp. 167-171
Products of finite state machines with full coverage
David M. Cohen
,
Michael L. Fredman
Lecture Notes in Computer Science
700
, 1993, pp. 469-477
Surpassing the information theoretic bound with fusion trees
Michael L. Fredman
,
Dan E. Willard
Journal of Computer and System Sciences
47
(3), 1993, pp. 424-436
Optimal bi-weighted binary trees and the complexity of maintaining partial sums
Haripriyan Hampapuram
,
Michael L. Fredman
Proceedings of the 34th Annual IEEE Symposium on Foundations of Computer Science, FOCS'93 (Palo Alto, CA, November 3-5, 1993)
, 1993, pp. 480-485
Refined complexity analysis for heap operations
Michael L. Fredman
,
Thomas H. Spencer
Journal of Computer and System Sciences
35
(3), 1987, December, pp. 269-284
Fibonacci heaps and their uses in improved network optimization algorithms
Michael L. Fredman
,
Robert Endre Tarjan
Journal of the ACM
34
(3), 1987, July, pp. 596-615
The pairing heap: A new form of self-adjusting heap
Michael L. Fredman
,
Robert Sedgewick
,
Daniel D. Sleator
,
Robert E. Tarjan
Algorithmica
1
(1), 1986, pp. 111-129
On computing the length of longest increasing subsequences
Michael L. Fredman
Discrete Mathematics
11
, 1975, pp. 29-35
A symmetry relationship for a class of partitions
Michael L. Fredman
Journal of Combinatorial Theory Series A
18
, 1975, pp. 199-202