{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,16]],"date-time":"2026-07-16T05:48:31Z","timestamp":1784180911697,"version":"3.55.0"},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540206958","type":"print"},{"value":"9783540245872","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/978-3-540-24587-2_53","type":"book-chapter","created":{"date-parts":[[2010,7,29]],"date-time":"2010-07-29T08:59:19Z","timestamp":1280393959000},"page":"517-526","source":"Crossref","is-referenced-by-count":8,"title":["Range Mode and Range Median Queries on Lists and Trees"],"prefix":"10.1007","author":[{"given":"Danny","family":"Krizanc","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Pat","family":"Morin","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Michiel","family":"Smid","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"53_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"88","DOI":"10.1007\/10719839_9","volume-title":"LATIN 2000: Theoretical Informatics","author":"M.A. Bender","year":"2000","unstructured":"Bender, M.A., Farach-Colton, M.: The LCA problem revisited. In: Gonnet, G.H., Viola, A. (eds.) LATIN 2000. LNCS, vol.\u00a01776, pp. 88\u201394. Springer, Heidelberg (2000)"},{"key":"53_CR2","doi-asserted-by":"crossref","unstructured":"Berkman, O., Breslauer, D., Galil, Z., Schieber, B., Vishkin, U.: Highly parallelizable problems. In: Proceedings of teh 21st Annual ACM Symposium on the Theory of Computing, pp. 309\u2013319 (1989)","DOI":"10.1145\/73007.73036"},{"key":"53_CR3","doi-asserted-by":"crossref","unstructured":"Chazelle, B.: A theorem on polygon cutting with applications. In: Proceedings of the IEEE Symposium on Foundations of Computer Science, pp. 339\u2013349 (1982)","DOI":"10.1109\/SFCS.1982.58"},{"key":"53_CR4","doi-asserted-by":"publisher","first-page":"329","DOI":"10.1007\/BF01762121","volume":"3","author":"R. Cole","year":"1988","unstructured":"Cole, R., Vishkin, U.: The accelerated centroid decomposition technique for optimal parallel tree evaluation in logarithmic time. Algorithmica\u00a03, 329\u2013346 (1988)","journal-title":"Algorithmica"},{"issue":"1","key":"53_CR5","doi-asserted-by":"publisher","first-page":"86","DOI":"10.1016\/0022-0000(89)90034-2","volume":"38","author":"J.R. Driscoll","year":"1989","unstructured":"Driscoll, J.R., Sarnak, N., Sleator, D.D., Tarjan, R.E.: Making data structures persistent. Journal of Computer and System Sciences\u00a038(1), 86\u2013124 (1989)","journal-title":"Journal of Computer and System Sciences"},{"key":"53_CR6","unstructured":"Krijnen, T., Meertens, L.G.L.T.: Making B-trees work for B. Technical Report 219\/83, The Mathematical Center, Amsterdam (1983)"},{"key":"53_CR7","doi-asserted-by":"crossref","unstructured":"Luecker, G.S.: A data structure for orthogonal range queries. In: Proceedings of the 19th IEEE Symposium on Foundations of Computer Science, pp. 28\u201334 (1978)","DOI":"10.1109\/SFCS.1978.1"},{"key":"53_CR8","unstructured":"Myers, E.W.: AVL dags. Technical Report 82-9, Department of Computer Science, University of Arizona (1982)"},{"key":"53_CR9","doi-asserted-by":"crossref","unstructured":"Myers, E.W.: Efficient applicative data structures. In: Conference Record eleventh Annual ACM Symposium on Principles of Programming Languages, pp. 66\u201375 (1984)","DOI":"10.1145\/800017.800517"},{"key":"53_CR10","doi-asserted-by":"publisher","first-page":"449","DOI":"10.1145\/2166.357218","volume":"5","author":"T. Reps","year":"1983","unstructured":"Reps, T., Teitelbaum, T., Demers, A.: Incremental context-dependent analysis for language-based editors. ACM Transactions on Programming Languages and Systems\u00a05, 449\u2013477 (1983)","journal-title":"ACM Transactions on Programming Languages and Systems"},{"key":"53_CR11","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1093\/comjnl\/28.1.5","volume":"1","author":"N. Santoro","year":"1985","unstructured":"Santoro, N., Khatib, R.: Labelling and implicit routing in networks. The Computer Journal\u00a01, 5\u20138 (1985)","journal-title":"The Computer Journal"},{"issue":"7","key":"53_CR12","doi-asserted-by":"publisher","first-page":"669","DOI":"10.1145\/6138.6151","volume":"29","author":"N. Sarnak","year":"1986","unstructured":"Sarnak, N., Tarjan, R.E.: Planar point location using persistent search trees. Communications of the ACM\u00a029(7), 669\u2013679 (1986)","journal-title":"Communications of the ACM"},{"key":"53_CR13","unstructured":"Swart, G.: Efficient algorithms for computing geometric intersections. Technical Report #85-01-02, Department of Computer Science, University of Washington, Seattle (1985)"},{"key":"53_CR14","unstructured":"Thorup, M.: On RAM priority queues. In: Proceedings of the 7th ACM-SIAM Symposium on Discrete Algorithms, pp. 59\u201367 (1996)"},{"key":"53_CR15","doi-asserted-by":"publisher","first-page":"80","DOI":"10.1016\/0020-0190(77)90031-X","volume":"6","author":"P. Emde Boas van","year":"1977","unstructured":"van Emde Boas, P.: Preserving order in a forest in less than logarithmic time and linear space. Information Processing Letters\u00a06, 80\u201382 (1977)","journal-title":"Information Processing Letters"},{"issue":"2","key":"53_CR16","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1016\/0020-0190(83)90075-3","volume":"17","author":"D.E. Willard","year":"1983","unstructured":"Willard, D.E.: Log-logarithmic worst-case range queries are possible in space \u03b8(n). Information Processing Letters\u00a017(2), 81\u201384 (1983)","journal-title":"Information Processing Letters"},{"key":"53_CR17","doi-asserted-by":"crossref","unstructured":"Willard, D.E.: New data structures for orthogonal queries. SIAM Journal on Computing, 232\u2013253 (1985)","DOI":"10.1137\/0214019"},{"key":"53_CR18","doi-asserted-by":"crossref","unstructured":"Yao, A.C.: Space-time tradeoff for answering range queries. In: Proceedings of the 14th Annual ACM Symposium on the Theory of Computing, pp. 128\u2013136 (1982)","DOI":"10.1145\/800070.802185"},{"key":"53_CR19","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1137\/0214022","volume":"14","author":"A.C. Yao","year":"1985","unstructured":"Yao, A.C.: On the complexity of maintaining partial sums. SIAM Journal on Computing\u00a014, 277\u2013288 (1985)","journal-title":"SIAM Journal on Computing"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-24587-2_53","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,31]],"date-time":"2019-05-31T23:55:58Z","timestamp":1559346958000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-24587-2_53"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540206958","9783540245872"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-24587-2_53","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2003]]}}}