{"id":"https://openalex.org/W2133337074","doi":"https://doi.org/10.1137/s0097539792242144","title":"Data-Structural Bootstrapping, Linear Path Compression, and Catenable Heap-Ordered Double-Ended Queues","display_name":"Data-Structural Bootstrapping, Linear Path Compression, and Catenable Heap-Ordered Double-Ended Queues","publication_year":1995,"publication_date":"1995-12-01","ids":{"openalex":"https://openalex.org/W2133337074","doi":"https://doi.org/10.1137/s0097539792242144","mag":"2133337074"},"language":"en","primary_location":{"id":"doi:10.1137/s0097539792242144","is_oa":false,"landing_page_url":"https://doi.org/10.1137/s0097539792242144","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Computing","raw_type":"journal-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/A5111424583","display_name":"Adam L. Buchsbaum","orcid":null},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Adam L. Buchsbaum","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5069418281","display_name":"R. Sundar","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Rajamani Sundar","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5051027549","display_name":"Robert E. Tarjan","orcid":"https://orcid.org/0000-0001-7505-5768"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Robert E. Tarjan","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5111424583"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":3.2283,"has_fulltext":false,"cited_by_count":17,"citation_normalized_percentile":{"value":0.93833393,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":95},"biblio":{"volume":"24","issue":"6","first_page":"1190","last_page":"1206"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11106","display_name":"Data Management and Algorithms","score":0.996999979019165,"subfield":{"id":"https://openalex.org/subfields/1711","display_name":"Signal Processing"},"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/T11106","display_name":"Data Management and Algorithms","score":0.996999979019165,"subfield":{"id":"https://openalex.org/subfields/1711","display_name":"Signal Processing"},"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/T10374","display_name":"Advanced Graph Theory Research","score":0.9968000054359436,"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"}},{"id":"https://openalex.org/T10317","display_name":"Advanced Database Systems and Queries","score":0.9957000017166138,"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/heap","display_name":"Heap (data structure)","score":0.7863684892654419},{"id":"https://openalex.org/keywords/bootstrapping","display_name":"Bootstrapping (finance)","score":0.6956555247306824},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5233551859855652},{"id":"https://openalex.org/keywords/queue","display_name":"Queue","score":0.5197693705558777},{"id":"https://openalex.org/keywords/data-structure","display_name":"Data structure","score":0.44792744517326355},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.43019014596939087},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.4189912676811218},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.38769441843032837},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3862582743167877},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.33672478795051575},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.09047135710716248},{"id":"https://openalex.org/keywords/econometrics","display_name":"Econometrics","score":0.08754751086235046}],"concepts":[{"id":"https://openalex.org/C134757568","wikidata":"https://www.wikidata.org/wiki/Q274089","display_name":"Heap (data structure)","level":2,"score":0.7863684892654419},{"id":"https://openalex.org/C207609745","wikidata":"https://www.wikidata.org/wiki/Q4944086","display_name":"Bootstrapping (finance)","level":2,"score":0.6956555247306824},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5233551859855652},{"id":"https://openalex.org/C160403385","wikidata":"https://www.wikidata.org/wiki/Q220543","display_name":"Queue","level":2,"score":0.5197693705558777},{"id":"https://openalex.org/C162319229","wikidata":"https://www.wikidata.org/wiki/Q175263","display_name":"Data structure","level":2,"score":0.44792744517326355},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.43019014596939087},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.4189912676811218},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.38769441843032837},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3862582743167877},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.33672478795051575},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.09047135710716248},{"id":"https://openalex.org/C149782125","wikidata":"https://www.wikidata.org/wiki/Q160039","display_name":"Econometrics","level":1,"score":0.08754751086235046}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1137/s0097539792242144","is_oa":false,"landing_page_url":"https://doi.org/10.1137/s0097539792242144","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Computing","raw_type":"journal-article"},{"id":"pmh:oai:eprints.iisc.ac.in:14321","is_oa":false,"landing_page_url":null,"pdf_url":null,"source":{"id":"https://openalex.org/S4377196309","display_name":"NOT FOUND REPOSITORY (Indian Institute of Science Bangalore)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I59270414","host_organization_name":"Indian Institute of Science Bangalore","host_organization_lineage":["https://openalex.org/I59270414"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"acceptedVersion","is_accepted":true,"is_published":false,"raw_source_name":"","raw_type":"Journal Article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.10.4209","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.10.4209","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"ftp://ftp.cs.princeton.edu/reports/1992/381.ps.gz","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":18,"referenced_works":["https://openalex.org/W1513400187","https://openalex.org/W1859351765","https://openalex.org/W1970691969","https://openalex.org/W1977902399","https://openalex.org/W1987927249","https://openalex.org/W2010615668","https://openalex.org/W2012867943","https://openalex.org/W2017644881","https://openalex.org/W2019176509","https://openalex.org/W2044146725","https://openalex.org/W2044674329","https://openalex.org/W2051750343","https://openalex.org/W2057945184","https://openalex.org/W2065759448","https://openalex.org/W2078199146","https://openalex.org/W2094127279","https://openalex.org/W2103913570","https://openalex.org/W2139946774"],"related_works":["https://openalex.org/W3158777280","https://openalex.org/W1534274833","https://openalex.org/W3117246195","https://openalex.org/W2019530272","https://openalex.org/W1578255156","https://openalex.org/W4299986738","https://openalex.org/W2479720249","https://openalex.org/W1552130108","https://openalex.org/W4293570236","https://openalex.org/W1862002564"],"abstract_inverted_index":{"A":[0],"deque":[1],"with":[2,11],"heap":[3],"order":[4],"is":[5,57,72,108],"a":[6,48,54,60,73,145],"linear":[7,155],"list":[8],"of":[9,19,24,39,93,135,144,148],"elements":[10,20],"real-valued":[12],"keys":[13],"that":[14,111,151],"allows":[15,29],"insertions":[16],"and":[17],"deletions":[18],"at":[21],"both":[22],"ends":[23],"the":[25,30,37,136,142],"list.":[26],"It":[27],"also":[28,58],"findmin":[31],"(alternatively":[32],"findmax)":[33],"operation,":[34],"which":[35],"returns":[36],"element":[38],"least":[40],"(greatest)":[41],"key,":[42],"but":[43],"it":[44],"does":[45],"not":[46],"allow":[47],"general":[49],"deletemin":[50],"(deletemax)":[51],"operation.":[52,102],"Such":[53],"data":[55,138],"structure":[56,139],"called":[59],"mindeque":[61],"(maxdeque).":[62],"Whereas":[63],"implementing":[64],"heap-ordered":[65,77,95,118],"deques":[66,78,119],"in":[67,79],"constant":[68,98],"time":[69,81,100],"per":[70,101],"operation":[71],"solved":[74],"problem,":[75],"catenating":[76],"sublogarithmic":[80],"has":[82],"remained":[83],"open":[84],"until":[85],"now.":[86],"This":[87],"paper":[88],"provides":[89],"an":[90,109],"efficient":[91],"implementation":[92],"catenable":[94],"deques,":[96],"yielding":[97],"amortized":[99],"The":[103,133],"important":[104],"algorithmic":[105],"technique":[106],"employed":[107],"idea":[110],"we":[112,116,152],"call":[113],"data-structural":[114],"bootstrapping;":[115],"abstract":[117],"by":[120,123],"representing":[121],"them":[122],"their":[124],"minimum":[125],"elements,":[126],"thereby":[127],"reducing":[128],"catenation":[129],"to":[130],"simple":[131],"insertion,":[132],"efficiency":[134],"resulting":[137],"depends":[140],"upon":[141],"complexity":[143],"special":[146],"case":[147],"path":[149],"compression":[150],"prove":[153],"takes":[154],"time.":[156]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2013,"cited_by_count":1}],"updated_date":"2026-04-05T17:49:38.594831","created_date":"2025-10-10T00:00:00"}