![](https://dblp.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
default search action
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
Volume 44, Number 2, August 2002
- 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
![](https://dblp.uni-trier.de/img/cog.dark.24x24.png)
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.