|
Journals in DBLP
Algorithmica 2001, volume: 31, number: 3
- Vicky Siu-Ngan Choi, Mordecai J. Golin
Lopsided Trees, I: Analyses. [Citation Graph (0, 0)][DBLP] Algorithmica, 2001, v:31, n:3, pp:240-290 [Journal]
- Luc Devroye
On the Probablistic Worst-Case Time of ``Find''. [Citation Graph (0, 0)][DBLP] Algorithmica, 2001, v:31, n:3, pp:291-303 [Journal]
- Michael Drmota
The Asymptotic Number of Leftist Trees. [Citation Graph (0, 0)][DBLP] Algorithmica, 2001, v:31, n:3, pp:304-317 [Journal]
- Philippe Jacquet, Wojciech Szpankowski, Jing Tang
Average Profile of the Lempel-Ziv Parsing Scheme for a Markovian Source. [Citation Graph (0, 0)][DBLP] Algorithmica, 2001, v:31, n:3, pp:318-360 [Journal]
- Philippe Flajolet, Guy Louchard
Analytic Variations on the Airy Distribution. [Citation Graph (0, 0)][DBLP] Algorithmica, 2001, v:31, n:3, pp:361-377 [Journal]
- Micha Hofri, Hadas Shachnai
Efficient Reorganization of Binary Search Trees. [Citation Graph (0, 0)][DBLP] Algorithmica, 2001, v:31, n:3, pp:378-402 [Journal]
- Tatsuie Tsukiji, Hosam M. Mahmoud
A Limit Law for Outputs in Random Recursive Circuits. [Citation Graph (0, 0)][DBLP] Algorithmica, 2001, v:31, n:3, pp:403-412 [Journal]
- Daniel Panario, L. Bruce Richmond
Exact Largest and Smallest Size of Components. [Citation Graph (0, 0)][DBLP] Algorithmica, 2001, v:31, n:3, pp:413-432 [Journal]
- Helmut Prodinger
A q-Analogue of the Path Length of Binary Search Trees. [Citation Graph (0, 0)][DBLP] Algorithmica, 2001, v:31, n:3, pp:433-441 [Journal]
- Robert T. Smythe, J. Wellner
Stochastic Analysis of Shell Sort. [Citation Graph (0, 0)][DBLP] Algorithmica, 2001, v:31, n:3, pp:442-457 [Journal]
|