{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,12,14]],"date-time":"2024-12-14T11:40:20Z","timestamp":1734176420029,"version":"3.30.2"},"reference-count":30,"publisher":"EDP Sciences","issue":"2","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["RAIRO-Theor. Inf. Appl."],"published-print":{"date-parts":[[2001,3]]},"DOI":"10.1051\/ita:2001114","type":"journal-article","created":{"date-parts":[[2003,11,14]],"date-time":"2003-11-14T15:10:02Z","timestamp":1068822602000},"page":"163-185","source":"Crossref","is-referenced-by-count":4,"title":["On the Stack-Size of General Tries"],"prefix":"10.1051","volume":"35","author":[{"given":"J\u00e9r\u00e9mie","family":"Bourdon","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Markus","family":"Nebel","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Brigitte","family":"Vall\u00e9e","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"250","published-online":{"date-parts":[[2002,4,15]]},"reference":[{"key":"R1","doi-asserted-by":"crossref","first-page":"307","DOI":"10.1007\/BF02679623","volume":"29","author":"Cl\u00e9ment","year":"2001","journal-title":"Algorithmica"},{"key":"R2","doi-asserted-by":"crossref","first-page":"397","DOI":"10.1017\/S0963548397003258","volume":"6","author":"Daud\u00e9","year":"1997","journal-title":"Combina. Probab. Comput."},{"key":"R3","doi-asserted-by":"crossref","unstructured":"N.G. De Bruijn, D.E. Knuth and S.O. Rice, The average height of planted plane trees,Graph Theory and Computing. Academic Press (1972) 15-22.","DOI":"10.1016\/B978-1-4832-3187-7.50007-6"},{"key":"R4","first-page":"443","volume":"30","author":"Devroye","year":"1996","journal-title":"RAIRO: Theoret. Informatics Appl."},{"key":"R5","doi-asserted-by":"crossref","first-page":"345","DOI":"10.1007\/BF00264279","volume":"20","author":"Flajolet","year":"1983","journal-title":"Acta Informatica"},{"key":"R6","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1016\/0304-3975(95)00002-E","volume":"144","author":"Flajolet","year":"1995","journal-title":"Theoret. Comput. Sci."},{"key":"R7","doi-asserted-by":"crossref","first-page":"371","DOI":"10.1145\/5383.5453","volume":"33","author":"Flajolet","year":"1986","journal-title":"J. ACM"},{"key":"R8","doi-asserted-by":"crossref","first-page":"490","DOI":"10.1145\/367390.367400","volume":"3","author":"Fredkin","year":"1990","journal-title":"Comm. ACM"},{"key":"R9","unstructured":"G.H. Gonnet and R. Baeza-Yates,Handbook of Algorithms and Data Structures: in Pascal and C. Addison-Wesley (1991)."},{"key":"R10","doi-asserted-by":"crossref","unstructured":"A. Grothendieck, Produit tensoriels topologiques et espaces nucl\u00e9aires.Mem. Amer. Math. Soc.16(1955).","DOI":"10.1090\/memo\/0016"},{"key":"R11","doi-asserted-by":"crossref","unstructured":"A. Grothendieck, La Th\u00e9orie de Fredholm.Bull. Soc. Math. France84, 319-384.","DOI":"10.24033\/bsmf.1476"},{"key":"R12","doi-asserted-by":"crossref","unstructured":"P. Jacquet and W. Szpankowski, Analytical Depoissonization and its Applications.Theoret. Comput. Sci.201in ``Fundamental Study'' (1998) 1-62.","DOI":"10.1016\/S0304-3975(97)00167-9"},{"key":"R13","doi-asserted-by":"crossref","first-page":"15","DOI":"10.1016\/0890-5401(87)90009-5","volume":"74","author":"Kirschenhofer","year":"1987","journal-title":"Inform. and Comput."},{"key":"R14","unstructured":"R. Kemp, The average height of"},{"key":"R15","unstructured":"D.E. Knuth,The Art of Computer Programming, Vol. 3: Sorting and Searching. Addison-Wesley (1973)."},{"key":"R16","unstructured":"M; Krasnoselskii,Positive solutions of operator equations. P. Noordhoff, Groningen (1964)."},{"key":"R17","unstructured":"H.M. Mahmoud,Evolution of Random Search Trees. Wiley-Interscience Series (1992)."},{"key":"R18","doi-asserted-by":"crossref","unstructured":"M.E. Nebel, The Stack-Size of Tries, a Combinatorial Study.Theoret. Comput. Sci.(to appear).","DOI":"10.1016\/S0304-3975(00)00416-3"},{"key":"R19","unstructured":"M.E. Nebel,The Stack-Size of Uniform Random Tries Revisited(submitted)."},{"key":"R20","doi-asserted-by":"crossref","first-page":"279","DOI":"10.1051\/ita:2000117","volume":"34","author":"Nebel","year":"2000","journal-title":"RAIRO: Theoret. Informatics Appl."},{"key":"R21","doi-asserted-by":"crossref","unstructured":"M. R\u00e9gnier, Trie hashing analysis, inProc. 4th Int.Conf. Data Eng.. Los Angeles, CA (1988) 377-387.","DOI":"10.1109\/ICDE.1988.105481"},{"key":"R22","doi-asserted-by":"crossref","first-page":"64","DOI":"10.1016\/0020-0190(81)90033-8","volume":"13","author":"R\u00e9gnier","year":"1982","journal-title":"Inform. Process. Lett."},{"key":"R23","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1137\/0205003","volume":"5","author":"Rivest","year":"1976","journal-title":"SIAM J. Comput."},{"key":"R24","unstructured":"R. Sedgewick,Algorithms. Addison-Wesley (1988)."},{"key":"R25","doi-asserted-by":"crossref","first-page":"256","DOI":"10.1007\/BF01759045","volume":"6","author":"Szpankowski","year":"1991","journal-title":"Algorithmica"},{"key":"R26","unstructured":"W. Szpankowski, Some results on"},{"key":"R27","unstructured":"L. Trabb Pardo,Set representation and set intersection, Technical Report. Stanford University (1998)."},{"key":"R28","doi-asserted-by":"crossref","first-page":"162","DOI":"10.1007\/BF02679622","volume":"29","author":"Vall\u00e9e","year":"2001","journal-title":"Algorithmica"},{"key":"R29","doi-asserted-by":"crossref","unstructured":"X.G. Viennot, Trees Everywhere, inProc. CAAP'90. Springer,Lecture Notes in Comput. Sci.431(1990) 18-41.","DOI":"10.1007\/3-540-52590-4_38"},{"key":"R30","doi-asserted-by":"crossref","first-page":"84","DOI":"10.1016\/0020-0190(80)90008-3","volume":"11","author":"Yao","year":"1980","journal-title":"Inform. Process. Lett."}],"container-title":["RAIRO - Theoretical Informatics and Applications"],"original-title":[],"link":[{"URL":"http:\/\/www.rairo-ita.org\/10.1051\/ita:2001114\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,12,14]],"date-time":"2024-12-14T11:00:57Z","timestamp":1734174057000},"score":1,"resource":{"primary":{"URL":"http:\/\/www.rairo-ita.org\/10.1051\/ita:2001114"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001,3]]},"references-count":30,"journal-issue":{"issue":"2"},"alternative-id":["ita0019"],"URL":"https:\/\/doi.org\/10.1051\/ita:2001114","relation":{},"ISSN":["0988-3754","1290-385X"],"issn-type":[{"type":"print","value":"0988-3754"},{"type":"electronic","value":"1290-385X"}],"subject":[],"published":{"date-parts":[[2001,3]]}}}