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="Reingold, Edward"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Analysis of Boyer and Moore's
mjrty
algorithm
Laurent Alonso
,
Edward M. Reingold
Information Processing Letters
113
(13), 2013, pp. 495-497
The worst-case chip problem
Laurent Alonso
,
Philippe Chassaing
,
Edward M. Reingold
,
René Schott
Information Processing Letters
89
(6), 2004, pp. 303-308
A potential-based amortized analysis of the union-find data structure
Gregory C. Harfst
,
Edward M. Reingold
ACM SIGACT News
31
(3), 2000, September, pp. 86-95
Optimal multichannel communication under failure
Tanya Y. Berger-Wolf
,
Edward M. Reingold
Proceedings of the 10th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA'99 (Baltimore, Maryland, January 17-19, 1999)
, 1999, pp. 858-859
Algorithm design and analysis techniques
Edward M. Reingold
Algorithms and Theory of Computation Handbook, 1999, pp. 1-1 - 1-27
The average-case complexity of determining the majority
Laurent Alonso
,
Edward M. Reingold
,
René Schott
SIAM Journal on Computing
26
(1), 1997, pp. 1-14
K-M-P string matching revisited
Edward M. Reingold
,
Kenneth J. Urban
,
David Gries
Information Processing Letters
64
(5), 1997, pp. 217-223
Generalized Kraft's inequality and discrete
k
-modal search
Anmol Mathur
,
Edward M. Reingold
SIAM Journal on Computing
25
(2), 1996, pp. 420-447
Multidimensional divide-and-conquer maximin recurrences
Laurent Alonso
,
Edward M. Reingold
,
René Schott
SIAM Journal on Discrete Mathematics
8
(3), 1995, pp. 428-447
The complexity of pursuit on a graph
Arthur S. Goldstein
,
Edward M. Reingold
Theoretical Computer Science
143
(1), 1995, pp. 93-112
Mathematical games: The complexity of pursuit on a graph
Arthur S. Goldstein
,
Edward M. Reingold
Theoretical Computer Science
143
(1), 1995, pp. 93-112
Efficient management of dynamic tables
Aviezri S. Fraenkel
,
Edward M. Reingold
,
Prashant Saxena
Information Processing Letters
50
, 1994, pp. 25-30
Determining the majority
Laurent Alonso
,
Edward M. Reingold
,
René Schott
Information Processing Letters
47
(5), 1993, pp. 253-255
A Fibonacci version of Kraft's inequality applied to discrete unimodal search
Arthur S. Goldstein
,
Edward M. Reingold
SIAM Journal on Computing
22
(4), 1993, August, pp. 751-777
Stochastic rearrangement rules for self-organizing data structures
Sanjiv Kapoor
,
Edward M. Reingold
Algorithmica
6
(2), 1991, pp. 278-291
More nearly optimal algorithms for unbounded searching, Part II: The transfinite case
Edward M. Reingold
,
Xiajun Shen
SIAM Journal on Computing
20
(1), 1991, February, pp. 184-208
More nearly optimal algorithms for unbounded searching. Part I: The finite case
Edward M. Reingold
,
Xiaojun Shen
SIAM Journal on Computing
20
(1), 1991, February, pp. 156-183
Scheduling on a hypercube
Xiaojun Shen
,
Edward M. Reingold
Information Processing Letters
40
, 1991, pp. 323-328
Probabilistic analysis of a grouping algorithm
D.F. Wong
,
Edward M. Reingold
Algorithmica
6
(2), 1991, pp. 192-206
Optimum lopsided binary trees
Sanjiv Kapoor
,
Edward M. Reingold
Journal of the ACM
36
(3), 1989, July, pp. 573-590
Solution of a divide-and-conquer maximin recurrence
Zhiyuan Li
,
Edward M. Reingold
SIAM Journal on Computing
18
, 1989, pp. 1188-1200
Probabilistic analysis of divide-and-conquer heuristics for minimum weighted Euclidean matching
Edward Reingold
,
Kenneth Supowit
Networks
13
, 1983, pp. 49-66
On a greedy heuristic for complete matching
Edward M. Reingold
,
Robert E. Tarjan
SIAM Journal on Computing
10
(4), 1981, November, pp. 676-681
Understanding the complexity of interpolation search
Yehoshua Perl
,
Edward M. Reingold
Information Processing Letters
6
, 1976, December, pp. 219-222
On the time required to detect cycles and connectivity in graphs
Richard C. Holt
,
Edward M. Reingold
Math. Systems Theory
6
, 1972/73, pp. 103-106
Seiten 1
2
>