Trie Partitioning Process: Limiting Distributions
暂无分享,去创建一个
[1] William Feller,et al. An Introduction to Probability Theory and Its Applications , 1967 .
[2] P. Flajolet,et al. Some Uses of the Mellin Integral Transform in the Analysis of Algorithms , 1985 .
[3] Philippe Flajolet,et al. A Branching Process Arising in Dynamic Hashing, Trie Searching and Polynomial Factorization , 1982, ICALP.
[4] P. Flajolet,et al. Algebraic Methods for Trie Statistics , 1985 .
[5] W. Feller,et al. An Introduction to Probability Theory and its Applications. Vol. 1, 2nd Edition , 1959 .
[6] Donald Ervin Knuth,et al. The Art of Computer Programming , 1968 .
[7] Ronald Fagin,et al. Extendible hashing—a fast access method for dynamic files , 1979, ACM Trans. Database Syst..
[8] Philippe Flajolet,et al. Tree structures for partial match retrieval , 1983, 24th Annual Symposium on Foundations of Computer Science (sfcs 1983).
[9] Nasser Saheb-Djahromi,et al. Digital Search Trees and the Generation of an Exponentially Distributed Variate , 1983, CAAP.
[10] Jürg Nievergelt,et al. The Grid File: An Adaptable, Symmetric Multikey File Structure , 1984, TODS.
[11] Witold Litwin,et al. Trie hashing , 1981, SIGMOD '81.
[12] N. E. Nörlund. Vorlesungen über Differenzenrechnung , 1924 .
[13] GUY FAYOLLE,et al. Analysis of a stack algorithm for random multiple-access communication , 1985, IEEE Trans. Inf. Theory.