{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T03:19:48Z","timestamp":1725851988822},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783662495285"},{"type":"electronic","value":"9783662495292"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"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":[[2016]]},"DOI":"10.1007\/978-3-662-49529-2_28","type":"book-chapter","created":{"date-parts":[[2016,3,21]],"date-time":"2016-03-21T04:09:41Z","timestamp":1458533381000},"page":"376-389","source":"Crossref","is-referenced-by-count":1,"title":["Random Partial Match in Quad-K-d Trees"],"prefix":"10.1007","author":[{"given":"A.","family":"Duch","sequence":"first","affiliation":[]},{"given":"G.","family":"Lau","sequence":"additional","affiliation":[]},{"given":"C.","family":"Mart\u00ednez","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,3,22]]},"reference":[{"issue":"9","key":"28_CR1","doi-asserted-by":"publisher","first-page":"509","DOI":"10.1145\/361002.361007","volume":"18","author":"JL Bentley","year":"1975","unstructured":"Bentley, J.L.: Multidimensional binary search trees used for associative searching. Commun. ACM 18(9), 509\u2013517 (1975)","journal-title":"Commun. ACM"},{"key":"28_CR2","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/BF00288933","volume":"4","author":"JL Bentley","year":"1974","unstructured":"Bentley, J.L., Finkel, R.A.: Quad trees: a data structure for retrieval on composite keys. Acta Informatica 4, 1\u20139 (1974)","journal-title":"Acta Informatica"},{"key":"28_CR3","doi-asserted-by":"publisher","first-page":"126","DOI":"10.1016\/j.tcs.2015.12.030","volume":"616","author":"N Bereczky","year":"2016","unstructured":"Bereczky, N., Duch, A., N\u00e9meth, K., Roura, S.: Quad-kd trees: a general framework for kd trees and quad trees. Theor. Comput. Sci. 616, 126\u2013140 (2016). doi:\n                    10.1016\/j.tcs.2015.12.030","journal-title":"Theor. Comput. Sci."},{"issue":"6","key":"28_CR4","doi-asserted-by":"publisher","first-page":"2560","DOI":"10.1214\/12-AAP912","volume":"23","author":"N Broutin","year":"2013","unstructured":"Broutin, N., Neininger, R., Sulzbach, H.: A limit process for partial match queries in random quadtrees and 2-d trees. Ann. Appl. Probab. 23(6), 2560\u20132603 (2013)","journal-title":"Ann. Appl. Probab."},{"issue":"6","key":"28_CR5","doi-asserted-by":"publisher","first-page":"1440","DOI":"10.1137\/S0097539703437491","volume":"35","author":"H-H Chern","year":"2006","unstructured":"Chern, H.-H., Hwang, H.-K.: Partial match queries in random \n                    \n                      \n                    \n                    $$k$$\n                  -d trees. SIAM J. Comput. 35(6), 1440\u20131466 (2006)","journal-title":"SIAM J. Comput."},{"issue":"4","key":"28_CR6","doi-asserted-by":"publisher","first-page":"904","DOI":"10.1137\/S0097539702412131","volume":"32","author":"H-H Chern","year":"2003","unstructured":"Chern, H.-H., Hwang, H.-K.: Partial match queries in random quadtrees. SIAM J. Comput. 32(4), 904\u2013915 (2003)","journal-title":"SIAM J. Comput."},{"key":"28_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"24","DOI":"10.1007\/3-540-51542-9_4","volume-title":"Workshop on Algorithms and Data Structures","author":"W Cunto","year":"1989","unstructured":"Cunto, W., Lau, G., Flajolet, P.: Analysis of \n                    \n                      \n                    \n                    $$k$$\n                  d\n                    \n                      \n                    \n                    $$t$$\n                  -trees: \n                    \n                      \n                    \n                    $$k$$\n                  d-trees improved by local reorganisations. In: Dehne, F., Sack, J.R., Santoro, N. (eds.) WADS 1989. LNCS, vol. 382, pp. 24\u201338. Springer, Heidelberg (1989)"},{"issue":"1","key":"28_CR8","doi-asserted-by":"publisher","first-page":"178","DOI":"10.1239\/aap\/1300198518","volume":"43","author":"N Curien","year":"2011","unstructured":"Curien, N., Joseph, A.: Partial match queries in two-dimensional quadtrees: a probabilistic approach. Adv. Appl. Probab. 43(1), 178\u2013194 (2011)","journal-title":"Adv. Appl. Probab."},{"key":"28_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"199","DOI":"10.1007\/3-540-49381-6_22","volume-title":"Algorithms and Computation","author":"A Duch","year":"1998","unstructured":"Duch, A., Estivill-Castro, V., Mart\u00ednez, C.: Randomized \n                    \n                      \n                    \n                    $$K$$\n                  -dimensional binary search trees. In: Chwa, K.-Y., Ibarra, O.H. (eds.) ISAAC 1998. LNCS, vol. 1533, pp. 199\u2013208. Springer, Heidelberg (1998)"},{"issue":"4","key":"28_CR10","doi-asserted-by":"publisher","first-page":"684","DOI":"10.1007\/s00453-015-0097-4","volume":"75","author":"Amalia Duch","year":"2015","unstructured":"Duch, A., Lau, G., Mart\u00ednez, C.: On the cost of fixed partial match queries in \n                    \n                      \n                    \n                    $$K$$\n                  -d trees. Algorithmica (2016). doi:\n                    10.1007\/s00453-015-0097-4","journal-title":"Algorithmica"},{"issue":"2","key":"28_CR11","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. J. ACM 33(2), 371\u2013407 (1986)","journal-title":"J. ACM"},{"issue":"6","key":"28_CR12","doi-asserted-by":"publisher","first-page":"473","DOI":"10.1007\/BF01891833","volume":"10","author":"P Flajolet","year":"1993","unstructured":"Flajolet, P., Gonnet, G.H., Puech, C., Robson, J.M.: Analytic variations on quadtrees. Algorithmica 10(6), 473\u2013500 (1993)","journal-title":"Algorithmica"},{"issue":"2","key":"28_CR13","doi-asserted-by":"publisher","first-page":"170","DOI":"10.1145\/280277.280279","volume":"30","author":"V Gaede","year":"1998","unstructured":"Gaede, V., G\u00fcnther, O.: Multidimensional access methods. ACM Comput. Surv. 30(2), 170\u2013231 (1998)","journal-title":"ACM Comput. Surv."},{"issue":"1\u20132","key":"28_CR14","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1007\/BF02679618","volume":"29","author":"C Mart\u00ednez","year":"2001","unstructured":"Mart\u00ednez, C., Panholzer, A., Prodinger, H.: Partial match queries in relaxed multidimensional search trees. Algorithmica 29(1\u20132), 181\u2013204 (2001)","journal-title":"Algorithmica"},{"issue":"2","key":"28_CR15","doi-asserted-by":"publisher","first-page":"170","DOI":"10.1145\/375827.375837","volume":"48","author":"S Roura","year":"2001","unstructured":"Roura, S.: Improved master theorems for divide-and-conquer recurrences. J. ACM 48(2), 170\u2013205 (2001)","journal-title":"J. ACM"},{"key":"28_CR16","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-Wesley, Reading (1990)"}],"container-title":["Lecture Notes in Computer Science","LATIN 2016: Theoretical Informatics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-49529-2_28","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,1]],"date-time":"2019-06-01T16:18:15Z","timestamp":1559405895000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-662-49529-2_28"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783662495285","9783662495292"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-49529-2_28","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]}}}