{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:33:50Z","timestamp":1759638830790},"reference-count":11,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2003,4,1]],"date-time":"2003-04-01T00:00:00Z","timestamp":1049155200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,29]],"date-time":"2013-07-29T00:00:00Z","timestamp":1375056000000},"content-version":"vor","delay-in-days":3772,"URL":"http:\/\/creativecommons.org\/licenses\/by-nc-nd\/3.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Electronic Notes in Theoretical Computer Science"],"published-print":{"date-parts":[[2003,4]]},"DOI":"10.1016\/s1571-0661(04)81018-1","type":"journal-article","created":{"date-parts":[[2004,9,29]],"date-time":"2004-09-29T16:47:47Z","timestamp":1096476467000},"page":"281-292","source":"Crossref","is-referenced-by-count":1,"special_numbering":"C","title":["The Reverse Problem of Range Query"],"prefix":"10.1016","volume":"78","author":[{"given":"Tadao","family":"Takaoka","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S1571-0661(04)81018-1_NEWBIB1","doi-asserted-by":"crossref","unstructured":"Agrawal, R. T. Imielinski, and A. Swami, Mining Association Rules between Sets of Items in Large Database, Proc. SIGMOD Conf. on Management of Data (1993) 207\u2013216","DOI":"10.1145\/170036.170072"},{"key":"10.1016\/S1571-0661(04)81018-1_NEWBIB2","unstructured":"Alon, N.Z. Galil, and O. Margalit, On the exponent of the all pairs shortest path problem, Proc. 32nd FOCS (1991) 569\u2013575"},{"key":"10.1016\/S1571-0661(04)81018-1_NEWBIB3","first-page":"865","author":"Bentley","year":"1984","journal-title":"Programming Pearls - Algorithm Design Techniques, Comm. ACM, 27-9"},{"key":"10.1016\/S1571-0661(04)81018-1_NEWBIB4","first-page":"1087","author":"Bentley","year":"1984","journal-title":"Pearls - Perspective on Performance, Comm. ACM, 27"},{"key":"10.1016\/S1571-0661(04)81018-1_NEWBIB5","volume":"Volume 1","author":"Feller","year":"1950"},{"key":"10.1016\/S1571-0661(04)81018-1_NEWBIB6","doi-asserted-by":"crossref","unstructured":"Fukuda T., Y. Morimoto, S. Morishita, and T. Tokuyama, Data Mining Using Two-Dimensional Optimized Association rules: Scheme, Algorithms and Visualization, Proc. SIGMOD Conf. on Management of Data (1996) 13\u201323","DOI":"10.1145\/233269.233313"},{"key":"10.1016\/S1571-0661(04)81018-1_NEWBIB7","doi-asserted-by":"crossref","first-page":"1023","DOI":"10.1137\/0216065","article-title":"An all pairs shortest path algorithm with O (n2 log n) expected time","volume":"16","author":"Moffat","year":"1987","journal-title":"SIAM Jour. Computing"},{"key":"10.1016\/S1571-0661(04)81018-1_NEWBIB8","doi-asserted-by":"crossref","unstructured":"Takaoka T., A. New Upper Bound on the complexity of the all pairs shortest path problem, Info. Proc. Lett., 43 (1992) 195\u2013199","DOI":"10.1016\/0020-0190(92)90200-F"},{"key":"10.1016\/S1571-0661(04)81018-1_NEWBIB9","first-page":"309","volume":"20","author":"Takaoka","year":"1998","journal-title":"cost algorithms for the all pairs shortest path problem, Algorithmica"},{"key":"10.1016\/S1571-0661(04)81018-1_NEWBIB10","doi-asserted-by":"crossref","unstructured":"Takaoka, T. Efficient Algorithms for the Maximum Subarray Problem by Distance Matrix Multiplication, Proceedings of the Australasian Theory Conference, CATS02, (2002) 189\u2013198","DOI":"10.1016\/S1571-0661(04)00313-5"},{"key":"10.1016\/S1571-0661(04)81018-1_NEWBIB11","unstructured":"Tamaki H. and T. Tokuyama, Algorithms for the Maximum Subarray Problem Based on Matrix Multiplication, Proceedings of the 9th SODA (Symposium on Discrete Algorithms) (1998) 446\u2013452"}],"container-title":["Electronic Notes in Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571066104810181?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571066104810181?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,4,3]],"date-time":"2020-04-03T07:12:54Z","timestamp":1585897974000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S1571066104810181"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,4]]},"references-count":11,"alternative-id":["S1571066104810181"],"URL":"https:\/\/doi.org\/10.1016\/s1571-0661(04)81018-1","relation":{},"ISSN":["1571-0661"],"issn-type":[{"value":"1571-0661","type":"print"}],"subject":[],"published":{"date-parts":[[2003,4]]}}}