366 | -- | 387 | Helmut Prodinger, Wojciech Szpankowski. Philippe Flajolet s Research in Analysis of Algorithms and Combinatorics |
388 | -- | 412 | David Aldous. A. Metropolis-Type Optimization Algorithm on the Infinite Tree |
413 | -- | 447 | F. T. Bruss, Michael Drmota, Guy Louchard. The Complete Solution of the Competitive Rank Selection Problem |
448 | -- | 476 | Edward G. Coffman Jr., Leopold Flatto, Predrag R. Jelenkovic, Bjorn Poonen. Packing Random Intervals On-Line |
477 | -- | 482 | Luc Devroye, Ernst P. Mücke, Binhai Zhu. A Note on Point Location in Delaunay Triangulations of Random Points |
483 | -- | 489 | Wenceslas Fernandez de la Vega, Alan M. Frieze, Miklos Santha. Average-Case Analysis of the Merging Algorithm of Hwang and Lin |
490 | -- | 515 | Philippe Flajolet, Patricio V. Poblete, Alfredo Viola. On the Analysis of Linear Probing Hashing |
516 | -- | 528 | Micha Hofri, Philippe Jacquet. Saddle Points in Random Matrices: Analysis of Knuth Search Algorithms |
529 | -- | 546 | Hsien-Kuei Hwang. Asymptotics of Divide-and-Conquer Recurrences: Batcher s Sorting Algorithm and a Minimum Euclidean Matching Heuristic |
547 | -- | 560 | Charles Knessl. A Note on the Asymptotic Behavior of the Depth of Tries |
561 | -- | 568 | Donald E. Knuth. Linear Probing and Graphs |
569 | -- | 584 | Hosam M. Mahmoud, Robert T. Smythe. Probabilistic Analysis of MULTIPLE QUICK SELECT |
585 | -- | 599 | Donatella Merlini, Renzo Sprugnoli, M. Cecilia Verri. Average-Case Analysis for a Simple Compression Algorithm |
600 | -- | 630 | Alois Panholzer, Helmut Prodinger. Average-Case Analysis of Priority Trees: A Structure for Priority Queue Administration |
631 | -- | 649 | Mireille Régnier, Wojciech Szpankowski. On Pattern Frequency Occurrences in a Markovian Sequence |
650 | -- | 659 | Hadas Shachnai, Micha Hofri. The List Update Problem: Improved Bounds for the Counter Scheme |
660 | -- | 685 | Brigitte Vallée. Dynamics of the Binary Euclidean Algorithm: Functional Analysis and Operators |