{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,27]],"date-time":"2025-06-27T19:25:13Z","timestamp":1751052313852},"publisher-location":"Berlin\/Heidelberg","reference-count":17,"publisher":"Springer-Verlag","isbn-type":[{"type":"print","value":"354016443X"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/bfb0022669","type":"book-chapter","created":{"date-parts":[[2005,11,23]],"date-time":"2005-11-23T05:51:59Z","timestamp":1132725119000},"page":"196-210","source":"Crossref","is-referenced-by-count":38,"title":["Trie partitioning process: Limiting distributions"],"prefix":"10.1007","author":[{"given":"Philippe","family":"Jacquet","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mireille","family":"Regnier","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"16_CR1","doi-asserted-by":"crossref","unstructured":"Ph. Flajolet and C. Puech, \u201cTree Structure for Partial Match Retrieval,\u201d pp. 282\u2013288 in Proc. 24-th I.E.E.E. Symp. on FOCS, (1983). To appear in JACM","DOI":"10.1109\/SFCS.1983.79"},{"issue":"3","key":"16_CR2","doi-asserted-by":"crossref","first-page":"315","DOI":"10.1145\/320083.320092","volume":"4","author":"R. Fagin","year":"1979","unstructured":"R. Fagin, J. Nievergelt, N. Pippenger, and H.R. Strong, \u201cExtendible Hashing:A Fast Access Method for Dynamic Files,\u201d ACM TODS 4,3 pp. 315\u2013344 (1979).","journal-title":"ACM TODS"},{"issue":"2","key":"16_CR3","doi-asserted-by":"crossref","first-page":"244","DOI":"10.1109\/TIT.1985.1057014","volume":"IT-31","author":"G. Fayolle","year":"1985","unstructured":"G. Fayolle, Ph. Flajolet, M. Hofri, and Ph. Jacquet, \u201cAnalysis of a Stack Algorithm for Random Multiple-Access Communication,\u201d IEEE Trans. on Information Theory IT-31,2 pp. 244\u2013254 (1985).","journal-title":"IEEE Trans. on Information Theory"},{"key":"16_CR4","unstructured":"W. Feller, An Introduction to Probability Theory and its Applications, Wiley-third Edition-1971 (1957)."},{"key":"16_CR5","doi-asserted-by":"crossref","first-page":"345","DOI":"10.1007\/BF00264279","volume":"20","author":"P. Flajolet","year":"1983","unstructured":"Ph. Flajolet, \u201cOn the Performance Evaluation of Extendible Hashing and Trie Searching,\u201d Acta Informatica 20 pp. 345\u2013369 (1983).","journal-title":"Acta Informatica"},{"key":"16_CR6","first-page":"145","volume":"25","author":"P. Flajolet","year":"1985","unstructured":"Ph. Flajolet, M. R\u00e9gnier, and D. Sotteau, \u201cAlgebraic Methods for Trie Statistics,\u201d Annals of Discrete Mathematics 25 pp. 145\u2013188 (1985).","journal-title":"Annals of Discrete Mathematics"},{"key":"16_CR7","doi-asserted-by":"crossref","unstructured":"Ph. Flajolet, M. Regnier, and R. Sedgewick, Some Uses of the Mellin Transform Techniques in the Analysis of Algorithms, Springer NATO ASI SEr. F12, Combinatorial Algorithms on Words (1985).","DOI":"10.1007\/978-3-642-82456-2_16"},{"key":"16_CR8","unstructured":"Ph. Flajolet, M. Regnier, and R. Sedgewick, \u201cMellin Transform Techniques for the Analysis of Algorithms\u201d, Monography in preparation, (1986)."},{"key":"16_CR9","doi-asserted-by":"crossref","unstructured":"Ph. Flajolet and N. Saheb, \u201cDigital Search Trees and the Complexity of Generating an Exponentially Distributed Variate,\u201d in Proc. Coll. on Trees in Algebra and Programming, Lecture Notes in Computer Science, L'Aquila (1983). to appear","DOI":"10.1007\/3-540-12727-5_13"},{"key":"16_CR10","doi-asserted-by":"crossref","unstructured":"Ph. Flajolet and J.M. Steyaert, \u201cA Branching Process Arising in Dynamic Hashing, Trie Searching and Polynomial Factorization,\u201d pp. 239\u2013251 in Proceedings ICALP 82, Lecture Notes in Computer Science (1982).","DOI":"10.1007\/BFb0012773"},{"key":"16_CR11","unstructured":"Ph. Jacquet and M. R\u00e9gnier, Limiting Distributions for Trie Parameters, in preparation 1985."},{"key":"16_CR12","volume-title":"The Art of Computer Programming","author":"D. Knuth","year":"1973","unstructured":"D. Knuth, The Art of Computer Programming, Addison-Wesley, Reading,Mass. (1973)."},{"key":"16_CR13","doi-asserted-by":"crossref","first-page":"184","DOI":"10.1007\/BF01931695","volume":"18","author":"P.A. Larson","year":"1978","unstructured":"P.A. Larson, \u201cDynamic Hashing,\u201d BIT 18 pp. 184\u2013201 (1978).","journal-title":"BIT"},{"key":"16_CR14","doi-asserted-by":"crossref","unstructured":"W. Litwin, \u201cTrie Hashing,\u201d pp. 19\u201329 in Proc. ACM-SIGMOD Conf. on MOD., Ann Arbor, Mich. (1981).","DOI":"10.1145\/582318.582322"},{"key":"16_CR15","unstructured":"J. Nievergelt, H. Hinterberger, and K.C. Sevcik, \u201cThe Grid-file: an Adaptable Symmetric Multi-Key File Structure,\u201d ACM TODS 9,1 (1984)."},{"key":"16_CR16","unstructured":"N.E. Norlund, Vorlesungen Uber Differenzenrechnung, Chelsea Publishing Company (1954)."},{"key":"16_CR17","unstructured":"M. R\u00e9gnier, \u201cEvaluation des performances du hachage dynamique,\u201d These de 3-eme cycle, Universite d'Orsay, (1983)."}],"container-title":["Lecture Notes in Computer Science","CAAP '86"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/www.springerlink.com\/index\/pdf\/10.1007\/BFb0022669","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,11]],"date-time":"2020-04-11T04:22:08Z","timestamp":1586578928000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0022669"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["354016443X"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/bfb0022669","relation":{},"subject":[]}}