{"id":"https://openalex.org/W1992200688","doi":null,"title":"Deterministic skip lists","display_name":"Deterministic skip lists","publication_year":1992,"publication_date":"1992-09-01","ids":{"openalex":"https://openalex.org/W1992200688","mag":"1992200688"},"language":"en","primary_location":{"id":"mag:1992200688","doi":null,"is_oa":false,"landing_page_url":"http://portal.acm.org/citation.cfm?id=139478","pdf_url":null,"source":{"id":"https://openalex.org/S4306420974","display_name":"Symposium on Discrete Algorithms","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":"Symposium on Discrete Algorithms","raw_type":null},"volume":null,"type":"conference-paper","is_traditional":true,"indexed_in":[],"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/A5108095454","display_name":"J. Ian Munro","orcid":"https://orcid.org/0000-0002-7165-7988","observed_orcids":["https://orcid.org/0000-0002-7165-7988"]},"institutions":[{"id":"https://openalex.org/I151746483","display_name":"University of Waterloo","ror":"https://ror.org/01aff2v68","country_code":"CA","type":"education","lineage":["https://openalex.org/I151746483"]}],"countries":["CA"],"is_corresponding":false,"raw_author_name":"J. Ian Munro","raw_affiliation_strings":["(University of Waterloo)"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"(University of Waterloo)","institution_ids":["https://openalex.org/I151746483"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5081885364","display_name":"Thomas Papadakis","orcid":null,"observed_orcids":[]},"institutions":[{"id":"https://openalex.org/I151746483","display_name":"University of Waterloo","ror":"https://ror.org/01aff2v68","country_code":"CA","type":"education","lineage":["https://openalex.org/I151746483"]}],"countries":["CA"],"is_corresponding":false,"raw_author_name":"Thomas Papadakis","raw_affiliation_strings":["(University of Waterloo)"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"(University of Waterloo)","institution_ids":["https://openalex.org/I151746483"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5077370067","display_name":"Robert Sedgewick","orcid":"https://orcid.org/0009-0001-7238-7860","observed_orcids":["https://orcid.org/0009-0001-7238-7860"]},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Robert Sedgewick","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":1.2822,"has_fulltext":false,"cited_by_count":92,"citation_normalized_percentile":{"value":0.68103448,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":88,"max":98},"biblio":{"volume":null,"issue":null,"first_page":"367","last_page":"375"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":0.9940999746322632,"subfield":{"id":"https://openalex.org/subfields/2614","display_name":"Theoretical Computer Science"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":0.9940999746322632,"subfield":{"id":"https://openalex.org/subfields/2614","display_name":"Theoretical Computer Science"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.002300000051036477,"subfield":{"id":"https://openalex.org/subfields/2614","display_name":"Theoretical Computer Science"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.0010999999940395355,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/skip-lists","display_name":"skip lists","score":0.9340000152587891},{"id":"https://openalex.org/keywords/insert-and-delete-operations","display_name":"insert and delete operations","score":0.7609999775886536},{"id":"https://openalex.org/keywords/node-size","display_name":"node size","score":0.45399999618530273},{"id":"https://openalex.org/keywords/buddy-system","display_name":"buddy system","score":0.6510000228881836},{"id":"https://openalex.org/keywords/memory-allocation","display_name":"memory allocation","score":0.972000002861023},{"id":"https://openalex.org/keywords/balanced-trees","display_name":"balanced trees","score":0.8790000081062317},{"id":"https://openalex.org/keywords/dynamic-data-structures","display_name":"dynamic data structures","score":0.5099999904632568}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7280653715133667},{"id":"https://openalex.org/C39927690","wikidata":"https://www.wikidata.org/wiki/Q11197","display_name":"Logarithm","level":2,"score":0.595893383026123},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.5217231512069702},{"id":"https://openalex.org/C2776760102","wikidata":"https://www.wikidata.org/wiki/Q5139990","display_name":"Code (set theory)","level":3,"score":0.5114661455154419},{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.4999716281890869},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.48005804419517517},{"id":"https://openalex.org/C2778572836","wikidata":"https://www.wikidata.org/wiki/Q380933","display_name":"Space (punctuation)","level":2,"score":0.46471986174583435},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.44504570960998535},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.24090012907981873},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.2264983057975769},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.1005786657333374},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"mag:1992200688","doi":null,"is_oa":false,"landing_page_url":"http://portal.acm.org/citation.cfm?id=139478","pdf_url":null,"source":{"id":"https://openalex.org/S4306420974","display_name":"Symposium on Discrete Algorithms","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":"Symposium on Discrete Algorithms","raw_type":null}],"best_oa_location":null,"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":6,"referenced_works":["https://openalex.org/W151450991","https://openalex.org/W172574161","https://openalex.org/W2021615496","https://openalex.org/W2044253986","https://openalex.org/W2070991879","https://openalex.org/W2901608006"],"related_works":["https://openalex.org/W7099254909","https://openalex.org/W7097370837","https://openalex.org/W1601568537","https://openalex.org/W2105281474","https://openalex.org/W2182497080","https://openalex.org/W2614079713","https://openalex.org/W1977549851","https://openalex.org/W2164017859","https://openalex.org/W2270914126","https://openalex.org/W2044253986"],"abstract_inverted_index":{"We":[0],"explore":[1],"techniques":[2,95],"based":[3],"on":[4],"the":[5,62,65,69,82],"notion":[6],"of":[7,29,39,41,68,91,100],"a":[8,32,36,88],"skip":[9],"list":[10],"to":[11,23,78,87],"guarantee":[12],"logarithmic":[13],"search,":[14],"insert":[15],"and":[16,102],"delete":[17],"costs.":[18],"The":[19,45,74],"basic":[20],"idea":[21],"is":[22,84],"insist":[24],"that":[25,43,64],"between":[26],"any":[27],"pair":[28],"elements":[30,40],"above":[31],"given":[33],"height":[34],"are":[35,96],"small":[37],"number":[38],"precisely":[42],"height.":[44],"desired":[46],"behaviour":[47],"can":[48],"be":[49,71],"achieved":[50],"by":[51,60],"either":[52],"using":[53],"some":[54],"extra":[55],"space":[56,103],"for":[57],"pointers,":[58],"or":[59],"adding":[61],"constraint":[63],"physical":[66],"sizes":[67],"nodes":[70],"exponentially":[72],"increasing.":[73],"first":[75,116],"approach":[76],"leads":[77],"simpler":[79,112],"code,":[80],"whereas":[81],"second":[83],"ideally":[85],"suited":[86],"buddy":[89],"system":[90],"memory":[92],"allocation.":[93],"Our":[94],"competitive":[97],"in":[98],"terms":[99],"time":[101],"with":[104],"balanced":[105],"tree":[106],"schemes,":[107],"and,":[108],"we":[109],"feel,":[110],"inherently":[111],"when":[113],"taken":[114],"from":[115],"principles.":[117]},"counts_by_year":[{"year":2025,"cited_by_count":3},{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":2},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":4},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":6},{"year":2016,"cited_by_count":5},{"year":2015,"cited_by_count":3},{"year":2014,"cited_by_count":4},{"year":2013,"cited_by_count":5},{"year":2012,"cited_by_count":2}],"updated_date":"2026-11-04T10:54:05.112534","created_date":"2016-06-24T00:00:00"}