{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T01:45:50Z","timestamp":1725500750527},"publisher-location":"Berlin, Heidelberg","reference-count":10,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642360640"},{"type":"electronic","value":"9783642360657"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-36065-7_8","type":"book-chapter","created":{"date-parts":[[2013,1,21]],"date-time":"2013-01-21T16:36:53Z","timestamp":1358786213000},"page":"65-76","source":"Crossref","is-referenced-by-count":1,"title":["Counting Maximal Points in a Query Orthogonal Rectangle"],"prefix":"10.1007","author":[{"given":"Ananda Swarup","family":"Das","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Prosenjit","family":"Gupta","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kannan","family":"Srinathan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"8_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"256","DOI":"10.1007\/978-3-642-22006-7_22","volume-title":"Automata, Languages and Programming","author":"G.S. Brodal","year":"2011","unstructured":"Brodal, G.S., Tsakalidis, K.: Dynamic Planar Range Maxima Queries. In: Aceto, L., Henzinger, M., Sgall, J. (eds.) ICALP 2011. LNCS, vol.\u00a06755, pp. 256\u2013267. Springer, Heidelberg (2011)"},{"key":"8_CR2","unstructured":"Clark, D.R., Munro, J.I.: Efficient suffix trees on secondary storage (extended abstract). In: SODA, pp. 383\u2013391 (1996)"},{"key":"8_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"52","DOI":"10.1007\/978-3-642-28076-4_8","volume-title":"WALCOM: Algorithms and Computation","author":"A.S. Das","year":"2012","unstructured":"Das, A.S., Gupta, P., Kalavagattu, A.K., Agarwal, J., Srinathan, K., Kothapalli, K.: Range Aggregate Maximal Points in the Plane. In: Rahman, M. S., Nakano, S.-I. (eds.) WALCOM 2012. LNCS, vol.\u00a07157, pp. 52\u201363. Springer, Heidelberg (2012)"},{"issue":"2","key":"8_CR4","doi-asserted-by":"publisher","first-page":"338","DOI":"10.1137\/0213024","volume":"13","author":"D. Harel","year":"1984","unstructured":"Harel, D., Tarjan, R.E.: Fast algorithms for finding nearest common ancestors. SIAM J. Comput.\u00a013(2), 338\u2013355 (1984)","journal-title":"SIAM J. Comput."},{"key":"8_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"263","DOI":"10.1007\/978-3-642-35926-2_28","volume-title":"IWOCA 2012","author":"A.K. Kalavagattu","year":"2012","unstructured":"Kalavagattu, A.K., Agarwal, J., Das, A.S., Kothapalli, K.: On Counting Range Maxima Points in Plane. In: Arumugam, S., Smyth, B. (eds.) IWOCA 2012. LNCS, vol.\u00a07643, pp. 263\u2013273. Springer, Heidelberg (2012)"},{"key":"8_CR6","unstructured":"Kalavagattu, A.K., Das, A.S., Kothapalli, K., Srinathan, K.: On finding skyline points for range queries in plane. In: CCCG (2011)"},{"issue":"1","key":"8_CR7","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1142\/S0218195909002800","volume":"19","author":"Y. Nekrich","year":"2009","unstructured":"Nekrich, Y.: A linear space data structure for orthogonal range reporting and emptiness queries. Int. J. Comput. Geometry Appl.\u00a019(1), 1\u201315 (2009)","journal-title":"Int. J. Comput. Geometry Appl."},{"key":"8_CR8","doi-asserted-by":"crossref","unstructured":"van Emde Boas, P.: Preserving order in a forest in less than logarithmic time. In: FOCS, pp. 75\u201384 (1975)","DOI":"10.1109\/SFCS.1975.26"},{"issue":"3","key":"8_CR9","doi-asserted-by":"publisher","first-page":"148","DOI":"10.1016\/j.comgeo.2010.09.001","volume":"44","author":"C.C. Yu","year":"2011","unstructured":"Yu, C.C., Hon, W.K., Wang, B.F.: Improved data structures for the orthogonal range successor problem. Comput. Geom.\u00a044(3), 148\u2013159 (2011)","journal-title":"Comput. Geom."},{"key":"8_CR10","doi-asserted-by":"crossref","unstructured":"Yuan, H., Atallah, M.J.: Data structures for range minimum queries in multidimensional arrays. In: SODA, pp. 150\u2013160 (2010)","DOI":"10.1137\/1.9781611973075.14"}],"container-title":["Lecture Notes in Computer Science","WALCOM: Algorithms and Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-36065-7_8.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,4]],"date-time":"2021-05-04T13:35:04Z","timestamp":1620135304000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-36065-7_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642360640","9783642360657"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-36065-7_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}