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: Journal=J. Algorithms AND Volume=44
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Quicksort asymptotics
James Allen Fill
,
Svante Janson
Journal of Algorithms
44
(1), 2002, pp. 4-28
Reflected Brownian bridge area conditioned on its local time at the origin
Philippe Chaissaing
,
Guy Louchard
Journal of Algorithms
44
(1), 2002, pp. 29-51
Rates of convergence for Quicksort
Ralph Neininger
,
Ludger Rüschendorf
Journal of Algorithms
44
(1), 2002, pp. 52-62
Limit laws for the height in PATRICIA tries
Charles Knessl
,
Wojciech Szpankowski
Journal of Algorithms
44
(1), 2002, pp. 63-97
Polynomials over finite fields free from large and small degree irreducible factors
Theodoulos Garefalakis
,
Daniel Panario
Journal of Algorithms
44
(1), 2002, pp. 98-120
A multivariate view of random bucket digital search trees
Friedrich Hubalek
,
Hsien-Kuei Hwang
,
William Lew
,
Hosam Mahmoud
,
Helmut Prodinger
Journal of Algorithms
44
(1), 2002, pp. 121-158
Fountains and histograms
Donatella Merlini
,
Renzo Sprugnoli
Journal of Algorithms
44
(1), 2002, pp. 159-176
An asymptotic theory for Cauchy-Euler differential equations with applicaitons to the analysis of algorithms
Hua-Huai Chern
,
Hsien-Kuei Hwang
,
Tsung-Hsi Tsai
Journal of Algorithms
44
(1), 2002, pp. 177-225
On the average performance of orthogonal range search in multidimensional data structures
Amalia Duch
,
Conrado Martínez
Journal of Algorithms
44
(1), 2002, pp. 226-245
Dynamical analysis of
\alpha
-Euclidean algorithms
Jérémie Bourdon
,
Benoit Daireaux
,
Brigitte Vallée
Journal of Algorithms
44
(1), 2002, pp. 246-285
A linear time algorithm for scheduling outforests with communication delays on three processors
Mauro Dell'Amico
,
Lucian Finta
Journal of Algorithms
44
(2), 2002, pp. 287-307
Resource augmentation for online bounded space bin packing
János Csirik
,
Gerhard J. Woeginger
Journal of Algorithms
44
(2), 2002, pp. 308-320
Constructing set systems with prescribed intersection sizes
Vince Grolmusz
Journal of Algorithms
44
(2), 2002, pp. 321-337
Thresholds and optimal binary comparison search trees
Richard Anderson
,
Sampath Kannan
,
Howard Karloff
,
Richard E. Ladner
Journal of Algorithms
44
(2), 2002, pp. 338-358
A polynomial time approximation scheme for the two-source minimum routing cost spanning trees
Bang Ye Wu
Journal of Algorithms
44
(2), 2002, pp. 359-378