Journal of Algorithms, Volume 44

Volume 44, Number 1, July 2002

Helmut Prodinger, Brigitte Vallée:
Preface. 1-3
James Allen Fill, Svante Janson:
Quicksort asymptotics. 4-28
Philippe Chassaing, Guy Louchard:
Reflected Brownian Bridge area conditioned on its local time at the origin. 29-51
Ralph Neininger, Ludger Rüschendorf:
Rates of convergence for Quicksort. 52-62
Charles Knessl, Wojciech Szpankowski:
Limit laws for the height in PATRICIA tries. 63-97
Theodoulos Garefalakis, Daniel Panario:
Polynomials over finite fields free from large and small degree irreducible factors. 98-120
Friedrich Hubalek, Hsien-Kuei Hwang, William Lew, Hosam M. Mahmoud, Helmut Prodinger:
A multivariate view of random bucket digital search trees. 121-158
Donatella Merlini, Renzo Sprugnoli:
Fountains and histograms. 159-176
Hua-Huai Chern, Hsien-Kuei Hwang, Tsung-Hsi Tsai:
An asymptotic theory for Cauchy-Euler differential equations with applications to the analysis of algorithms. 177-225
Amalia Duch, Conrado Martínez:
On the average performance of orthogonal range search in multidimensional data structures. 226-245
Jérémie Bourdon, Benoit Daireaux, Brigitte Vallée:
Dynamical analysis of alpha-Euclidean algorithms. 246-285

Mauro Dell'Amico, Lucian Finta:
A linear time algorithm for scheduling outforests with communication delays on three processors. 287-307
János Csirik, Gerhard J. Woeginger:
Resource augmentation for online bounded space bin packing. 308-320
Vince Grolmusz:
Constructing set systems with prescribed intersection sizes. 321-337
Richard J. Anderson, Sampath Kannan, Howard J. Karloff, Richard E. Ladner:
Thresholds and optimal binary comparison search trees. 338-358
Bang Ye Wu:
A polynomial time approximation scheme for the two-source minimum routing cost spanning trees. 359-378

Last update Sat May 18 20:38:50 2013 CET by the DBLP Team —

Data released under the ODC-BY 1.0 license — See also our legal information page