{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T17:08:41Z","timestamp":1760202521446},"publisher-location":"Berlin, Heidelberg","reference-count":63,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540323013"},{"type":"electronic","value":"9783540322887"}],"license":[{"start":{"date-parts":[[2006,1,1]],"date-time":"2006-01-01T00:00:00Z","timestamp":1136073600000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11672142_1","type":"book-chapter","created":{"date-parts":[[2006,2,28]],"date-time":"2006-02-28T08:27:54Z","timestamp":1141115274000},"page":"1-22","source":"Crossref","is-referenced-by-count":2,"title":["The Ubiquitous Digital Tree"],"prefix":"10.1007","author":[{"given":"Philippe","family":"Flajolet","sequence":"first","affiliation":[]}],"member":"297","reference":[{"issue":"2","key":"1_CR1","doi-asserted-by":"publisher","first-page":"219","DOI":"10.1109\/TIT.1987.1057295","volume":"33","author":"J. David","year":"1987","unstructured":"David, J., Aldous, D.J.: Ultimate instability of exponential back-off protocol for acknowledgement-based transmission control of random access communication channels. IEEE Transactions on Information Theory\u00a033(2), 219\u2013223 (1987)","journal-title":"IEEE Transactions on Information Theory"},{"issue":"1","key":"1_CR2","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1006\/jcss.1997.1545","volume":"58","author":"N. Alon","year":"1999","unstructured":"Alon, N., Matias, Y., Szegedy, M.: The space complexity of approximating the frequency moments. Journal of Computer and System Sciences\u00a058(1), 137\u2013147 (1999)","journal-title":"Journal of Computer and System Sciences"},{"issue":"2","key":"1_CR3","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1007\/BF02522822","volume":"17","author":"F. Avnaim","year":"1997","unstructured":"Avnaim, F., Boissonnat, J.-D., Devillers, O., Preparata, F.P., Yvinec, M.: Evaluating signs of determinants using single-precision arithmetic. Algorithmica\u00a017(2), 111\u2013132 (1997)","journal-title":"Algorithmica"},{"key":"1_CR4","unstructured":"Beeler, M., Gosper, R.W., Schroeppel, R.: HAKMEM, Memorandum 239, M.I.T, Artificial Intelligence Laboratory (February 1972), Available on the WorldWide Web at: http:\/\/www.inwap.com\/-pdp10\/-hbaker\/-hakmem\/-hakmem.html"},{"key":"1_CR5","volume-title":"Eighth Annual ACM-SIAM Symposium on Discrete Algorithms","author":"J. Bentley","year":"1997","unstructured":"Bentley, J., Sedgewick, R.: Fast algorithms for sorting and searching strings. In: Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, SIAM Press, Philadelphia (1997)"},{"issue":"9","key":"1_CR6","doi-asserted-by":"publisher","first-page":"509","DOI":"10.1145\/361002.361007","volume":"18","author":"J.L. Bentley","year":"1975","unstructured":"Bentley, J.L.: Multidimensional binary search trees used for associative searching. Communications of the ACM\u00a018(9), 509\u2013517 (1975)","journal-title":"Communications of the ACM"},{"key":"1_CR7","first-page":"531","volume-title":"Proceedings of the Ninth Annual ACM\u2013SIAM Symposium on Discrete Algorithms","author":"J. Cl\u00e9ment","year":"1998","unstructured":"Cl\u00e9ment, J., Flajolet, P., Vall\u00e9e, B.: The analysis of hybrid trie structures. In: Proceedings of the Ninth Annual ACM\u2013SIAM Symposium on Discrete Algorithms, pp. 531\u2013539. SIAM Press, Philadelphia (1998)"},{"issue":"1\/2","key":"1_CR8","doi-asserted-by":"publisher","first-page":"307","DOI":"10.1007\/BF02679623","volume":"2","author":"J. Cl\u00e9ment","year":"2001","unstructured":"Cl\u00e9ment, J., Flajolet, P., Vall\u00e9e, B.: Dynamical sources in information theory: A general analysis of trie structures. Algorithmica\u00a02(1\/2), 307\u2013369 (2001)","journal-title":"Algorithmica"},{"key":"1_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","DOI":"10.1007\/3-540-48452-3","volume-title":"Automata, Languages and Programming","author":"M. Crochemore","year":"1999","unstructured":"Crochemore, M., Mignosi, F., Restivo, A., Salemi, S.: Text compression using antidictionaries. In: Wiedermann, J., Van Emde Boas, P., Nielsen, M. (eds.) ICALP 1999. LNCS, vol.\u00a01644, Springer, Heidelberg (1999)"},{"key":"1_CR10","volume-title":"Asymptotic methods in analysis","author":"N.G. Bruijn de","year":"1970","unstructured":"de Bruijn, N.G.: Asymptotic methods in analysis. A reprint of the third North Holland edition, Amsterdam (1970); (1st edn., 1958)"},{"key":"1_CR11","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1007\/BF00264248","volume":"21","author":"L. Devroye","year":"1984","unstructured":"Devroye, L.: A probabilistic analysis of the height of tries and of the complexity of triesort. Acta Informatica\u00a021, 229\u2013237 (1984)","journal-title":"Acta Informatica"},{"key":"1_CR12","doi-asserted-by":"publisher","first-page":"359","DOI":"10.1002\/rsa.10006","volume":"19","author":"L. Devroye","year":"2001","unstructured":"Devroye, L.: An analysis of random LC tries. Random Structures & Algorithms\u00a019, 359\u2013375 (2001)","journal-title":"Random Structures & Algorithms"},{"issue":"2","key":"1_CR13","doi-asserted-by":"publisher","first-page":"185","DOI":"10.1002\/rsa.20067","volume":"27","author":"L. Devroye","year":"2005","unstructured":"Devroye, L., Szpankowski, W.: Probabilistic behaviour of level compressed tries. Random Structures & Algorithms\u00a027(2), 185\u2013200 (2005)","journal-title":"Random Structures & Algorithms"},{"key":"1_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"605","DOI":"10.1007\/978-3-540-39658-1_55","volume-title":"Algorithms - ESA 2003","author":"M. Durand","year":"2003","unstructured":"Durand, M., Flajolet, P.: LogLog counting of large cardinalities. In: Di Battista, G., Zwick, U. (eds.) ESA 2003. LNCS, vol.\u00a02832, pp. 605\u2013617. Springer, Heidelberg (2003)"},{"issue":"3","key":"1_CR15","doi-asserted-by":"publisher","first-page":"270","DOI":"10.1145\/859716.859719","volume":"21","author":"C. Estan","year":"2003","unstructured":"Estan, C., Varghese, G.: New directions in traffic measurement and accounting: Focusing on the elephants, ignoring the mice. ACM Transactions on Computer Systems\u00a021(3), 270\u2013313 (2003)","journal-title":"ACM Transactions on Computer Systems"},{"key":"1_CR16","doi-asserted-by":"publisher","first-page":"315","DOI":"10.1145\/320083.320092","volume":"4","author":"R. Fagin","year":"1979","unstructured":"Fagin, R., Nievergelt, J., Pippenger, N., Strong, R.: Extendible hashing: A fast access method for dynamic files. A.C.M. Transactions on Database Systems\u00a04, 315\u2013344 (1979)","journal-title":"A.C.M. Transactions on Database Systems"},{"key":"1_CR17","doi-asserted-by":"publisher","first-page":"441","DOI":"10.1017\/S0001867800015846","volume":"18","author":"G. Fayolle","year":"1986","unstructured":"Fayolle, G., Flajolet, P., Hofri, M.: On a functional equation arising in the analysis of a protocol for a multiaccess broadcast channel. Advances in Applied Probability\u00a018, 441\u2013472 (1986)","journal-title":"Advances in Applied Probability"},{"issue":"2","key":"1_CR18","doi-asserted-by":"publisher","first-page":"244","DOI":"10.1109\/TIT.1985.1057014","volume":"IT-31","author":"G. Fayolle","year":"1985","unstructured":"Fayolle, G., Flajolet, P., Hofri, M., Jacquet, P.: Analysis of a stack algorithm for random access communication. IEEE Transactions on Information Theory\u00a0IT-31(2), 244\u2013254 (1985) (Special Issue on Random Access Communication, Massey, J. (ed.))","journal-title":"IEEE Transactions on Information Theory"},{"key":"1_CR19","series-title":"Trends in Mathematics","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1007\/978-3-0348-7915-6_22","volume-title":"Mathematics and Computer Science III: Algorithms, Trees, Combinatorics and Probabilities","author":"J. Fayolle","year":"2004","unstructured":"Fayolle, J.: An average-case analysis of basic parameters of the suffix tree. In: Drmota, M., et al. (eds.) Mathematics and Computer Science III: Algorithms, Trees, Combinatorics and Probabilities. Trends in Mathematics, pp. 217\u2013227. Birkh\u00e4user Verlag, Basel (2004)"},{"issue":"4","key":"1_CR20","doi-asserted-by":"publisher","first-page":"1260","DOI":"10.1214\/aoap\/1035463332","volume":"6","author":"J.A. Fill","year":"1996","unstructured":"Fill, J.A., Mahmoud, H.M., Szpankowski, W.: On the distribution for the duration of a randomized leader election algorithm. The Annals of Applied Probability\u00a06(4), 1260\u20131283 (1996)","journal-title":"The Annals of Applied Probability"},{"key":"1_CR21","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/BF00288933","volume":"4","author":"R.A. Finkel","year":"1974","unstructured":"Finkel, R.A., Bentley, J.L.: Quad trees, a data structure for retrieval on composite keys. Acta Informatica\u00a04, 1\u20139 (1974)","journal-title":"Acta Informatica"},{"key":"1_CR22","doi-asserted-by":"publisher","first-page":"345","DOI":"10.1007\/BF00264279","volume":"20","author":"P. Flajolet","year":"1983","unstructured":"Flajolet, P.: On the performance evaluation of extendible hashing and trie searching. Acta Informatica\u00a020, 345\u2013369 (1983)","journal-title":"Acta Informatica"},{"key":"1_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-540-30502-6_1","volume-title":"Advances in Computer Science - ASIAN 2004. Higher-Level Decision Making","author":"P. Flajolet","year":"2004","unstructured":"Flajolet, P.: Counting by coin tossings. In: Maher, M.J. (ed.) ASIAN 2004. LNCS, vol.\u00a03321, pp. 1\u201312. Springer, Heidelberg (2004)"},{"issue":"1-2","key":"1_CR24","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/0304-3975(95)00002-E","volume":"144","author":"P. Flajolet","year":"1995","unstructured":"Flajolet, P., Gourdon, X., Dumas, P.: Mellin transforms and asymptotics: Harmonic sums. Theoretical Computer Science\u00a0144(1-2), 3\u201358 (1995)","journal-title":"Theoretical Computer Science"},{"issue":"2","key":"1_CR25","doi-asserted-by":"publisher","first-page":"182","DOI":"10.1016\/0022-0000(85)90041-8","volume":"31","author":"P. Flajolet","year":"1985","unstructured":"Flajolet, P., Martin, G.N.: Probabilistic counting algorithms for data base applications. Journal of Computer and System Sciences\u00a031(2), 182\u2013209 (1985)","journal-title":"Journal of Computer and System Sciences"},{"issue":"2","key":"1_CR26","doi-asserted-by":"publisher","first-page":"371","DOI":"10.1145\/5383.5453","volume":"33","author":"P. Flajolet","year":"1986","unstructured":"Flajolet, P., Puech, C.: Partial match retrieval of multidimensional data. Journal of the ACM\u00a033(2), 371\u2013407 (1986)","journal-title":"Journal of the ACM"},{"key":"1_CR27","doi-asserted-by":"crossref","unstructured":"Flajolet, P., R\u00e9gnier, M., Sotteau, D.: Algebraic methods for trie statistics. In: Ausiello, G., Lucertini, M. (eds.) Analysis and Design of Algorithms for Combinatorial Problems. Annals of Discrete Mathematics, vol.\u00a025, pp. 145\u2013188 (1985)","DOI":"10.1016\/S0304-0208(08)73107-4"},{"issue":"3","key":"1_CR28","doi-asserted-by":"publisher","first-page":"305","DOI":"10.1002\/rsa.3240030309","volume":"3","author":"P. Flajolet","year":"1992","unstructured":"Flajolet, P., Richmond, B.: Generalized digital trees and their difference\u2013differential equations. Random Structures & Algorithms\u00a03(3), 305\u2013320 (1992)","journal-title":"Random Structures & Algorithms"},{"issue":"3","key":"1_CR29","doi-asserted-by":"publisher","first-page":"748","DOI":"10.1137\/0215054","volume":"15","author":"P. Flajolet","year":"1986","unstructured":"Flajolet, P., Sedgewick, R.: Digital search trees revisited. SIAM Journal on Computing\u00a015(3), 748\u2013767 (1986)","journal-title":"SIAM Journal on Computing"},{"issue":"1\u20132","key":"1_CR30","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1016\/0304-3975(94)00281-M","volume":"144","author":"P. Flajolet","year":"1995","unstructured":"Flajolet, P., Sedgewick, R.: Mellin transforms and asymptotics: finite differences and Rice\u2019s integrals. Theoretical Computer Science\u00a0144(1\u20132), 101\u2013124 (1995)","journal-title":"Theoretical Computer Science"},{"key":"1_CR31","unstructured":"Flajolet, P., Sedgewick, R.: Analytic combinatorics. Chapters I\u2013IX of a book to be published, 688p.+x, available electronically from P. Flajolet\u2019s home page (October 2005)"},{"key":"1_CR32","unstructured":"Flajolet, P., Vall\u00e9e, B.: Continued fractions, comparison algorithms, and fine structure constants. In: Th\u00e9ra, M. (ed.) Constructive, Experimental, and Nonlinear Analysis (Providence). Canadian Mathematical Society Conference Proceedings, vol.\u00a027, pp. 53\u201382. American Mathematical Society (2000)"},{"key":"1_CR33","volume-title":"Combinatorial enumeration","author":"I.P. Goulden","year":"1983","unstructured":"Goulden, I.P., Jackson, D.M.: Combinatorial enumeration. John Wiley, New York (1983)"},{"issue":"2","key":"1_CR34","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1016\/0097-3165(81)90005-4","volume":"30","author":"L.J. Guibas","year":"1981","unstructured":"Guibas, L.J., Odlyzko, A.M.: String overlaps, pattern matching, and nontransitive games. Journal of Combinatorial Theory. Series A\u00a030(2), 183\u2013208 (1981)","journal-title":"Journal of Combinatorial Theory. Series A"},{"key":"1_CR35","volume-title":"Analysis of algorithms: Computational methods and mathematical tools","author":"M. Hofri","year":"1995","unstructured":"Hofri, M.: Analysis of algorithms: Computational methods and mathematical tools. Oxford University Press, Oxford (1995)"},{"issue":"3","key":"1_CR36","doi-asserted-by":"publisher","first-page":"329","DOI":"10.1006\/eujc.1997.0179","volume":"19","author":"H.-K. Hwang","year":"1998","unstructured":"Hwang, H.-K.: On convergence rates in the central limit theorems for combinatorial structures. European Journal of Combinatorics\u00a019(3), 329\u2013343 (1998)","journal-title":"European Journal of Combinatorics"},{"key":"1_CR37","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"196","DOI":"10.1007\/BFb0022669","volume-title":"CAAP\u201986","author":"P. Jacquet","year":"1986","unstructured":"Jacquet, P., R\u00e9gnier, M.: Trie partitioning process: Limiting distributions. In: Franchi-Zannettacci, P. (ed.) CAAP 1986. LNCS, vol.\u00a0214, pp. 196\u2013210. Springer, Heidelberg (1986)"},{"issue":"2","key":"1_CR38","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1016\/0097-3165(94)90065-5","volume":"66","author":"P. Jacquet","year":"1994","unstructured":"Jacquet, P., Szpankowski, W.: Autocorrelation on words and its applications: analysis of suffix trees by string-ruler approach. Journal of Combinatorial Theory. Series A\u00a066(2), 237\u2013269 (1994)","journal-title":"Journal of Combinatorial Theory. Series A"},{"issue":"1\u20132","key":"1_CR39","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1016\/0304-3975(94)00298-W","volume":"144","author":"P. Jacquet","year":"1995","unstructured":"Jacquet, P., Szpankowski, W.: Asymptotic behavior of the Lempel-Ziv parsing scheme and digital search trees. Theoretical Computer Science\u00a0144(1\u20132), 161\u2013197 (1995)","journal-title":"Theoretical Computer Science"},{"issue":"1-2","key":"1_CR40","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/S0304-3975(97)00167-9","volume":"201","author":"P. Jacquet","year":"1998","unstructured":"Jacquet, P., Szpankowski, W.: Analytical de-Poissonization and its applications. Theoretical Computer Science\u00a0201(1-2), 1\u201362 (1998)","journal-title":"Theoretical Computer Science"},{"key":"1_CR41","doi-asserted-by":"publisher","first-page":"14","DOI":"10.1112\/S0025579300006409","volume":"38","author":"P. Kirschenhofer","year":"1991","unstructured":"Kirschenhofer, P., Prodinger, H.: On some applications of formul\u00e6 of Ramanujan in the analysis of algorithms. Mathematika\u00a038, 14\u201333 (1991)","journal-title":"Mathematika"},{"key":"1_CR42","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1016\/0166-218X(89)90050-4","volume":"25","author":"P. Kirschenhofer","year":"1989","unstructured":"Kirschenhofer, P., Prodinger, H., Szpankowski, W.: On the variance of the external path length in a symmetric digital trie. Discrete Applied Mathematics\u00a025, 129\u2013143 (1989)","journal-title":"Discrete Applied Mathematics"},{"key":"1_CR43","series-title":"Sorting and Searching","volume-title":"The art of computer programming","author":"D.E. Knuth","year":"1998","unstructured":"Knuth, D.E.: The art of computer programming, 2nd edn. Sorting and Searching, vol.\u00a03. Addison-Wesley, Reading (1998)","edition":"2"},{"key":"1_CR44","doi-asserted-by":"publisher","first-page":"184","DOI":"10.1007\/BF01931695","volume":"18","author":"P.A. Larson","year":"1978","unstructured":"Larson, P.A.: Dynamic hashing. BIT\u00a018, 184\u2013201 (1978)","journal-title":"BIT"},{"key":"1_CR45","volume-title":"Evolution of random search trees","author":"H.M. Mahmoud","year":"1992","unstructured":"Mahmoud, H.M.: Evolution of random search trees. John Wiley, New York (1992)"},{"key":"1_CR46","doi-asserted-by":"crossref","unstructured":"Massey, J.L (ed.).: Special issue on random-access communications. IEEE Transactions on Information Theory\u00a0IT-31(2) (March 1985)","DOI":"10.1109\/TIT.1985.1057027"},{"issue":"2","key":"1_CR47","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1109\/TIT.1985.1057013","volume":"IT-31","author":"P. Mathys","year":"1985","unstructured":"Mathys, P., Flajolet, P.: Q\u2013ary collision resolution algorithms in random access systems with free or blocked channel access. IEEE Transactions on Information Theory\u00a0IT-31(2), 217\u2013243 (1985)","journal-title":"IEEE Transactions on Information Theory"},{"issue":"6","key":"1_CR48","doi-asserted-by":"publisher","first-page":"1083","DOI":"10.1109\/49.772439","volume":"17","author":"S. Nilsson","year":"1999","unstructured":"Nilsson, S., Karlsson, G.: IP\u2013address lookup using LC tries. IEEE Journal on Selected Areas in Communications\u00a017(6), 1083\u20131092 (1999)","journal-title":"IEEE Journal on Selected Areas in Communications"},{"key":"1_CR49","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1016\/0012-365X(93)90572-B","volume":"120","author":"H. Prodinger","year":"1993","unstructured":"Prodinger, H.: How to select a loser. Discrete Mathematics\u00a0120, 149\u2013159 (1993)","journal-title":"Discrete Mathematics"},{"key":"1_CR50","doi-asserted-by":"publisher","first-page":"64","DOI":"10.1016\/0020-0190(81)90033-8","volume":"13","author":"M. R\u00e9gnier","year":"1982","unstructured":"R\u00e9gnier, M.: On the average height of trees in in digital search and dynamic hashing. Information Processing Letters\u00a013, 64\u201366 (1982)","journal-title":"Information Processing Letters"},{"key":"1_CR51","doi-asserted-by":"publisher","first-page":"335","DOI":"10.1007\/BF01934379","volume":"25","author":"M. R\u00e9gnier","year":"1985","unstructured":"R\u00e9gnier, M.: Analysis of grid file algorithms. BIT\u00a025, 335\u2013357 (1985)","journal-title":"BIT"},{"key":"1_CR52","volume-title":"Applications of spatial data structures","author":"H. Samet","year":"1990","unstructured":"Samet, H.: Applications of spatial data structures. Addison\u2013Wesley, Reading (1990)"},{"key":"1_CR53","volume-title":"The design and analysis of spatial data structures","author":"H. Samet","year":"1990","unstructured":"Samet, H.: The design and analysis of spatial data structures. Addison\u2013Wesley, Reading (1990)"},{"key":"1_CR54","volume-title":"Algorithms in\u00a0C, Parts\u00a01\u20134","author":"R. Sedgewick","year":"1998","unstructured":"Sedgewick, R.: Algorithms in\u00a0C, Parts\u00a01\u20134, 3rd edn. Addison\u2013Wesley, Reading (1998)","edition":"3"},{"key":"1_CR55","series-title":"Publishing Company","volume-title":"An introduction to the analysis of algorithms","author":"R. Sedgewick","year":"1996","unstructured":"Sedgewick, R., Flajolet, P.: An introduction to the analysis of algorithms. Publishing Company. Addison-Wesley Publishing Company, Reading (1996)"},{"key":"1_CR56","volume-title":"Stanley, Enumerative combinatorics, vol","author":"R.P. Stanley","year":"1998","unstructured":"Stanley, R.P.: Stanley, Enumerative combinatorics, vol, vol.\u00a0II. Cambridge University Press, Cambridge (1998)"},{"key":"1_CR57","doi-asserted-by":"publisher","DOI":"10.1002\/9781118032770","volume-title":"Average-case analysis of algorithms on sequences","author":"W. Szpankowski","year":"2001","unstructured":"Szpankowski, W.: Average-case analysis of algorithms on sequences. John Wiley, New York (2001)"},{"key":"1_CR58","unstructured":"Pardo, L.T.: Set representation and set intersection, Tech. report, Stanford University (1978)"},{"issue":"1\/2","key":"1_CR59","doi-asserted-by":"publisher","first-page":"262","DOI":"10.1007\/BF02679622","volume":"29","author":"B. Vall\u00e9e","year":"2001","unstructured":"Vall\u00e9e, B.: Dynamical sources in information theory: Fundamental intervals and word prefixes. Algorithmica\u00a029(1\/2), 262\u2013306 (2001)","journal-title":"Algorithmica"},{"key":"1_CR60","unstructured":"Vall\u00e9e, B.: Euclidean dynamics. Discrete and Continuous Dynamical Systems, 69 (submitted, October 2005)"},{"key":"1_CR61","volume-title":"A course of modern analysis","author":"E.T. Whittaker","year":"1927","unstructured":"Whittaker, E.T., Watson, G.N.: A course of modern analysis, 4th edn. Cambridge University Press, Cambridge (1927) (reprinted, 1973)","edition":"4"},{"key":"1_CR62","volume-title":"Generatingfunctionology","author":"H.S. Wilf","year":"1990","unstructured":"Wilf, H.S.: Generatingfunctionology. Academic Press, London (1990)"},{"key":"1_CR63","doi-asserted-by":"publisher","first-page":"84","DOI":"10.1016\/0020-0190(80)90008-3","volume":"11","author":"A.C.C. Yao","year":"1980","unstructured":"Yao, A.C.C.: A note on the analysis of extendible hashing. Information Processing Letters\u00a011, 84\u201386 (1980)","journal-title":"Information Processing Letters"}],"container-title":["Lecture Notes in Computer Science","STACS 2006"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11672142_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,17]],"date-time":"2019-04-17T03:31:29Z","timestamp":1555471889000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11672142_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540323013","9783540322887"],"references-count":63,"URL":"https:\/\/doi.org\/10.1007\/11672142_1","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}