{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:09:53Z","timestamp":1725664193047},"publisher-location":"Berlin, Heidelberg","reference-count":4,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540583257"},{"type":"electronic","value":"9783540486534"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1994]]},"DOI":"10.1007\/3-540-58325-4_209","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T15:45:03Z","timestamp":1330271103000},"page":"433-441","source":"Crossref","is-referenced-by-count":1,"title":["Analysing deletions in competitive self-adjusting linear list algorithms"],"prefix":"10.1007","author":[{"given":"Lucas Chi","family":"Kwong Hui","sequence":"first","affiliation":[]},{"given":"Charles U.","family":"Martel","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,6,3]]},"reference":[{"unstructured":"L.C.K. Hui. Deterministic List Update Algorithm for Successful and Unsuccessful Search: Analysis and Experimentation, 1993, manuscript.","key":"51_CR1"},{"doi-asserted-by":"crossref","unstructured":"L.C.K. Hui and C. Martel. Randomized Competitive Algorithms for Successful and Unsuccessful Search. In Proc. of the Fourth Annual International Symposium on Algorithms and Computation, 426\u2013435, December 1993, Hong Kong.","key":"51_CR2","DOI":"10.1007\/3-540-57568-5_274"},{"key":"51_CR3","doi-asserted-by":"publisher","first-page":"447","DOI":"10.1006\/jagm.1993.1049","volume":"18","author":"L. Hui","year":"1993","unstructured":"L. Hui and C. Martel. Unsuccessful search in self-adjusting data structures. Journal of Algorithms, 18:447\u2013481, 1993.","journal-title":"Journal of Algorithms"},{"issue":"2","key":"51_CR4","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."}],"container-title":["Lecture Notes in Computer Science","Algorithms and Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-58325-4_209.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T21:19:32Z","timestamp":1605647972000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-58325-4_209"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994]]},"ISBN":["9783540583257","9783540486534"],"references-count":4,"URL":"https:\/\/doi.org\/10.1007\/3-540-58325-4_209","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1994]]}}}