A multivariate view of random bucket digital search trees

[1]  G. Doetsch Handbuch der Laplace-Transformation , 1950 .

[2]  Donald Ervin Knuth,et al.  The Art of Computer Programming , 1968 .

[3]  Donald E. Knuth,et al.  The Art of Computer Programming: Volume 3: Sorting and Searching , 1998 .

[4]  Elise de Doncker,et al.  A subroutine package for automatic integration. Part II: special purpose quadrature , 1977 .

[5]  P. Billingsley,et al.  Probability and Measure , 1980 .

[6]  Gaston H. Gonnet,et al.  Handbook Of Algorithms And Data Structures , 1984 .

[7]  Franco P. Preparata,et al.  Computational Geometry , 1985, Texts and Monographs in Computer Science.

[8]  Michael Ian Shamos,et al.  Computational geometry: an introduction , 1985 .

[9]  Mireille Régnier,et al.  Trie Partitioning Process: Limiting Distributions , 1986, CAAP.

[10]  Luc Devroye,et al.  Lecture Notes on Bucket Algorithms , 1986, Progress in Computer Science.

[11]  B. Pittel Paths in a random digital tree: limiting distributions , 1986, Advances in Applied Probability.

[12]  Mireille Régnier,et al.  Normal Limiting Distribution of the Size of Tries , 1987, Performance.

[13]  Ricardo A. Baeza-Yates Some Average Measures in m-ary Search Trees , 1987, Inf. Process. Lett..

[14]  David B. Lomet,et al.  Partial expansions for file organizations with an index , 1987, TODS.

[15]  Ricardo A. Baeza-Yates,et al.  Performance of B+-Trees with Partial Expansions , 1989, IEEE Trans. Knowl. Data Eng..

[16]  Helmut Prodinger,et al.  On the Balance Property of Patricia Tries: External Path Length Viewpoint , 1989, Theor. Comput. Sci..

[17]  Philippe Flajolet,et al.  Singularity Analysis of Generating Functions , 1990, SIAM J. Discret. Math..

[18]  Philippe Flajolet,et al.  Generalized Digital Trees and Their Difference-Differential Equations , 1992, Random Struct. Algorithms.

[19]  Philippe Flajolet,et al.  Page usage in a quadtree index , 1992, BIT Comput. Sci. Sect..

[20]  Hosam M. Mahmoud,et al.  Evolution of random search trees , 1991, Wiley-Interscience series in discrete mathematics and optimization.

[21]  Helmut Prodinger,et al.  Digital Search Trees Again Revisited: The Internal Path Length Perspective , 1994, SIAM J. Comput..

[22]  Hosam M. Mahmoud,et al.  The Joint Distribution of Elastic Buckets in Multiway Search Trees , 1994, SIAM J. Comput..

[23]  Philippe Flajolet,et al.  Mellin Transforms and Asymptotics: Harmonic Sums , 1995, Theor. Comput. Sci..

[24]  William Lew A probabilistic analysis of elastic buckets in m-ary and digital search trees , 1995 .

[25]  Ronald Cools,et al.  Algorithm 764: Cubpack++: a C++ package for automatic two-dimensional cubature , 1994, TOMS.

[26]  Hsien-Kuei Hwang,et al.  Asymptotic Estimates of Elementary Probability Distributions , 1997 .

[27]  Donald E. Knuth,et al.  The art of computer programming, volume 3: (2nd ed.) sorting and searching , 1998 .

[28]  Guy Louchard,et al.  Average Profile of the Generalized Digital Search Tree and the Generalized Lempel-Ziv Algorithm , 1999, SIAM J. Comput..

[29]  Friedrich Hubalek,et al.  On the variance of the internal path length of generalized digital trees - The Mellin convolution approach , 2000, Theor. Comput. Sci..

[30]  Mireille Régnier,et al.  Analytic variations on bucket selection and sorting , 2000, Acta Informatica.

[31]  Philippe Jacquet,et al.  Average Profile of the Lempel-Ziv Parsing Scheme for a Markovian Source , 2001, Algorithmica.

[32]  Hsien-Kuei Hwang,et al.  LIMIT THEOREMS FOR THE NUMBER OF MAXIMA IN RANDOM SAMPLES FROM PLANAR REGIONS , 2001 .

[33]  Hsien-Kuei Hwang,et al.  Phase changes in random m‐ary search trees and generalized quicksort , 2001, Random Struct. Algorithms.

[34]  Hsien-Kuei Hwang,et al.  Phase Change of Limit Laws in the Quicksort Recurrence under Varying Toll Functions , 2002, SIAM J. Comput..

[35]  Hsien-Kuei Hwang,et al.  Quickselect and the Dickman Function , 2002, Combinatorics, Probability and Computing.

[36]  W. Nobauer B-TRIES: A PARADIGM FOR THE USE OF NUMBERTHEORETIC METHODS IN THE ANALYSIS OF ALGORITHMS , 2003 .