{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,4,18]],"date-time":"2024-04-18T07:49:39Z","timestamp":1713426579202},"reference-count":29,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[1992,9,1]],"date-time":"1992-09-01T00:00:00Z","timestamp":715305600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["BIT"],"published-print":{"date-parts":[[1992,9]]},"DOI":"10.1007\/bf02074876","type":"journal-article","created":{"date-parts":[[2005,8,13]],"date-time":"2005-08-13T21:58:03Z","timestamp":1123970283000},"page":"384-402","source":"Crossref","is-referenced-by-count":15,"title":["Page usage in a quadtree index"],"prefix":"10.1007","volume":"32","author":[{"given":"Mamoru","family":"Hoshi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Philippe","family":"Flajolet","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"BF02074876_CR1","doi-asserted-by":"crossref","unstructured":"Berndt, B. C.Ramanujan's Notebooks, Part I. Springer Verlag, 1985.","DOI":"10.1007\/978-1-4612-1088-7"},{"key":"BF02074876_CR2","unstructured":"Bronstein, M.On solutions of linear ordinary differential equations in their coefficient field. Tech. Rep. 152, Department Informatik, ETH, January 1991."},{"key":"BF02074876_CR3","unstructured":"Char, B. W., Geddes, K. O., Gonnet, G. H., Monagan, M. B. and Watt, S. M.MAPLE: Reference Manual. University of Waterloo, 1988. 5th edition."},{"issue":"3","key":"BF02074876_CR4","doi-asserted-by":"crossref","first-page":"193","DOI":"10.1007\/BF00299632","volume":"26","author":"W. Cunto","year":"1988","unstructured":"Cunto, W. and Poblete, P.Transforming multiway trees into a practical external data structure. Acta Informatica 26, 3 (1988), 193\u2013212.","journal-title":"Acta Informatica"},{"key":"BF02074876_CR5","doi-asserted-by":"crossref","first-page":"821","DOI":"10.1137\/0219057","volume":"19","author":"L. Devroye","year":"1990","unstructured":"Devroye, L. and Laforest, L.An analysis of random d-dimensional quad trees. SIAM Journal on Computing 19 (1990), 821\u2013832.","journal-title":"SIAM Journal on Computing"},{"key":"BF02074876_CR6","doi-asserted-by":"crossref","first-page":"315","DOI":"10.1145\/320083.320092","volume":"4","author":"R. Fagin","year":"1979","unstructured":"Fagin, R., Nievergelt, J., Pippenger, N. and Strong, R.Extendible hashing: A fast access method for dynamic files. A.C.M. Trans. Database Syst. 4 (1979), 315\u2013344.","journal-title":"A.C.M. Trans. Database Syst."},{"key":"BF02074876_CR7","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BF00288933","volume":"4","author":"R. A. Finkel","year":"1974","unstructured":"Finkel, R. A. and Bentley, J. L.Quad trees, a data structure for retrieval on composite keys. Acta Informatica 4 (1974), 1\u20139.","journal-title":"Acta Informatica"},{"key":"BF02074876_CR8","doi-asserted-by":"crossref","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 Inf. 20 (1983), 345\u2013369.","journal-title":"Acta Inf."},{"key":"BF02074876_CR9","unstructured":"Flajolet, P., Gonnet, G., Puech, C. and Robson, J. M.The analysis of multidimensional searching in quad-trees. In Proceedings of the Second Annual ACM-SIAM Symposium on Discrete Algorithms (Philadelphia, 1991), SIAM Press, pp. 100\u2013109."},{"key":"BF02074876_CR10","doi-asserted-by":"crossref","unstructured":"Flajolet, P., Gonnet, G., Puech, C. and Robson, J. M.Analytic variations on quadtrees. Algorithmica (1992). 24 pages, to appear.","DOI":"10.1007\/BF01891833"},{"issue":"2","key":"BF02074876_CR11","doi-asserted-by":"crossref","first-page":"216","DOI":"10.1137\/0403019","volume":"3","author":"P. Flajolet","year":"1990","unstructured":"Flajolet, P. and Odlyzko, A. M.Singularity analysis of generating functions. SIAM Journal on Discrete Mathematics 3, 2 (1990), 216\u2013240.","journal-title":"SIAM Journal on Discrete Mathematics"},{"issue":"2","key":"BF02074876_CR12","doi-asserted-by":"crossref","first-page":"371","DOI":"10.1145\/5383.5453","volume":"33","author":"P. Flajolet","year":"1986","unstructured":"Flajolet, P. and Puech, C.Partial match retrieval of multidimensional data. Journal of the ACM 33, 2 (1986), 371\u2013407.","journal-title":"Journal of the ACM"},{"key":"BF02074876_CR13","unstructured":"Flajolet, P. and Richmond, B.Generalized digital trees and their difference-differential equations, Apr. 1991. 15 pages. INRIA Research Report, in press. Also submitted to Random Structures and Algorithms."},{"key":"BF02074876_CR14","unstructured":"Gonnet, G. H. and Baeza-Yates, R.Handbook of Algorithms and Data Structures: in Pascal and C, Second ed. Addison-Wesley, 1991."},{"key":"BF02074876_CR15","unstructured":"Hennequin, P.Analyse en moyenne d'algorithmes, tri rapide et arbres de recherche. PhD thesis, \u00c9cole Polytechnique 1991."},{"key":"BF02074876_CR16","unstructured":"Knuth, D. E.The Art of Computer Programming, vol. 3: Sorting and Searching. Addison-Wesley, 1973."},{"key":"BF02074876_CR17","unstructured":"Labelle, G. and Laforest, L.Variations combinatoires autour des arborescences hyperquaternaires. Tech. rep., LACIM, UQAM, Montreal, November 1991."},{"key":"BF02074876_CR18","unstructured":"Laforest, L.\u00c9tude des arbres hyperquaternaires. Tech. Rep. 3, LACIM, UQAM, Montreal, Nov. 1990. (Author's PhD Thesis at McGill University)."},{"key":"BF02074876_CR19","doi-asserted-by":"crossref","first-page":"184","DOI":"10.1007\/BF01931695","volume":"18","author":"P. \u00c5. Larson","year":"1978","unstructured":"Larson, P. \u00c5.Dynamic hashing. BIT 18 (1978), 184\u2013201.","journal-title":"BIT"},{"key":"BF02074876_CR20","volume-title":"Polylogarithms and Associated Functions","author":"L. Lewin","year":"1981","unstructured":"Lewin, L.Polylogarithms and Associated Functions. North-Holland, New York, 1981."},{"key":"BF02074876_CR21","doi-asserted-by":"crossref","first-page":"52","DOI":"10.1016\/0196-6774(89)90023-0","volume":"10","author":"H. M. Mahmoud","year":"1989","unstructured":"Mahmoud, H. M. and Pittel, B.Analysis of the space of search trees under the random insertion algorithm. J. Algorithms 10 (1989), 52\u201375.","journal-title":"J. Algorithms"},{"key":"BF02074876_CR22","doi-asserted-by":"crossref","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 25 (1985), 335\u2013357.","journal-title":"BIT"},{"key":"BF02074876_CR23","unstructured":"Samet, H.The Design and Analysis of Special Data Structures. Addison-Wesley, 1990."},{"key":"BF02074876_CR24","volume-title":"Algorithms","author":"R. Sedgewick","year":"1988","unstructured":"Sedgewick, R.Algorithms, second ed. Addison-Wesley, Reading, Mass., 1988.","edition":"second"},{"key":"BF02074876_CR25","first-page":"431","volume-title":"Handbook of Theoretical Computer Science","author":"J. S. Vitter","year":"1990","unstructured":"Vitter, J. S. and Flajolet, P.Analysis of algorithms and data structures. InHandbook of Theoretical Computer Science, J. van Leeuwen, Ed., vol. A: Algorithms and Complexity. North Holland, 1990, ch. 9, pp. 431\u2013524."},{"key":"BF02074876_CR26","unstructured":"Wasow, W.Asymptotic Expansions for Ordinary Differential Equations. Dover, 1987. A reprint of the John Wiley edition, 1965."},{"key":"BF02074876_CR27","unstructured":"Whittaker, E. T. and Watson, G. N.A Course of Modern Analysis, fourth ed. Cambridge University Press, 1927. Reprinted 1973."},{"issue":"2","key":"BF02074876_CR28","doi-asserted-by":"crossref","first-page":"159","DOI":"10.1007\/BF00289075","volume":"9","author":"A. C.-C. Yao","year":"1978","unstructured":"Yao, A. C.-C.On random 2\u20133trees. Acta Informatica 9, 2 (1978), 159\u2013170.","journal-title":"Acta Informatica"},{"key":"BF02074876_CR29","unstructured":"Mahmoud, H. M.Evolution of Random Search Trees, Wiley, 1992."}],"container-title":["BIT"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02074876.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF02074876\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02074876","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,9]],"date-time":"2020-04-09T00:23:54Z","timestamp":1586391834000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF02074876"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1992,9]]},"references-count":29,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1992,9]]}},"alternative-id":["BF02074876"],"URL":"https:\/\/doi.org\/10.1007\/bf02074876","relation":{},"ISSN":["0006-3835","1572-9125"],"issn-type":[{"value":"0006-3835","type":"print"},{"value":"1572-9125","type":"electronic"}],"subject":[],"published":{"date-parts":[[1992,9]]}}}