{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,14]],"date-time":"2025-10-14T11:27:08Z","timestamp":1760441228300,"version":"3.40.4"},"publisher-location":"Cham","reference-count":18,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319084039"},{"type":"electronic","value":"9783319084046"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-319-08404-6_10","type":"book-chapter","created":{"date-parts":[[2014,6,25]],"date-time":"2014-06-25T03:55:08Z","timestamp":1403668508000},"page":"110-121","source":"Crossref","is-referenced-by-count":2,"title":["Optimal Planar Orthogonal Skyline Counting Queries"],"prefix":"10.1007","author":[{"given":"Gerth St\u00f8lting","family":"Brodal","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kasper Green","family":"Larsen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"10_CR1","doi-asserted-by":"crossref","unstructured":"Chan, T.M., Larsen, K.G., P\u0103tra\u015fcu, M.: Orthogonal range searching on the RAM, revisited. In: 27th ACM Symposium on Computational Geometry, pp. 1\u201310. ACM (2011)","DOI":"10.1145\/1998196.1998198"},{"key":"10_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"558","DOI":"10.1007\/978-3-540-30551-4_49","volume-title":"Algorithms and Computation","author":"J. J\u00e1J\u00e1","year":"2004","unstructured":"J\u00e1J\u00e1, J., Mortensen, C.W., Shi, Q.: Space-efficient and fast algorithms for multidimensional dominance reporting and counting. In: Fleischer, R., Trippen, G. (eds.) ISAAC 2004. LNCS, vol.\u00a03341, pp. 558\u2013568. Springer, Heidelberg (2004)"},{"key":"10_CR3","doi-asserted-by":"crossref","unstructured":"P\u0103tra\u015fcu, M.: Lower bounds for 2-dimensional range counting. In: 39th Annual ACM Symposium on Theory of Computing, pp. 40\u201346. ACM (2007)","DOI":"10.1145\/1250790.1250797"},{"key":"10_CR4","doi-asserted-by":"crossref","unstructured":"P\u0103tra\u015fcu, M., Thorup, M.: Time-space trade-offs for predecessor search. In: 38th Annual ACM Symposium on Theory of Computing, pp. 232\u2013240. ACM (2006)","DOI":"10.1145\/1132516.1132551"},{"key":"10_CR5","doi-asserted-by":"crossref","unstructured":"Alstrup, S., Brodal, G.S., Rauhe, T.: New data structures for orthogonal range searching. In: 41st Annual Symposium on Foundations of Computer Science, pp. 198\u2013207. IEEE Computer Society (2000)","DOI":"10.1109\/SFCS.2000.892088"},{"key":"10_CR6","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)"},{"key":"10_CR7","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"263","DOI":"10.1007\/978-3-642-35926-2_28","volume-title":"International Workshop on Combinatorial Algorithms","author":"A.K. Kalavagattu","year":"2012","unstructured":"Kalavagattu, A.K., Agarwal, J., Das, A.S., Kothapalli, K.: Counting range maxima points in plane. In: Arumugam, S., Smyth, W.F. (eds.) IWOCA 2012. LNCS, vol.\u00a07643, pp. 263\u2013273. Springer, Heidelberg (2012)"},{"key":"10_CR8","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1007\/978-3-642-36065-7_8","volume-title":"WALCOM: Algorithms and Computation","author":"A.S. Das","year":"2013","unstructured":"Das, A.S., Gupta, P., Srinathan, K.: Counting maximal points in a query orthogonal rectangle. In: Ghosh, S.K., Tokuyama, T. (eds.) WALCOM 2013. LNCS, vol.\u00a07748, pp. 65\u201376. Springer, Heidelberg (2013)"},{"key":"10_CR9","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, Part I. LNCS, vol.\u00a06755, pp. 256\u2013267. Springer, Heidelberg (2011)"},{"key":"10_CR10","unstructured":"Kalavagattu, A.K., Das, A.S., Kothapalli, K., Srinathan, K.: On finding skyline points for range queries in plane. In: 23rd Annual Canadian Conference on Computational Geometry (2011)"},{"key":"10_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"271","DOI":"10.1007\/978-3-642-31155-0_24","volume-title":"Algorithm Theory \u2013 SWAT 2012","author":"Y. Nekrich","year":"2012","unstructured":"Nekrich, Y., Navarro, G.: Sorted range reporting. In: Fomin, F.V., Kaski, P. (eds.) SWAT 2012. LNCS, vol.\u00a07357, pp. 271\u2013282. Springer, Heidelberg (2012)"},{"issue":"3","key":"10_CR12","doi-asserted-by":"publisher","first-page":"615","DOI":"10.1145\/322261.322274","volume":"28","author":"A.C.C. Yao","year":"1981","unstructured":"Yao, A.C.C.: Should tables be sorted? Journal of the ACM\u00a028(3), 615\u2013628 (1981)","journal-title":"Journal of the ACM"},{"issue":"3","key":"10_CR13","doi-asserted-by":"publisher","first-page":"827","DOI":"10.1137\/09075336X","volume":"40","author":"M. P\u01cetra\u015fcu","year":"2011","unstructured":"P\u01cetra\u015fcu, M.: Unifying the landscape of cell-probe lower bounds. SIAM Journal on Computing\u00a040(3), 827\u2013847 (2011)","journal-title":"SIAM Journal on Computing"},{"key":"10_CR14","doi-asserted-by":"crossref","unstructured":"Beame, P., Fich, F.E.: Optimal bounds for the predecessor problem. In: 31st Annual ACM Symposium on Theory of Computing, pp. 295\u2013304. ACM (1999)","DOI":"10.1145\/301250.301323"},{"key":"10_CR15","unstructured":"Raman, R., Raman, V., Rao, S.S.: Succinct indexable dictionaries with applications to encoding k-ary trees and multisets. In: 13th Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 233\u2013242. SIAM (2002)"},{"key":"10_CR16","doi-asserted-by":"crossref","unstructured":"Raman, R., Raman, V., Satti, S.R.: Succinct indexable dictionaries with applications to encoding k-ary trees, prefix sums and multisets. ACM Transactions on Algorithms 3(4) (2007)","DOI":"10.1145\/1290672.1290680"},{"issue":"1","key":"10_CR17","doi-asserted-by":"publisher","first-page":"12","DOI":"10.1016\/j.jda.2006.03.011","volume":"5","author":"K. Sadakane","year":"2007","unstructured":"Sadakane, K.: Succinct data structures for flexible text retrieval systems. Journal of Discrete Algorithms\u00a05(1), 12\u201322 (2007)","journal-title":"Journal of Discrete Algorithms"},{"key":"10_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"158","DOI":"10.1007\/978-3-642-12200-2_16","volume-title":"LATIN 2010: Theoretical Informatics","author":"J. Fischer","year":"2010","unstructured":"Fischer, J.: Optimal succinctness for range minimum queries. In: L\u00f3pez-Ortiz, A. (ed.) LATIN 2010. LNCS, vol.\u00a06034, pp. 158\u2013169. Springer, Heidelberg (2010)"}],"container-title":["Lecture Notes in Computer Science","Algorithm Theory \u2013 SWAT 2014"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-08404-6_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,3]],"date-time":"2025-05-03T13:06:23Z","timestamp":1746277583000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-08404-6_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319084039","9783319084046"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-08404-6_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}