Philippe Flajolet's Research in Analysis of Algorithms and Combinatorics H. ProdingerW. Szpankowski Pages: 366 - 387
The Complete Solution of the Competitive Rank Selection Problem F. T. BrussM. DrmotaG. Louchard Pages: 413 - 447
A Note on Point Location in Delaunay Triangulations of Random Points L. DevroyeE. P. Mücke Binhai Zhu Pages: 477 - 482
Average-Case Analysis of the Merging Algorithm of Hwang and Lin W. Fernandez de la VegaA. M. FriezeM. Santha Pages: 483 - 489
Saddle Points in Random Matrices: Analysis of Knuth Search Algorithms M. HofriP. Jacquet Pages: 516 - 528
Asymptotics of Divide-and-Conquer Recurrences: Batcher's Sorting Algorithm and a Minimum Euclidean Matching Heuristic H. -K. Hwang Pages: 529 - 546
Average-Case Analysis for a Simple Compression Algorithm D. MerliniR. SprugnoliM. C. Verri Pages: 585 - 599
Average-Case Analysis of Priority Trees: A Structure for Priority Queue Administration A. PanholzerH. Prodinger Pages: 600 - 630
Dynamics of the Binary Euclidean Algorithm: Functional Analysis and Operators B. Vallée Pages: 660 - 685