{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T22:56:38Z","timestamp":1725663398945},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540176602"},{"type":"electronic","value":"9783540477464"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1987]]},"DOI":"10.1007\/3-540-17660-8_44","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T19:17:14Z","timestamp":1330197434000},"page":"13-25","source":"Crossref","is-referenced-by-count":0,"title":["Average complexity of additive properties for multiway tries: A unified approach"],"prefix":"10.1007","author":[{"given":"Wojciech","family":"Szpankowski","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,3]]},"reference":[{"key":"2_CR1","unstructured":"Aho, A., Hopcroft, J. and Ullman, J., Data structures and algorithms, Addison-Wesley, 1983."},{"key":"2_CR2","unstructured":"Frdelyi, A., Higher transcendental functions, McGraw-Hill Book, 1953."},{"key":"2_CR3","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. and Strong H., Extendible hashing: A fast access method for dynamic files, ACM TODS\n                4, 1979, 315\u2013344.","journal-title":"ACM TODS"},{"issue":"2","key":"2_CR4","doi-asserted-by":"publisher","first-page":"244","DOI":"10.1109\/TIT.1985.1057014","volume":"IT-31","author":"P. Fayolle","year":"1985","unstructured":"Fayolle, Ph., Flajolet, Ph, Hofri, M. and Jacquet, Ph., Analysis of a stack algorithm for random multiple-access communication, IEEE Trans. on Information Theory, IT-31, 2, 1985, 244\u2013254.","journal-title":"IEEE Trans. on Information Theory"},{"key":"2_CR5","doi-asserted-by":"publisher","first-page":"345","DOI":"10.1007\/BF00264279","volume":"20","author":"P. Flajolet","year":"1983","unstructured":"Flajolet, Ph., On the performance evaluation of extendible hashing and trie searching, Acta Informatica 20, 1983, 345\u2013369.","journal-title":"Acta Informatica"},{"key":"2_CR6","doi-asserted-by":"publisher","first-page":"748","DOI":"10.1137\/0215054","volume":"15","author":"P. Flajolet","year":"1986","unstructured":"Flajolet, Ph. and Sedgewick R., Digital search trees revisited, SIAM J. Compt., 15, 1986, pp. 748\u2013767.","journal-title":"SIAM J. Compt."},{"key":"2_CR7","unstructured":"Flajolet, Ph., Mathematical methods in the analysis of algorithms and data structures, INRIA Technical Report, 400, 1985."},{"key":"2_CR8","unstructured":"Gonnet G., Handbook of algorithms and data structures, Addison-Wesley, 1984."},{"key":"2_CR9","volume-title":"Applied and computational complex analysis","author":"P. Henrici","year":"1977","unstructured":"Henrici, P., Applied and computational complex analysis, John Wiley & Sons, New York 1977."},{"key":"2_CR10","unstructured":"Jacquet, Ph. and Regnier, M., Limiting distributions for trie parameters, Proc. of CAAP'86, 1985."},{"key":"2_CR11","unstructured":"Kirschenhofer, P. and Prodinger, H., Some further results on digital trees, ICALP 86, to appear."},{"key":"2_CR12","unstructured":"Knuth, D., The art of computer programming, Addison-Wesley, 1973."},{"key":"2_CR13","unstructured":"Szpankowski, W., Analysis of a recurrence equation arising in stack-type algorithms for collision-detecting channels, Proc. Intern. seminar on Computer Networking and Performance Evaluation, Tokyo 1985, 9-3-1\u20139-3-12."},{"key":"2_CR14","unstructured":"Szpankowski, W., Some results on the V-ary asymmetric tries, Purdue University, CDS-TR-582, 1985."},{"key":"2_CR15","unstructured":"Riordan, J., Combinatorial identities, John Wiley & Sons, 1968."},{"key":"2_CR16","unstructured":"Whittaker, E. and Watson, G., A course of modern analysis, Cambridge Press, 1935."},{"key":"2_CR17","unstructured":"Paige, R., Tarjan, R., Three efficient algorithms based on partition refinement, preprint."}],"container-title":["Lecture Notes in Computer Science","TAPSOFT '87"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-17660-8_44.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T21:11:45Z","timestamp":1619557905000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-17660-8_44"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1987]]},"ISBN":["9783540176602","9783540477464"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/3-540-17660-8_44","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1987]]}}}