{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,13]],"date-time":"2025-05-13T19:24:07Z","timestamp":1747164247530,"version":"3.40.5"},"reference-count":27,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2017,3,1]],"date-time":"2017-03-01T00:00:00Z","timestamp":1488326400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2021,3,1]],"date-time":"2021-03-01T00:00:00Z","timestamp":1614556800000},"content-version":"vor","delay-in-days":1461,"URL":"http:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Journal of Discrete Algorithms"],"published-print":{"date-parts":[[2017,3]]},"DOI":"10.1016\/j.jda.2017.01.002","type":"journal-article","created":{"date-parts":[[2017,2,6]],"date-time":"2017-02-06T17:01:31Z","timestamp":1486400491000},"page":"18-25","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"special_numbering":"C","title":["Range selection and predecessor queries in data aware space and time"],"prefix":"10.1016","volume":"43","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-4583-6261","authenticated-orcid":false,"given":"M. O\u011fuzhan","family":"K\u00fclekci","sequence":"first","affiliation":[]},{"given":"Sharma V.","family":"Thankachan","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/j.jda.2017.01.002_br0010","series-title":"Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms","first-page":"2053","article-title":"Range predecessor and Lempel\u2013Ziv parsing","author":"Belazzougui","year":"2016"},{"issue":"24","key":"10.1016\/j.jda.2017.01.002_br0020","doi-asserted-by":"crossref","first-page":"2588","DOI":"10.1016\/j.tcs.2010.05.003","article-title":"Towards optimal range medians","volume":"412","author":"Brodal","year":"2011","journal-title":"Theor. Comput. Sci."},{"key":"10.1016\/j.jda.2017.01.002_br0030","series-title":"Algorithms and Computation, 20th International Symposium, Proceedings","first-page":"822","article-title":"Data structures for range median queries","volume":"vol. 5878","author":"Brodal","year":"2009"},{"issue":"4","key":"10.1016\/j.jda.2017.01.002_br0040","doi-asserted-by":"crossref","DOI":"10.1145\/2830567","article-title":"Adaptive and approximate orthogonal range counting","volume":"12","author":"Chan","year":"2016","journal-title":"ACM Trans. Algorithms"},{"key":"10.1016\/j.jda.2017.01.002_br0050","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1016\/j.tcs.2012.02.015","article-title":"Improved algorithms for the range next value problem and applications","volume":"434","author":"Crochemore","year":"2012","journal-title":"Theor. Comput. Sci."},{"key":"10.1016\/j.jda.2017.01.002_br0060","series-title":"SOFSEM 2007: Theory and Practice of Computer Science, 33rd Conference on Current Trends in Theory and Practice of Computer Science, Proceedings","first-page":"235","article-title":"Compressed prefix sums","volume":"vol. 4362","author":"Delpratt","year":"2007"},{"issue":"2","key":"10.1016\/j.jda.2017.01.002_br0070","doi-asserted-by":"crossref","first-page":"246","DOI":"10.1145\/321812.321820","article-title":"Efficient storage and retrieval by content and address of static files","volume":"21","author":"Elias","year":"1974","journal-title":"J. ACM"},{"key":"10.1016\/j.jda.2017.01.002_br0080","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1016\/j.tcs.2011.12.002","article-title":"New algorithms on wavelet trees and applications to information retrieval","volume":"426","author":"Gagie","year":"2012","journal-title":"Theor. Comput. Sci."},{"key":"10.1016\/j.jda.2017.01.002_br0090","series-title":"String Processing and Information Retrieval, 16th International Symposium, Proceedings","first-page":"1","article-title":"Range quantile queries: another virtue of wavelet trees","author":"Gagie","year":"2009"},{"key":"10.1016\/j.jda.2017.01.002_br0100","series-title":"Automata, Languages and Programming, 36th International Colloquium, Proceedings, Part I","first-page":"475","article-title":"Towards optimal range medians","volume":"vol. 5555","author":"Gfeller","year":"2009"},{"key":"10.1016\/j.jda.2017.01.002_br0110","series-title":"Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms","first-page":"841","article-title":"High-order entropy-compressed text indexes","author":"Grossi","year":"2003"},{"issue":"3","key":"10.1016\/j.jda.2017.01.002_br0120","doi-asserted-by":"crossref","first-page":"313","DOI":"10.1016\/j.tcs.2007.07.042","article-title":"Compressed data structures: dictionaries and data-aware measures","volume":"387","author":"Gupta","year":"2007","journal-title":"Theor. Comput. Sci."},{"key":"10.1016\/j.jda.2017.01.002_br0130","doi-asserted-by":"crossref","DOI":"10.1145\/2905368","article-title":"Data structures for path queries","volume":"12","author":"He","year":"2016","journal-title":"ACM Transactions on Algorithms"},{"issue":"7","key":"10.1016\/j.jda.2017.01.002_br0140","first-page":"321","article-title":"Algorithm 65: find","volume":"4","author":"Hoare","year":"1961","journal-title":"Commun. ACM"},{"issue":"1","key":"10.1016\/j.jda.2017.01.002_br0150","doi-asserted-by":"crossref","first-page":"10","DOI":"10.1093\/comjnl\/5.1.10","article-title":"Quicksort","volume":"5","author":"Hoare","year":"1962","journal-title":"Comput. J."},{"key":"10.1016\/j.jda.2017.01.002_br0160","series-title":"Proceedings of the Twenty-Second Annual ACM-SIAM Symposium on Discrete Algorithms","first-page":"805","article-title":"Range selection and median: tight cell probe lower bounds and adaptive data structures","author":"J\u00f8rgensen","year":"2011"},{"key":"10.1016\/j.jda.2017.01.002_br0170","series-title":"Data Compression Conference","first-page":"362","article-title":"Enhanced variable-length codes: improved compression with efficient random access","author":"K\u00fclekci","year":"2014"},{"key":"10.1016\/j.jda.2017.01.002_br0180","series-title":"2015 Data Compression Conference","first-page":"73","article-title":"Range selection queries in data aware space and time","author":"K\u00fclekci","year":"2015"},{"key":"10.1016\/j.jda.2017.01.002_br0190","doi-asserted-by":"crossref","first-page":"2","DOI":"10.1016\/j.jda.2013.07.004","article-title":"Wavelet trees for all","volume":"25","author":"Navarro","year":"2014","journal-title":"J. Discret. Algorithms"},{"key":"10.1016\/j.jda.2017.01.002_br0200","series-title":"Experimental Algorithms \u2013 11th International Symposium, Proceedings","first-page":"295","article-title":"Fast, small, simple rank\/select on bitmaps","author":"Navarro","year":"2012"},{"key":"10.1016\/j.jda.2017.01.002_br0210","series-title":"Algorithm Theory \u2013 SWAT 2012 \u2013 13th Scandinavian Symposium and Workshops, Proceedings","first-page":"271","article-title":"Sorted range reporting","volume":"vol. 7357","author":"Nekrich","year":"2012"},{"key":"10.1016\/j.jda.2017.01.002_br0220","series-title":"Proceedings of the Nine Workshop on Algorithm Engineering and Experiments","article-title":"Practical entropy-compressed rank\/select dictionary","author":"Okanohara","year":"2007"},{"year":"2012","series-title":"Advanced Rank\/Select Data Structures: Succinctness, Bounds, and Applications","author":"Orlandi","key":"10.1016\/j.jda.2017.01.002_br0230"},{"key":"10.1016\/j.jda.2017.01.002_br0240","doi-asserted-by":"crossref","first-page":"103","DOI":"10.1016\/j.jda.2012.08.003","article-title":"Succinct representations of weighted trees supporting path queries","volume":"17","author":"Patil","year":"2012","journal-title":"J. Discret. Algorithms"},{"issue":"4","key":"10.1016\/j.jda.2017.01.002_br0250","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1145\/1290672.1290680","article-title":"Succinct indexable dictionaries with applications to encoding k-ary trees, prefix sums and multisets","volume":"3","author":"Raman","year":"2007","journal-title":"ACM Trans. Algorithms"},{"key":"10.1016\/j.jda.2017.01.002_br0260","unstructured":"R.F. Rice, Some practical universal noiseless coding techniques, part 3, 1991."},{"key":"10.1016\/j.jda.2017.01.002_br0270","series-title":"Computing and Combinatorics, 15th Annual International Conference, Proceedings","first-page":"96","article-title":"Efficient data structures for the orthogonal range successor problem","volume":"vol. 5609","author":"Yu","year":"2009"}],"container-title":["Journal of Discrete Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1570866717300163?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1570866717300163?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2021,3,1]],"date-time":"2021-03-01T03:00:53Z","timestamp":1614567653000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S1570866717300163"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,3]]},"references-count":27,"alternative-id":["S1570866717300163"],"URL":"https:\/\/doi.org\/10.1016\/j.jda.2017.01.002","relation":{},"ISSN":["1570-8667"],"issn-type":[{"type":"print","value":"1570-8667"}],"subject":[],"published":{"date-parts":[[2017,3]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Range selection and predecessor queries in data aware space and time","name":"articletitle","label":"Article Title"},{"value":"Journal of Discrete Algorithms","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.jda.2017.01.002","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2017 Elsevier B.V.","name":"copyright","label":"Copyright"}]}}