{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,16]],"date-time":"2026-04-16T16:24:53Z","timestamp":1776356693390,"version":"3.51.2"},"publisher-location":"New York, NY, USA","reference-count":13,"publisher":"ACM","license":[{"start":{"date-parts":[[2007,3,23]],"date-time":"2007-03-23T00:00:00Z","timestamp":1174608000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2007,3,23]]},"DOI":"10.1145\/1233341.1233413","type":"proceedings-article","created":{"date-parts":[[2007,4,5]],"date-time":"2007-04-05T19:41:00Z","timestamp":1175802060000},"page":"395-399","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":14,"title":["Exploring the duality between skip lists and binary search trees"],"prefix":"10.1145","author":[{"given":"Brian C.","family":"Dean","sequence":"first","affiliation":[{"name":"Clemson University, Clemson, SC"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zachary H.","family":"Jones","sequence":"additional","affiliation":[{"name":"Clemson University, Clemson, SC"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2007,3,23]]},"reference":[{"key":"e_1_3_2_1_1_1","first-page":"1259","article-title":"An algorithm for the organization of information","volume":"3","author":"Adel'son-Vel'ski\u01d0 G. M.","year":"1962","unstructured":"G. M. Adel'son-Vel'ski\u01d0 and E. M. Landis . An algorithm for the organization of information . Soviet Mathematics Doklady , 3 : 1259 -- 1263 , 1962 . G. M. Adel'son-Vel'ski\u01d0 and E. M. Landis. An algorithm for the organization of information. Soviet Mathematics Doklady, 3:1259--1263, 1962.","journal-title":"Soviet Mathematics Doklady"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1007\/s004539900061"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF00289509"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF00288683"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.5555\/645413.652136"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1978.3"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/274787.274812"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1051\/ita\/1997310302511"},{"key":"e_1_3_2_1_9_1","volume-title":"Computational Geometry: An Introduction Through Randomized Algorithms","author":"Mulmuley K.","year":"1994","unstructured":"K. Mulmuley . Computational Geometry: An Introduction Through Randomized Algorithms . Prentice-Hall , 1994 . K. Mulmuley. Computational Geometry: An Introduction Through Randomized Algorithms. Prentice-Hall, 1994."},{"key":"e_1_3_2_1_10_1","first-page":"367","volume-title":"Proceedings of the 3rd annual ACM-SIAM Symposium on Discrete Algorithms (SODA)","author":"Munro J. I.","year":"1992","unstructured":"J. I. Munro , T. Papadakis , and R. Sedgewick . Deterministic skip lists . In Proceedings of the 3rd annual ACM-SIAM Symposium on Discrete Algorithms (SODA) , pages 367 -- 375 , 1992 . J. I. Munro, T. Papadakis, and R. Sedgewick. Deterministic skip lists. In Proceedings of the 3rd annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pages 367--375, 1992."},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1137\/0202005"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/78973.78977"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/3828.3835"}],"event":{"name":"ACM SE07: ACM Southeast Regional Conference","location":"Winston-Salem North Carolina","acronym":"ACM SE07","sponsor":["SIGAPP ACM Special Interest Group on Applied Computing"]},"container-title":["Proceedings of the 45th annual southeast regional conference"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1233341.1233413","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1233341.1233413","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T14:47:27Z","timestamp":1750258047000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1233341.1233413"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007,3,23]]},"references-count":13,"alternative-id":["10.1145\/1233341.1233413","10.1145\/1233341"],"URL":"https:\/\/doi.org\/10.1145\/1233341.1233413","relation":{},"subject":[],"published":{"date-parts":[[2007,3,23]]},"assertion":[{"value":"2007-03-23","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}