{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:09:03Z","timestamp":1725664143355},"publisher-location":"Berlin, Heidelberg","reference-count":8,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540575689"},{"type":"electronic","value":"9783540482338"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1993]]},"DOI":"10.1007\/3-540-57568-5_274","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T13:10:38Z","timestamp":1330261838000},"page":"426-435","source":"Crossref","is-referenced-by-count":2,"title":["Randomized competitive algorithms for successful and unsuccessful search on self-adjusting linear lists"],"prefix":"10.1007","author":[{"given":"Lucas Chi Kwong","family":"Hui","sequence":"first","affiliation":[]},{"given":"Charles U.","family":"Martel","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,6,1]]},"reference":[{"key":"46_CR1","unstructured":"J. Bentley and C. McGeoch. Worst-case analysis of self-organizing sequential search heuristics. In Proc. of 20th Allerton Conf. on Communication, Control, and Computing, pages 452\u2013461, 1983."},{"issue":"2","key":"46_CR2","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1137\/0213020","volume":"13","author":"G. Frederickson","year":"1984","unstructured":"G. Frederickson. Self-organizing heuristics for implicit data structures. SIAM Journal on Computing, 13(2):277\u2013291, 1984.","journal-title":"SIAM Journal on Computing"},{"key":"46_CR3","unstructured":"L. Hui and C. Martel. On efficient unsuccessful search. In Proc. of the 3rd ACM-SIAM Symposium on Discrete Algorithms, pages 217\u2013227, 1992."},{"key":"46_CR4","unstructured":"S. Irani, N. Reingold, J. Westbrook, and D. Sleator. Randomized competitive algorithms for the list update problem. In Proc. of the 2nd ACM-SIAM Symposium on Discrete Algorithms, pages 251\u2013260, 1991."},{"key":"46_CR5","doi-asserted-by":"crossref","first-page":"609","DOI":"10.1287\/opre.13.4.609","volume":"12","author":"J. McCabe","year":"1965","unstructured":"J. McCabe. On serial files with relocatable records. Oper. Res., 12:609\u2013618, 1965.","journal-title":"Oper. Res."},{"key":"46_CR6","doi-asserted-by":"crossref","unstructured":"N. Reingold, J. Westbrook, and D. Sleator. Randomized competitive algorithms for the list update problem. Algorithmica, to appear.","DOI":"10.1007\/BF01294261"},{"issue":"2","key":"46_CR7","first-page":"202","volume":"28","author":"D. Sleator","year":"1985","unstructured":"D. Sleator and R. Tarjan. Amortized efficiency of list update and paging rules. Commun. of the A.C.M., 28(2):202\u2013208, 1985.","journal-title":"Commun. of the A.C.M."},{"issue":"3","key":"46_CR8","first-page":"652","volume":"32","author":"D. Sleator","year":"1985","unstructured":"D. Sleator and R. Tarjan. Self-adjusting binary search trees. J.A.C.M., 32(3):652\u2013686, 1985.","journal-title":"J.A.C.M."}],"container-title":["Lecture Notes in Computer Science","Algorithms and Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-57568-5_274.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,28]],"date-time":"2021-04-28T01:06:24Z","timestamp":1619571984000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-57568-5_274"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993]]},"ISBN":["9783540575689","9783540482338"],"references-count":8,"URL":"https:\/\/doi.org\/10.1007\/3-540-57568-5_274","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1993]]}}}