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="Sedgewick, R."
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Domain architecture in homolog identification
N. Song
,
R.D. Sedgewick
,
D. Durand
LNCS/LNBI
4205
, 2006, pp. 11-23
Tight lower bounds for shellsort
M.A. Weiss
,
R. Sedgewick
Lecture Notes in Computer Science
318
, 1988, pp. 255-262
Practical variations of Shellsort
J. Incerpi
,
R. Sedgewick
Information Processing Letters
26
(1), 1987, September, pp. 37-43
Digital search trees revisited
P. Flajolet
,
R. Sedgewick
SIAM Journal on Computing
15
(3), 1986, August, pp. 748-767
A new upper bound for Shellsort
R. Sedgewick
Journal of Algorithms
7
(2), 1986, June, pp. 159-173
The pairing heap: a new form of self-adjusting heap
M. Fredman
,
R. Sedgewick
,
D. Sleator
,
R. Tarjan
Technical Report (CS-TR-008-85), 1985, July
Improved upper bounds on Shellsort
J. Incerpi
,
R. Sedgewick
Journal of Computer and System Sciences
31
(2), 1985, October, pp. 210-224
Shortest paths in Euclidean graphs
R. Sedgewick
,
J.S. Vitter
Proceedings of the 25th Annual IEEE Symposium on Foundations of Computer Science, FOCS'84 (Singer Island, FL, October 24-26, 1984)
, 1984, pp. 417-424
Improved upper bounds on shellsort
J. Incerpi
,
R. Sedgewick
Proceedings of the 24th Annual IEEE Symposium on Foundations of Computer Science, FOCS'83 (Tucson, AZ, November 7-9, 1983)
, 1983, pp. 48-55
Notes on merging networks
Z. Hong
,
R. Sedgewick
Proceedings of the 14th Annual ACM Symposium on Theory of Computing, STOC'82 (San Francisco, CA, May 5-7, 1982)
, 1982, pp. 296-302
The complexity of finding cycles in periodic functions
R. Sedgewick
,
T.G. Szymanski
,
A.C. Yao
SIAM Journal on Computing
11
(2), 1982, May, pp. 376-390
Lower bounds for VLSI
R.J. Lipton
,
R. Sedgewick
Proceedings of the 13th Annual ACM Symposium on Theory of Computing, STOC'81 (Milwaukee, WI, May 11-13, 1981)
, 1981, pp. 300-307
The complexity of finding periods
R. Sedgewick
,
T.G. Szymanski
Proceedings of the 11th Annual ACM Symposium on Theory of Computing, STOC'79 (Atlanta, GA, April 30 - May 2, 1979)
, 1979, pp. 74-80
A dichromatic framework for balanced trees
L.J. Guibas
,
R. Sedgewick
Proceedings of the 19th Annual IEEE Symposium on Foundations of Computer Science, FOCS'78 (Ann Arbor, MI, October 16-18, 1978)
, 1978, pp. 8-21
Quicksort with equal keys
R. Sedgewick
SIAM Journal on Computing
6
(2), 1977, June, pp. 240-267
The analysis of quicksort programs
R. Sedgewick
Acta Informatica
7
(4), 1977, pp. 327-355