{"id":"https://openalex.org/W2019174300","doi":"https://doi.org/10.1145/1233341.1233413","title":"Exploring the duality between skip lists and binary search trees","display_name":"Exploring the duality between skip lists and binary search trees","publication_year":2007,"publication_date":"2007-03-23","ids":{"openalex":"https://openalex.org/W2019174300","doi":"https://doi.org/10.1145/1233341.1233413","mag":"2019174300"},"language":"en","primary_location":{"id":"doi:10.1145/1233341.1233413","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1233341.1233413","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 45th annual southeast regional conference","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5083958648","display_name":"Brian C. Dean","orcid":"https://orcid.org/0009-0000-0904-4681"},"institutions":[{"id":"https://openalex.org/I8078737","display_name":"Clemson University","ror":"https://ror.org/037s24f05","country_code":"US","type":"education","lineage":["https://openalex.org/I8078737"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Brian C. Dean","raw_affiliation_strings":["Clemson University, Clemson, SC"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Clemson University, Clemson, SC","institution_ids":["https://openalex.org/I8078737"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5065707754","display_name":"Zachary H. Jones","orcid":null},"institutions":[{"id":"https://openalex.org/I8078737","display_name":"Clemson University","ror":"https://ror.org/037s24f05","country_code":"US","type":"education","lineage":["https://openalex.org/I8078737"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Zachary H. Jones","raw_affiliation_strings":["Clemson University, Clemson, SC"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Clemson University, Clemson, SC","institution_ids":["https://openalex.org/I8078737"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I8078737"],"apc_list":null,"apc_paid":null,"fwci":1.0106,"has_fulltext":false,"cited_by_count":21,"citation_normalized_percentile":{"value":0.78876526,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":null,"issue":null,"first_page":"395","last_page":"399"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.9973999857902527,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.9973999857902527,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":0.9954000115394592,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11152","display_name":"Stochastic processes and statistical mechanics","score":0.9937000274658203,"subfield":{"id":"https://openalex.org/subfields/2610","display_name":"Mathematical Physics"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.701880693435669},{"id":"https://openalex.org/keywords/binary-search-tree","display_name":"Binary search tree","score":0.6899465322494507},{"id":"https://openalex.org/keywords/elegance","display_name":"Elegance","score":0.614749550819397},{"id":"https://openalex.org/keywords/simple","display_name":"Simple (philosophy)","score":0.48609137535095215},{"id":"https://openalex.org/keywords/binary-number","display_name":"Binary number","score":0.47598567605018616},{"id":"https://openalex.org/keywords/binary-search-algorithm","display_name":"Binary search algorithm","score":0.4121629595756531},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.39385801553726196},{"id":"https://openalex.org/keywords/binary-tree","display_name":"Binary tree","score":0.3219386339187622},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.2939869165420532},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.2667505145072937},{"id":"https://openalex.org/keywords/search-algorithm","display_name":"Search algorithm","score":0.24348080158233643},{"id":"https://openalex.org/keywords/arithmetic","display_name":"Arithmetic","score":0.1442371904850006}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.701880693435669},{"id":"https://openalex.org/C91154448","wikidata":"https://www.wikidata.org/wiki/Q623818","display_name":"Binary search tree","level":3,"score":0.6899465322494507},{"id":"https://openalex.org/C2778698498","wikidata":"https://www.wikidata.org/wiki/Q1207152","display_name":"Elegance","level":2,"score":0.614749550819397},{"id":"https://openalex.org/C2780586882","wikidata":"https://www.wikidata.org/wiki/Q7520643","display_name":"Simple (philosophy)","level":2,"score":0.48609137535095215},{"id":"https://openalex.org/C48372109","wikidata":"https://www.wikidata.org/wiki/Q3913","display_name":"Binary number","level":2,"score":0.47598567605018616},{"id":"https://openalex.org/C121610932","wikidata":"https://www.wikidata.org/wiki/Q243754","display_name":"Binary search algorithm","level":3,"score":0.4121629595756531},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.39385801553726196},{"id":"https://openalex.org/C197855036","wikidata":"https://www.wikidata.org/wiki/Q380172","display_name":"Binary tree","level":2,"score":0.3219386339187622},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2939869165420532},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2667505145072937},{"id":"https://openalex.org/C125583679","wikidata":"https://www.wikidata.org/wiki/Q755673","display_name":"Search algorithm","level":2,"score":0.24348080158233643},{"id":"https://openalex.org/C94375191","wikidata":"https://www.wikidata.org/wiki/Q11205","display_name":"Arithmetic","level":1,"score":0.1442371904850006},{"id":"https://openalex.org/C107038049","wikidata":"https://www.wikidata.org/wiki/Q35986","display_name":"Aesthetics","level":1,"score":0.0},{"id":"https://openalex.org/C111472728","wikidata":"https://www.wikidata.org/wiki/Q9471","display_name":"Epistemology","level":1,"score":0.0},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1145/1233341.1233413","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1233341.1233413","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 45th annual southeast regional conference","raw_type":"proceedings-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.111.3160","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.111.3160","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cs.clemson.edu/~bcdean/skip_bst.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":16,"referenced_works":["https://openalex.org/W172574161","https://openalex.org/W1482797705","https://openalex.org/W1593563200","https://openalex.org/W1972027649","https://openalex.org/W1992200688","https://openalex.org/W2021615496","https://openalex.org/W2026166434","https://openalex.org/W2037107919","https://openalex.org/W2070991879","https://openalex.org/W2099844038","https://openalex.org/W2105281474","https://openalex.org/W2130055503","https://openalex.org/W2163073686","https://openalex.org/W2901608006","https://openalex.org/W4231502736","https://openalex.org/W6648411488"],"related_works":["https://openalex.org/W1495725930","https://openalex.org/W2363556447","https://openalex.org/W2382626982","https://openalex.org/W270522628","https://openalex.org/W2539085113","https://openalex.org/W2384179084","https://openalex.org/W1499707946","https://openalex.org/W2914983903","https://openalex.org/W2512537634","https://openalex.org/W2146997899"],"abstract_inverted_index":{"Although":[0],"skip":[1,18,63,93],"lists":[2],"were":[3],"introduced":[4],"as":[5,23],"an":[6],"alternative":[7],"to":[8,68],"balanced":[9],"binary":[10],"search":[11],"trees":[12],"(BSTs),":[13],"we":[14,49,76],"show":[15,77],"that":[16,38,78],"the":[17,58,62],"list":[19],"can":[20,84],"be":[21,85],"interpreted":[22],"a":[24,51,88,92],"type":[25],"of":[26,39,57,61],"randomly-balanced":[27],"BST":[28,43,71,81],"whose":[29],"simplicity":[30],"and":[31,55,65],"elegance":[32],"is":[33],"arguably":[34],"on":[35],"par":[36],"with":[37],"today's":[40],"most":[41],"popular":[42],"balancing":[44,72,82],"mechanisms.":[45,73],"In":[46,74],"this":[47],"paper,":[48],"provide":[50],"clear,":[52],"concise":[53],"description":[54],"analysis":[56],"\"BST\"":[59],"interpretation":[60],"list,":[64],"compare":[66],"it":[67],"similar":[69],"randomized":[70],"addition,":[75],"any":[79],"rotation-based":[80],"mechanism":[83],"implemented":[86],"in":[87],"simple":[89],"fashion":[90],"using":[91],"list.":[94]},"counts_by_year":[{"year":2025,"cited_by_count":2},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":2},{"year":2019,"cited_by_count":6},{"year":2017,"cited_by_count":2},{"year":2015,"cited_by_count":1}],"updated_date":"2026-06-26T08:34:08.712188","created_date":"2025-10-10T00:00:00"}