{"id":"https://openalex.org/W2110194211","doi":"https://doi.org/10.1016/s1571-0661(04)80771-0","title":"Inorder traversal of splay trees","display_name":"Inorder traversal of splay trees","publication_year":2003,"publication_date":"2003-10-01","ids":{"openalex":"https://openalex.org/W2110194211","doi":"https://doi.org/10.1016/s1571-0661(04)80771-0","mag":"2110194211"},"language":"en","primary_location":{"id":"doi:10.1016/s1571-0661(04)80771-0","is_oa":true,"landing_page_url":"https://doi.org/10.1016/s1571-0661(04)80771-0","pdf_url":null,"source":{"id":"https://openalex.org/S50368787","display_name":"Electronic Notes in Theoretical Computer Science","issn_l":"1571-0661","issn":["1571-0661"],"is_oa":true,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":"cc-by-nc-nd","license_id":"https://openalex.org/licenses/cc-by-nc-nd","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Electronic Notes in Theoretical Computer Science","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"diamond","oa_url":"https://doi.org/10.1016/s1571-0661(04)80771-0","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5089754307","display_name":"Colm \u00d3 D\u00fanlaing","orcid":null},"institutions":[{"id":"https://openalex.org/I205274468","display_name":"Trinity College Dublin","ror":"https://ror.org/02tyrky19","country_code":"IE","type":"education","lineage":["https://openalex.org/I205274468"]}],"countries":["IE"],"is_corresponding":true,"raw_author_name":"Colm \u00d3 D\u00fanlaing","raw_affiliation_strings":["Mathematics, Trinity College, Dublin 2, Ireland","Mathematics, Trinity College, Dublin 2, Ireland#TAB#"],"affiliations":[{"raw_affiliation_string":"Mathematics, Trinity College, Dublin 2, Ireland","institution_ids":["https://openalex.org/I205274468"]},{"raw_affiliation_string":"Mathematics, Trinity College, Dublin 2, Ireland#TAB#","institution_ids":["https://openalex.org/I205274468"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5089754307"],"corresponding_institution_ids":["https://openalex.org/I205274468"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.19254943,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"74","issue":null,"first_page":"134","last_page":"157"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.9997000098228455,"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.9997000098228455,"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.9940999746322632,"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/T10772","display_name":"Distributed systems and fault tolerance","score":0.9894999861717224,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/tree-traversal","display_name":"Tree traversal","score":0.9534615874290466},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.7368450164794922},{"id":"https://openalex.org/keywords/binary-tree","display_name":"Binary tree","score":0.7121589183807373},{"id":"https://openalex.org/keywords/binary-search-tree","display_name":"Binary search tree","score":0.7014428973197937},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.6703940033912659},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.6407715082168579},{"id":"https://openalex.org/keywords/weight-balanced-tree","display_name":"Weight-balanced tree","score":0.635726809501648},{"id":"https://openalex.org/keywords/binary-logarithm","display_name":"Binary logarithm","score":0.5947259664535522},{"id":"https://openalex.org/keywords/optimal-binary-search-tree","display_name":"Optimal binary search tree","score":0.5925793051719666},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.5362780094146729},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.43650734424591064},{"id":"https://openalex.org/keywords/graph-traversal","display_name":"Graph traversal","score":0.4187844395637512},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.41077959537506104},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.2821813225746155},{"id":"https://openalex.org/keywords/k-ary-tree","display_name":"K-ary tree","score":0.24876171350479126},{"id":"https://openalex.org/keywords/tree-structure","display_name":"Tree structure","score":0.1484513282775879}],"concepts":[{"id":"https://openalex.org/C140745168","wikidata":"https://www.wikidata.org/wiki/Q1210082","display_name":"Tree traversal","level":2,"score":0.9534615874290466},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7368450164794922},{"id":"https://openalex.org/C197855036","wikidata":"https://www.wikidata.org/wiki/Q380172","display_name":"Binary tree","level":2,"score":0.7121589183807373},{"id":"https://openalex.org/C91154448","wikidata":"https://www.wikidata.org/wiki/Q623818","display_name":"Binary search tree","level":3,"score":0.7014428973197937},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6703940033912659},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.6407715082168579},{"id":"https://openalex.org/C57900377","wikidata":"https://www.wikidata.org/wiki/Q7979855","display_name":"Weight-balanced tree","level":4,"score":0.635726809501648},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.5947259664535522},{"id":"https://openalex.org/C27628562","wikidata":"https://www.wikidata.org/wiki/Q17154715","display_name":"Optimal binary search tree","level":5,"score":0.5925793051719666},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.5362780094146729},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.43650734424591064},{"id":"https://openalex.org/C96333769","wikidata":"https://www.wikidata.org/wiki/Q907955","display_name":"Graph traversal","level":3,"score":0.4187844395637512},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.41077959537506104},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2821813225746155},{"id":"https://openalex.org/C100560664","wikidata":"https://www.wikidata.org/wiki/Q3608019","display_name":"K-ary tree","level":4,"score":0.24876171350479126},{"id":"https://openalex.org/C163797641","wikidata":"https://www.wikidata.org/wiki/Q2067937","display_name":"Tree structure","level":3,"score":0.1484513282775879},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1016/s1571-0661(04)80771-0","is_oa":true,"landing_page_url":"https://doi.org/10.1016/s1571-0661(04)80771-0","pdf_url":null,"source":{"id":"https://openalex.org/S50368787","display_name":"Electronic Notes in Theoretical Computer Science","issn_l":"1571-0661","issn":["1571-0661"],"is_oa":true,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":"cc-by-nc-nd","license_id":"https://openalex.org/licenses/cc-by-nc-nd","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Electronic Notes in Theoretical Computer Science","raw_type":"journal-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.81.6152","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.81.6152","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.maths.tcd.ie/report_series/tcdmath/tcdm0207.pdf","raw_type":"text"}],"best_oa_location":{"id":"doi:10.1016/s1571-0661(04)80771-0","is_oa":true,"landing_page_url":"https://doi.org/10.1016/s1571-0661(04)80771-0","pdf_url":null,"source":{"id":"https://openalex.org/S50368787","display_name":"Electronic Notes in Theoretical Computer Science","issn_l":"1571-0661","issn":["1571-0661"],"is_oa":true,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":"cc-by-nc-nd","license_id":"https://openalex.org/licenses/cc-by-nc-nd","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Electronic Notes in Theoretical Computer Science","raw_type":"journal-article"},"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/15","display_name":"Life in Land","score":0.6200000047683716}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":3,"referenced_works":["https://openalex.org/W1513400187","https://openalex.org/W2066268301","https://openalex.org/W2130055503"],"related_works":["https://openalex.org/W270522628","https://openalex.org/W2914983903","https://openalex.org/W2146997899","https://openalex.org/W2077383771","https://openalex.org/W2501849745","https://openalex.org/W2093708041","https://openalex.org/W4367055576","https://openalex.org/W2091985989","https://openalex.org/W2571039174","https://openalex.org/W2116714544"],"abstract_inverted_index":{"Splay":[0,57],"trees,":[1,72,74],"a":[2,37,146],"form":[3],"of":[4,62,87,106],"self-adjusting":[5],"binary":[6],"tree,":[7],"were":[8],"introduced":[9],"by":[10,152],"Sleator":[11,40,90],"and":[12,41,91,131,151],"Tarjan":[13,42],"in":[14],"the":[15,31,60,88,101,104,115,126,158,164],"early":[16],"1980s.":[17],"Their":[18],"main":[19],"use":[20],"is":[21,28,110,117,129,143],"to":[22,29,68],"store":[23],"ordered":[24],"lists.":[25],"The":[26],"idea":[27],"keep":[30],"trees":[32,54,58],"reasonably":[33],"well":[34],"balanced":[35],"through":[36,145],"'splay":[38],"heuristic'.":[39],"showed":[43],"that":[44,125],"if":[45,79],"amortised":[46],"rather":[47,147],"than":[48,70],"worst-case":[49],"times":[50],"are":[51,55,65],"considered,":[52],"splay":[53],"optimal.":[56],"have":[59],"advantage":[61],"simplicity:":[63],"they":[64],"much":[66],"easier":[67],"implement":[69],"2-3":[71],"AVL":[73],"or":[75,113],"red-black":[76],"trees.":[77],"What":[78],"one":[80],"uses":[81],"splaying":[82],"during":[83],"an":[84,133],"inorder":[85,108],"traversal":[86,109,127],"tree?":[89],"Tarjan's":[92],"analysis":[93],"guarantees":[94],"O(n":[95,134,159],"log":[96,135,136,160],"n)":[97,137,161],"overall":[98],"cost.":[99],"On":[100],"other":[102],"hand,":[103],"cost":[105],"ordinary":[107],"linear,":[111],"whether":[112],"not":[114],"tree":[116],"balanced.":[118],"We":[119],"present":[120],"some":[121],"data":[122],"which":[123],"suggests":[124],"time":[128],"O(n),":[130],"demonstrate":[132],"upper":[138,141],"bound.":[139],"This":[140],"bound":[142],"reached":[144],"unusual":[148],"unbounded-history":[149],"recurrence":[150],"using":[153],"weaker":[154],"bounds,":[155],"such":[156],"as":[157],"bound,":[162],"along":[163],"way.":[165]},"counts_by_year":[],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}