{"id":"https://openalex.org/W1967459785","doi":"https://doi.org/10.1137/0218001","title":"Amortized Analysis of Algorithms for Set Union with Backtracking","display_name":"Amortized Analysis of Algorithms for Set Union with Backtracking","publication_year":1989,"publication_date":"1989-02-01","ids":{"openalex":"https://openalex.org/W1967459785","doi":"https://doi.org/10.1137/0218001","mag":"1967459785"},"language":"en","primary_location":{"id":"doi:10.1137/0218001","is_oa":false,"landing_page_url":"https://doi.org/10.1137/0218001","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/A5034718361","display_name":"Jeffery Westbrook","orcid":null},"institutions":[{"id":"https://openalex.org/I20089843","display_name":"Princeton University","ror":"https://ror.org/00hx57361","country_code":"US","type":"education","lineage":["https://openalex.org/I20089843"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Jeffery Westbrook","raw_affiliation_strings":["Princeton Univ., Princeton , NJ"],"affiliations":[{"raw_affiliation_string":"Princeton Univ., Princeton , NJ","institution_ids":["https://openalex.org/I20089843"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5051027549","display_name":"Robert E. Tarjan","orcid":"https://orcid.org/0000-0001-7505-5768"},"institutions":[{"id":"https://openalex.org/I20089843","display_name":"Princeton University","ror":"https://ror.org/00hx57361","country_code":"US","type":"education","lineage":["https://openalex.org/I20089843"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Robert E. Tarjan","raw_affiliation_strings":["Princeton Univ., Princeton, NJ; and AT&T Bell Labs, Murray Hill, NJ"],"affiliations":[{"raw_affiliation_string":"Princeton Univ., Princeton, NJ; and AT&T Bell Labs, Murray Hill, NJ","institution_ids":["https://openalex.org/I20089843"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5034718361"],"corresponding_institution_ids":["https://openalex.org/I20089843"],"apc_list":null,"apc_paid":null,"fwci":3.4101,"has_fulltext":false,"cited_by_count":33,"citation_normalized_percentile":{"value":0.91715514,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":95},"biblio":{"volume":"18","issue":"1","first_page":"1","last_page":"11"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.9984999895095825,"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.9984999895095825,"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/T11567","display_name":"semigroups and automata theory","score":0.996999979019165,"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/T10374","display_name":"Advanced Graph Theory Research","score":0.9945999979972839,"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/amortized-analysis","display_name":"Amortized analysis","score":0.8856716156005859},{"id":"https://openalex.org/keywords/binary-logarithm","display_name":"Binary logarithm","score":0.6345702409744263},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6134107112884521},{"id":"https://openalex.org/keywords/disjoint-union","display_name":"Disjoint union (topology)","score":0.5751851797103882},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5703591108322144},{"id":"https://openalex.org/keywords/separable-space","display_name":"Separable space","score":0.5288739204406738},{"id":"https://openalex.org/keywords/disjoint-sets","display_name":"Disjoint sets","score":0.5207234025001526},{"id":"https://openalex.org/keywords/backtracking","display_name":"Backtracking","score":0.5132687091827393},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.4993777275085449},{"id":"https://openalex.org/keywords/pointer","display_name":"Pointer (user interface)","score":0.49340906739234924},{"id":"https://openalex.org/keywords/reachability","display_name":"Reachability","score":0.46223312616348267},{"id":"https://openalex.org/keywords/undo","display_name":"Undo","score":0.46145686507225037},{"id":"https://openalex.org/keywords/data-structure","display_name":"Data structure","score":0.44154274463653564},{"id":"https://openalex.org/keywords/running-time","display_name":"Running time","score":0.4306154251098633},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.39920398592948914},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.30442506074905396}],"concepts":[{"id":"https://openalex.org/C142417499","wikidata":"https://www.wikidata.org/wiki/Q331716","display_name":"Amortized analysis","level":3,"score":0.8856716156005859},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.6345702409744263},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6134107112884521},{"id":"https://openalex.org/C7655956","wikidata":"https://www.wikidata.org/wiki/Q5282259","display_name":"Disjoint union (topology)","level":2,"score":0.5751851797103882},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5703591108322144},{"id":"https://openalex.org/C70710897","wikidata":"https://www.wikidata.org/wiki/Q680081","display_name":"Separable space","level":2,"score":0.5288739204406738},{"id":"https://openalex.org/C45340560","wikidata":"https://www.wikidata.org/wiki/Q215382","display_name":"Disjoint sets","level":2,"score":0.5207234025001526},{"id":"https://openalex.org/C156884757","wikidata":"https://www.wikidata.org/wiki/Q798554","display_name":"Backtracking","level":2,"score":0.5132687091827393},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.4993777275085449},{"id":"https://openalex.org/C150202949","wikidata":"https://www.wikidata.org/wiki/Q107602","display_name":"Pointer (user interface)","level":2,"score":0.49340906739234924},{"id":"https://openalex.org/C136643341","wikidata":"https://www.wikidata.org/wiki/Q1361526","display_name":"Reachability","level":2,"score":0.46223312616348267},{"id":"https://openalex.org/C2780154230","wikidata":"https://www.wikidata.org/wiki/Q513420","display_name":"Undo","level":2,"score":0.46145686507225037},{"id":"https://openalex.org/C162319229","wikidata":"https://www.wikidata.org/wiki/Q175263","display_name":"Data structure","level":2,"score":0.44154274463653564},{"id":"https://openalex.org/C3017489831","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Running time","level":2,"score":0.4306154251098633},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.39920398592948914},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.30442506074905396},{"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/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C31972630","wikidata":"https://www.wikidata.org/wiki/Q844240","display_name":"Computer vision","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1137/0218001","is_oa":false,"landing_page_url":"https://doi.org/10.1137/0218001","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"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":12,"referenced_works":["https://openalex.org/W1511919025","https://openalex.org/W1523292012","https://openalex.org/W1540489185","https://openalex.org/W1986022261","https://openalex.org/W1986261983","https://openalex.org/W1987927249","https://openalex.org/W2009798194","https://openalex.org/W2028503265","https://openalex.org/W2044146725","https://openalex.org/W2067411846","https://openalex.org/W2147229148","https://openalex.org/W2989713547"],"related_works":["https://openalex.org/W2156227836","https://openalex.org/W2010959460","https://openalex.org/W2027888460","https://openalex.org/W2777026024","https://openalex.org/W1967459785","https://openalex.org/W289333067","https://openalex.org/W4310633558","https://openalex.org/W4382239252","https://openalex.org/W1530081940","https://openalex.org/W3214192781"],"abstract_inverted_index":{"Mannila":[0],"and":[1],"Ukkonen":[2],"[Lecture":[3],"Notes":[4],"in":[5,27,97],"Computer":[6],"Science":[7],"225,":[8],"Springer-Verlag,":[9],"New":[10],"York,":[11],"1986,":[12],"pp.":[13],"236\u2013243]":[14],"have":[15,75],"studied":[16],"a":[17,47,117],"variant":[18],"of":[19,80,95],"the":[20,36,92,99,108,129],"classical":[21],"disjoint":[22],"set":[23,52],"union":[24,40,53],"(equivalence)":[25],"problem":[26,130],"which":[28],"an":[29,76],"extra":[30],"operation,":[31,88,141],"called":[32],"de-union,":[33],"can":[34,111],"undo":[35],"most":[37,71],"recently":[38],"performed":[39],"operation":[41],"not":[42],"yet":[43],"undone.":[44],"They":[45],"proposed":[46],"way":[48],"to":[49,55,114],"modify":[50],"standard":[51],"algorithms":[54,63,74,102],"handle":[56],"de-union":[57],"operations.":[58],"In":[59],"this":[60],"paper":[61],"several":[62],"are":[64],"analyzed":[65],"based":[66],"on":[67,148],"their":[68],"approach.":[69],"The":[70,120],"efficient":[72],"such":[73],"amortized":[77,149],"running":[78],"time":[79,139,150],"$O({{\\log":[81],"n}":[82,134],"/":[83,135],"{\\log":[84,136],"\\log":[85,137],"n}})$":[86,138],"per":[87,140],"where":[89],"n":[90],"is":[91,151],"total":[93],"number":[94],"elements":[96],"all":[98],"sets.":[100],"These":[101],"use":[103],"$O(n\\log":[104],"n)$":[105],"space,":[106],"but":[107],"space":[109],"usage":[110],"be":[112],"reduced":[113],"$O(n)$":[115],"by":[116],"simple":[118],"change.":[119],"authors":[121],"prove":[122],"that":[123,144],"any":[124],"separable":[125],"pointer-based":[126],"algorithm":[127],"for":[128],"requires":[131],"$\\Omega":[132],"({{\\log":[133],"thus":[142],"showing":[143],"our":[145],"upper":[146],"bound":[147],"tight.":[152]},"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":2},{"year":2015,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}