{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,30]],"date-time":"2024-10-30T23:00:42Z","timestamp":1730329242067,"version":"3.28.0"},"publisher-location":"New York, NY, USA","reference-count":17,"publisher":"ACM","content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2002,5,19]]},"DOI":"10.1145\/509907.509991","type":"proceedings-article","created":{"date-parts":[[2004,4,19]],"date-time":"2004-04-19T17:18:43Z","timestamp":1082395123000},"page":"583-591","update-policy":"http:\/\/dx.doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":2,"title":["Optimal finger search trees in the pointer machine"],"prefix":"10.1145","author":[{"given":"Gerth St\u00f8lting","family":"Brodal","sequence":"first","affiliation":[{"name":"University of Aarhus"}]},{"given":"George","family":"Lagogiannis","sequence":"additional","affiliation":[{"name":"University of Patras & Computer Technology Institute, Patra, Greece"}]},{"given":"Christos","family":"Makris","sequence":"additional","affiliation":[{"name":"University of Patras & Computer Technology Institute, Patra, Greece"}]},{"given":"Athanasios","family":"Tsakalidis","sequence":"additional","affiliation":[{"name":"University of Patras & Computer Technology Institute, Patra, Greece"}]},{"given":"Kostas","family":"Tsichlas","sequence":"additional","affiliation":[{"name":"University of Patras & Computer Technology Institute, Patra, Greece"}]}],"member":"320","published-online":{"date-parts":[[2002,5,19]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/335305.335344"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.5555\/642150.642153"},{"key":"e_1_3_2_1_3_1","first-page":"540","volume-title":"Proc. 9th Annual ACM-SIAM Symposium on Discrete Algorithms(SODA)","author":"Brodal G.S.","year":"1998","unstructured":"G.S. Brodal . Finger Search Trees with Constant Insertion Time . In Proc. 9th Annual ACM-SIAM Symposium on Discrete Algorithms(SODA) , pages 540 -- 549 , 1998 . G.S. Brodal. Finger Search Trees with Constant Insertion Time. In Proc. 9th Annual ACM-SIAM Symposium on Discrete Algorithms(SODA), pages 540--549, 1998."},{"key":"e_1_3_2_1_4_1","volume-title":"Dept. of Comp. Science","author":"Clancy M.J.","year":"1977","unstructured":"M.J. Clancy and D.E. Knuth . A programming and problem-solving seminar. T.R. STAN-CS-77-606 , Dept. of Comp. Science , Stanford University , 1977 . M.J. Clancy and D.E. Knuth. A programming and problem-solving seminar. T.R. STAN-CS-77-606, Dept. of Comp. Science, Stanford University, 1977."},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(94)00115-4"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1016\/0022-0000(89)90034-2"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1142\/S0129054196000117"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/800105.803395"},{"key":"e_1_3_2_1_9_1","volume-title":"Dept of ICS","author":"Harel D.","year":"1980","unstructured":"D. Harel . Fast Updates with a Guaranteed Time Bound per Update. T.R. 154 , Dept of ICS , University of California at Irvine , 1980 . D. Harel. Fast Updates with a Guaranteed Time Bound per Update. T.R. 154, Dept of ICS, University of California at Irvine, 1980."},{"key":"e_1_3_2_1_10_1","volume-title":"Dept of ICS","author":"Harel D.","year":"1979","unstructured":"D. Harel and G. Lueker . A Data Structure with Movable Fingers and Deletions. T.R. 145 , Dept of ICS , University of California at Irvine , 1979 . D. Harel and G. Lueker. A Data Structure with Movable Fingers and Deletions. T.R. 145, Dept of ICS, University of California at Irvine, 1979."},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF00288968"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/800076.802458"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF00299635"},{"key":"e_1_3_2_1_14_1","first-page":"27","volume":"18","author":"Overmars M.H.","year":"1982","unstructured":"M.H. Overmars . An O(1) Average Time Update Scheme for Balanced Search Trees . Bulletin of EATCS , 18 : 27 -- 29 , 1982 . M.H. Overmars. An O(1) Average Time Update Scheme for Balanced Search Trees. Bulletin of EATCS, 18:27--29, 1982.","journal-title":"Bulletin of EATCS"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1016\/0022-0000(79)90042-4"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(83)90099-6"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0019-9958(85)80034-6"}],"event":{"name":"STOC02: Symposium on the Theory of Computing","sponsor":["SIGACT ACM Special Interest Group on Algorithms and Computation Theory"],"location":"Montreal Quebec Canada","acronym":"STOC02"},"container-title":["Proceedings of the thiry-fourth annual ACM symposium on Theory of computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/509907.509991","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,10]],"date-time":"2023-01-10T14:01:39Z","timestamp":1673359299000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/509907.509991"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,5,19]]},"references-count":17,"alternative-id":["10.1145\/509907.509991","10.1145\/509907"],"URL":"https:\/\/doi.org\/10.1145\/509907.509991","relation":{},"subject":[],"published":{"date-parts":[[2002,5,19]]},"assertion":[{"value":"2002-05-19","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}