{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,7,5]],"date-time":"2024-07-05T17:42:28Z","timestamp":1720201348010},"reference-count":18,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2016,12,1]],"date-time":"2016-12-01T00:00:00Z","timestamp":1480550400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2020,12,20]],"date-time":"2020-12-20T00:00:00Z","timestamp":1608422400000},"content-version":"vor","delay-in-days":1480,"URL":"http:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[2016,12]]},"DOI":"10.1016\/j.tcs.2016.07.002","type":"journal-article","created":{"date-parts":[[2016,7,17]],"date-time":"2016-07-17T07:05:15Z","timestamp":1468739115000},"page":"108-117","update-policy":"http:\/\/dx.doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":1,"special_numbering":"PB","title":["Efficient dynamic range minimum query"],"prefix":"10.1016","volume":"656","author":[{"given":"A.","family":"Heliou","sequence":"first","affiliation":[]},{"given":"M.","family":"L\u00e9onard","sequence":"additional","affiliation":[]},{"given":"L.","family":"Mouchard","sequence":"additional","affiliation":[]},{"given":"M.","family":"Salson","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"issue":"3","key":"10.1016\/j.tcs.2016.07.002_br0010","doi-asserted-by":"crossref","first-page":"348","DOI":"10.1137\/0204030","article-title":"Parallelism in comparison problems","volume":"4","author":"Valiant","year":"1975","journal-title":"SIAM J. Comput."},{"issue":"1","key":"10.1016\/j.tcs.2016.07.002_br0020","doi-asserted-by":"crossref","first-page":"88","DOI":"10.1016\/0196-6774(81)90010-9","article-title":"Finding the maximum, merging, and sorting in a parallel computation model","volume":"2","author":"Shiloach","year":"1981","journal-title":"J. Algorithms"},{"key":"10.1016\/j.tcs.2016.07.002_br0030","series-title":"Recursive star-tree parallel data-structure","author":"Berkman","year":"1990"},{"issue":"2","key":"10.1016\/j.tcs.2016.07.002_br0040","doi-asserted-by":"crossref","first-page":"465","DOI":"10.1137\/090779759","article-title":"Space-efficient preprocessing schemes for range minimum queries on static arrays","volume":"40","author":"Fischer","year":"2011","journal-title":"SIAM J. Comput."},{"key":"10.1016\/j.tcs.2016.07.002_br0050","series-title":"Proc. of Combinatorial Pattern Matching","first-page":"36","article-title":"Theoretical and practical improvements on the RMQ-problem, with applications to LCA and LCE","author":"Fischer","year":"2006"},{"issue":"4","key":"10.1016\/j.tcs.2016.07.002_br0060","doi-asserted-by":"crossref","first-page":"589","DOI":"10.1007\/s00224-006-1198-x","article-title":"Compressed suffix trees with full functionality","volume":"41","author":"Sadakane","year":"2007","journal-title":"Theory Comput. Syst."},{"key":"10.1016\/j.tcs.2016.07.002_br0070","series-title":"Space-Efficient Data Structures, Streams, and Algorithms","first-page":"48","article-title":"A simple linear-space data structure for constant-time range minimum query","volume":"vol. 8066","author":"Durocher","year":"2013"},{"key":"10.1016\/j.tcs.2016.07.002_br0080","series-title":"Proc. 9th Latin American Theoretical Informatics Symposium","first-page":"158","article-title":"Optimal succinctness for range minimum queries","author":"Fischer","year":"2010"},{"key":"10.1016\/j.tcs.2016.07.002_br0090","series-title":"Computing and Combinatorics","first-page":"396","article-title":"Succinct representations of binary trees for range minimum queries","volume":"vol. 7434","author":"Davoodi","year":"2012"},{"key":"10.1016\/j.tcs.2016.07.002_br0100","series-title":"Algorithms and Data Structures","first-page":"290","article-title":"Path minima queries in dynamic weighted trees","author":"Brodal","year":"2011"},{"key":"10.1016\/j.tcs.2016.07.002_br0110","series-title":"Data structures: range queries and space efficiency","author":"Davoodi","year":"2011"},{"key":"10.1016\/j.tcs.2016.07.002_br0120","series-title":"Algorithms and Data Structures: 13th International Symposium, Proceedings","first-page":"37","article-title":"On (dynamic) range minimum queries in external memory","author":"Arge","year":"2013"},{"key":"10.1016\/j.tcs.2016.07.002_br0130","series-title":"Proc. of Symposium on Discrete Algorithms","first-page":"233","article-title":"Succinct indexable dictionaries with applications to encoding k-ary trees and multisets","author":"Raman","year":"2002"},{"key":"10.1016\/j.tcs.2016.07.002_br0140","series-title":"Experimental Algorithms","first-page":"295","article-title":"Simple rank\/select on bitmaps","volume":"vol. 7276","author":"Navarro","year":"2012"},{"issue":"3","key":"10.1016\/j.tcs.2016.07.002_br0150","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":"Theoret. Comput. Sci."},{"key":"10.1016\/j.tcs.2016.07.002_br0160","series-title":"Proc. of the Workshop on Algorithm Engineering and Experiments","article-title":"Practical entropy-compressed rank\/select dictionary","author":"Okanohara","year":"2007"},{"issue":"3","key":"10.1016\/j.tcs.2016.07.002_br0170","doi-asserted-by":"crossref","first-page":"332","DOI":"10.1016\/j.tcs.2007.07.013","article-title":"Rank and select revisited and extended","volume":"387","author":"M\u00e4kinen","year":"2007","journal-title":"Theoret. Comput. Sci."},{"issue":"5","key":"10.1016\/j.tcs.2016.07.002_br0180","doi-asserted-by":"crossref","first-page":"1781","DOI":"10.1137\/130908245","article-title":"Optimal dynamic sequence representations","volume":"43","author":"Navarro","year":"2014","journal-title":"SIAM J. Comput."}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397516303164?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397516303164?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,12,19]],"date-time":"2020-12-19T22:04:42Z","timestamp":1608415482000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397516303164"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,12]]},"references-count":18,"alternative-id":["S0304397516303164"],"URL":"https:\/\/doi.org\/10.1016\/j.tcs.2016.07.002","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[2016,12]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Efficient dynamic range minimum query","name":"articletitle","label":"Article Title"},{"value":"Theoretical Computer Science","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.tcs.2016.07.002","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2016 Elsevier B.V.","name":"copyright","label":"Copyright"}]}}