{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:15:23Z","timestamp":1759637723593},"publisher-location":"Berlin, Heidelberg","reference-count":6,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540515425"},{"type":"electronic","value":"9783540482376"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1989]]},"DOI":"10.1007\/3-540-51542-9_5","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T21:07:51Z","timestamp":1330204071000},"page":"39-46","source":"Crossref","is-referenced-by-count":32,"title":["Optimal algorithms for List Indexing and Subset Rank"],"prefix":"10.1007","author":[{"given":"Paul F.","family":"Dietz","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,5,26]]},"reference":[{"key":"5_CR1","doi-asserted-by":"crossref","unstructured":"Michael Fredman and Michael Saks. The cell probe complexity of dynamic data structures. In Proc. 21st ACM STOC, pages 345\u2013354, May 1989.","DOI":"10.1145\/73007.73040"},{"issue":"1","key":"5_CR2","doi-asserted-by":"publisher","first-page":"250","DOI":"10.1145\/322290.322305","volume":"29","author":"Michael L. L. Fredman","year":"1982","unstructured":"Michael L. Fredman. The complexity of maintaining an array and computing its partial sums. Journal of the ACM, 29(1):250\u2013260, January 1982.","journal-title":"Journal of the ACM"},{"key":"5_CR3","volume-title":"Sorting and Searching, volume 1 of Data Structures and Algorithms","author":"K. Mehlhorn","year":"1984","unstructured":"Kurt Mehlhorn. Sorting and Searching, volume 1 of Data Structures and Algorithms, Springer-Verlag, New York, 1984."},{"issue":"2","key":"5_CR4","doi-asserted-by":"crossref","first-page":"306","DOI":"10.1137\/0606031","volume":"6","author":"Robert E. E. Tarjan","year":"1985","unstructured":"Robert E. Tarjan. Amortized computational complexity. SIAM J. on Alg. and Disc. Meth., 6(2):306\u2013318, 1985.","journal-title":"SIAM J. on Alg. and Disc. Meth."},{"issue":"3","key":"5_CR5","doi-asserted-by":"publisher","first-page":"615","DOI":"10.1145\/322261.322274","volume":"28","author":"Andrew C. C. Yao","year":"1981","unstructured":"Andrew C. Yao. Should tables be sorted? Journal of the ACM, 28(3):615\u2013628, July 1981.","journal-title":"Journal of the ACM"},{"issue":"2","key":"5_CR6","doi-asserted-by":"crossref","first-page":"277","DOI":"10.1137\/0214022","volume":"14","author":"Andrew C. C. Yao","year":"1985","unstructured":"Andrew C. Yao. On the complexity of maintaining partial sums. SIAM J. On Computing, 14(2):277\u2013288, May 1985.","journal-title":"SIAM J. On Computing"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Data Structures"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-51542-9_5.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,28]],"date-time":"2021-04-28T01:04:42Z","timestamp":1619571882000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-51542-9_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1989]]},"ISBN":["9783540515425","9783540482376"],"references-count":6,"URL":"https:\/\/doi.org\/10.1007\/3-540-51542-9_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1989]]}}}