{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T22:54:11Z","timestamp":1725663251510},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540126898"},{"type":"electronic","value":"9783540386827"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1983]]},"DOI":"10.1007\/3-540-12689-9_100","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T12:52:04Z","timestamp":1330174324000},"page":"141-158","source":"Crossref","is-referenced-by-count":0,"title":["Methods in the analysis of algorithms : Evaluations of a recursive partitioning process"],"prefix":"10.1007","author":[{"given":"Philippe","family":"Flajolet","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,5,31]]},"reference":[{"key":"12_CR1","volume-title":"Data Structures and Algorithms","author":"A. Aho","year":"1983","unstructured":"A. Aho, J. Hopcroft, J. Ullman: \"Data Structures and Algorithms\", Addison Wesley, Reading (1983)."},{"key":"12_CR2","unstructured":"G. Fayolle, P. Flajolet, M. Hofri: \"A Functional Equation Arising in the Analysis of a Protocol for a Multiaccess Broadcast Channel\", INRIA Research Report no 131, 36 pages."},{"key":"12_CR3","unstructured":"P. Flajolet, J-M. Steyaert: \"A Complexity Calculus for Classes of Recursive Search Programs Over Tree Structures\" in 22nd IEEE FOCS Symp., Nashville (1982), pp. 386\u2013393."},{"key":"12_CR4","doi-asserted-by":"publisher","first-page":"315","DOI":"10.1145\/320083.320092","volume":"4","author":"R. Fagin","year":"1979","unstructured":"R. Fagin, J. Nievergelt, N. Pippenger, R. Strong: \"Extendible Hahing-A Fast Access Method for Dynamic Files\", ACM TODS, 4 (1979), pp. 315\u2013344.","journal-title":"ACM TODS"},{"key":"12_CR5","unstructured":"P. Flajolet, N. Saheb: \"Digital Search Trees and the Complexity of Generating an Exponentially Distributed Variate\", in CAAP 82, Lecture Notes in Comp. Sc. (to appear)."},{"key":"12_CR6","unstructured":"P. Flajolet, D. Sotteau: \"A Recursive Partitioning Process of Computer Science\", in IInd World Conference on Mathematics at the Service of Man, Las Palmas (1982), pp. 25\u201330."},{"key":"12_CR7","doi-asserted-by":"crossref","first-page":"239","DOI":"10.1007\/BFb0012773","volume":"140","author":"P. Flajolet","year":"1982","unstructured":"P. Flajolet, J-M. Steyaert: \"A Branching Process Arising in Dynamic Hashing Trie Searching and Polynomial Factorization\", ICALP 82, Lectures Notes in Comp. Sc. 140, (1982), pp. 239\u2013251.","journal-title":"Lectures Notes in Comp. Sc."},{"key":"12_CR8","doi-asserted-by":"crossref","unstructured":"P. Flajolet, C. Puech: \"Tree Structures for Partial Match Retrieval of Multidimensional Data\", submitted for publication (1983).","DOI":"10.1109\/SFCS.1983.79"},{"key":"12_CR9","volume-title":"\"Applied and Computational Complex Analysis\", vol. 2","author":"P. Henrici","year":"1978","unstructured":"P. Henrici: \"Applied and Computational Complex Analysis\", vol. 2, J. Wiley New York (1978)."},{"key":"12_CR10","unstructured":"D.E. Knuth: \"Mathematical Analysis of Algorithms\", in IFIP Congress 1971, Ljubljana."},{"key":"12_CR11","volume-title":"\"The Art of Computer Programming\", vol. 3","author":"D.E. Knuth","year":"1973","unstructured":"D.E. Knuth: \"The Art of Computer Programming\", vol. 3, Addison Wesley, Reading (1973)."},{"key":"12_CR12","doi-asserted-by":"crossref","first-page":"184","DOI":"10.1007\/BF01931695","volume":"18","author":"P.A. Larson","year":"1978","unstructured":"P.A. Larson: \"Dynamic Hashing\", BIT, 18(1978), pp. 184\u2013201.","journal-title":"BIT"},{"key":"12_CR13","unstructured":"W. Litwin: \"Virtual Hashing: A Dynamically Changing Hashing\", in Proc. VLDB Conf., Berlin (1978), pp. 517\u2013523."},{"key":"12_CR14","unstructured":"J.L. Massey: \"Collision Resolution Algorithms and Random Access Communication\", in Multi-User Communication Systems, CISM Lectures no 265, G. Longo Ed., Springer Verlag (1980)."},{"key":"12_CR15","doi-asserted-by":"crossref","unstructured":"J. Nievergelt, H. Hinterberger, K. Sevick: \"The Grid File: An Adaptable Symmetric Multikey File Structure\", ETH Report 46 (1981).","DOI":"10.1007\/3-540-10885-8_45"},{"key":"12_CR16","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1137\/0205003","volume":"51","author":"R.L. Rivest","year":"1976","unstructured":"R.L. Rivest: \"Partial Match Retrieval Algorithms\", SIAM J. Comp. 51 (1976), pp. 19\u201350.","journal-title":"SIAM J. Comp."},{"key":"12_CR17","unstructured":"M. Regnier: \"Evaluation des Performances du Hachage Dynamique\", Thesis, University of Paris-Orsay (1983)."},{"key":"12_CR18","volume-title":"Probability Theory and Computer Science","author":"R. Sedgewick","year":"1982","unstructured":"R. Sedgewick: \"Mathematical Analysis of Combinatorial Algorithms\", in Probability Theory and Computer Science, G. Louchard, G. Latouche Ed., Academic Press, New York (1982)."},{"key":"12_CR19","volume-title":"Algorithms","author":"R. Sedgewick","year":"1983","unstructured":"R. Sedgewick: \"Algorithms\", Addison-Wesley, Reading (1983)."},{"key":"12_CR20","unstructured":"L. Trabb Pardo: \"Set Representation and Set Intersection\", Stanford Univ. Report CS-78-681 (1978)."}],"container-title":["Lecture Notes in Computer Science","Foundations of Computation Theory"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-12689-9_100.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T15:05:51Z","timestamp":1605625551000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-12689-9_100"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1983]]},"ISBN":["9783540126898","9783540386827"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/3-540-12689-9_100","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1983]]}}}