{"id":"https://openalex.org/W2014665344","doi":"https://doi.org/10.1137/070693217","title":"Linear-Time Algorithms for Dominators and Other Path-Evaluation Problems","display_name":"Linear-Time Algorithms for Dominators and Other Path-Evaluation Problems","publication_year":2008,"publication_date":"2008-01-01","ids":{"openalex":"https://openalex.org/W2014665344","doi":"https://doi.org/10.1137/070693217","mag":"2014665344"},"language":"en","primary_location":{"id":"doi:10.1137/070693217","is_oa":false,"landing_page_url":"https://doi.org/10.1137/070693217","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":false,"raw_author_name":"Adam L. Buchsbaum","raw_affiliation_strings":["alb@adambuchsbaum.com#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"alb@adambuchsbaum.com#TAB#","institution_ids":[]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5024478433","display_name":"Loukas Georgiadis","orcid":"https://orcid.org/0000-0002-9706-7409"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Loukas Georgiadis","raw_affiliation_strings":["lgeorg@uowm.gr#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"lgeorg@uowm.gr#TAB#","institution_ids":[]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5006699796","display_name":"Haim Kaplan","orcid":"https://orcid.org/0000-0001-9586-8002"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Haim Kaplan","raw_affiliation_strings":["haimk@math.tau.ac.il#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"haimk@math.tau.ac.il#TAB#","institution_ids":[]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5105838185","display_name":"Anne Rogers","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Anne Rogers","raw_affiliation_strings":["amr@cs.uchicago.edu#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"amr@cs.uchicago.edu#TAB#","institution_ids":[]}]},{"author_position":"middle","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":["ret@cs.princeton.edu#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"ret@cs.princeton.edu#TAB#","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5034718361","display_name":"Jeffery Westbrook","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Jeffery R. Westbrook","raw_affiliation_strings":["jwestbrook@acm.org#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"jwestbrook@acm.org#TAB#","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":5.0977,"has_fulltext":false,"cited_by_count":77,"citation_normalized_percentile":{"value":0.94887271,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":99},"biblio":{"volume":"38","issue":"4","first_page":"1533","last_page":"1573"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10743","display_name":"Software Testing and Debugging Techniques","score":0.9994999766349792,"subfield":{"id":"https://openalex.org/subfields/1712","display_name":"Software"},"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/T10743","display_name":"Software Testing and Debugging Techniques","score":0.9994999766349792,"subfield":{"id":"https://openalex.org/subfields/1712","display_name":"Software"},"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/T10142","display_name":"Formal Methods in Verification","score":0.9994000196456909,"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/T10126","display_name":"Logic, programming, and type systems","score":0.9983000159263611,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.700850784778595},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.6256601810455322},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.5738059878349304},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.48345884680747986},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.4120245575904846},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3222084939479828},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.25577473640441895}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.700850784778595},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.6256601810455322},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.5738059878349304},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.48345884680747986},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.4120245575904846},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3222084939479828},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.25577473640441895},{"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/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1137/070693217","is_oa":false,"landing_page_url":"https://doi.org/10.1137/070693217","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":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":45,"referenced_works":["https://openalex.org/W1963524245","https://openalex.org/W1965525854","https://openalex.org/W1965680834","https://openalex.org/W1969221581","https://openalex.org/W1978099551","https://openalex.org/W1982205631","https://openalex.org/W1985245264","https://openalex.org/W1986022261","https://openalex.org/W1986261983","https://openalex.org/W1995618045","https://openalex.org/W1999545213","https://openalex.org/W2003312024","https://openalex.org/W2004116976","https://openalex.org/W2011999472","https://openalex.org/W2018804864","https://openalex.org/W2023658462","https://openalex.org/W2028503265","https://openalex.org/W2028782479","https://openalex.org/W2032370604","https://openalex.org/W2032841680","https://openalex.org/W2041995828","https://openalex.org/W2044146725","https://openalex.org/W2044332144","https://openalex.org/W2046946959","https://openalex.org/W2047839530","https://openalex.org/W2049105156","https://openalex.org/W2057945184","https://openalex.org/W2085849292","https://openalex.org/W2086323458","https://openalex.org/W2087216833","https://openalex.org/W2089290774","https://openalex.org/W2089591958","https://openalex.org/W2092576944","https://openalex.org/W2103913570","https://openalex.org/W2111117034","https://openalex.org/W2111379929","https://openalex.org/W2118382442","https://openalex.org/W2133337074","https://openalex.org/W2138304862","https://openalex.org/W2141116886","https://openalex.org/W2144344516","https://openalex.org/W2146441023","https://openalex.org/W2150788670","https://openalex.org/W2152506249","https://openalex.org/W2164485560"],"related_works":["https://openalex.org/W2371125232","https://openalex.org/W2023505575","https://openalex.org/W2386767533","https://openalex.org/W2365333639","https://openalex.org/W1986684738","https://openalex.org/W2373437113","https://openalex.org/W2384974102","https://openalex.org/W2316925676","https://openalex.org/W2013504000","https://openalex.org/W2365371251"],"abstract_inverted_index":{"We":[0,223],"present":[1],"linear-time":[2,36,164],"algorithms":[3,40,98,126],"for":[4,15,166],"the":[5,66,118,130,151,158,199,202,205,215,220,245],"classic":[6],"problem":[7,247],"of":[8,57,72,85,113,121,132,147,153,160,198,217,219],"finding":[9,95,167],"dominators":[10,203,246],"in":[11,28,43,138,157,187,201,211],"a":[12,23,29,54,62,77,81,86,114,122,133,142,154,161,176,188,195],"flowgraph,":[13,115],"and":[14,80,105,116,214,232,237],"several":[16],"other":[17],"problems":[18,34],"whose":[19],"solutions":[20,37],"require":[21,129],"evaluating":[22],"function":[24],"defined":[25],"on":[26,141],"paths":[27],"tree.":[30,124],"Although":[31],"all":[32],"these":[33],"had":[35],"previously,":[38],"our":[39,97,148,228],"are":[41],"simpler,":[42],"some":[44],"cases":[45],"substantially.":[46],"Our":[47,125,192],"improvements":[48],"come":[49],"from":[50],"three":[51],"new":[52],"ideas:":[53],"refined":[55],"analysis":[56,112,159],"path":[58],"compression":[59],"that":[60],"gives":[61],"linear":[63,139,212],"bound":[64],"if":[65],"compressions":[67],"favor":[68],"certain":[69],"nodes;":[70],"replacement":[71],"random-access":[73,134],"table":[74],"look-up":[75],"by":[76],"radix":[78],"sort;":[79],"more":[82,177],"careful":[83],"partitioning":[84],"tree":[87,120],"into":[88],"easily":[89],"managed":[90],"parts.":[91],"In":[92],"addition":[93],"to":[94,174,184,208,226,238,244],"dominators,":[96],"find":[99],"nearest":[100],"common":[101],"ancestors":[102],"off-line,":[103],"verify":[104],"construct":[106],"minimum":[107],"spanning":[108],"trees,":[109],"do":[110,127],"interval":[111],"build":[117],"component":[119],"weighted":[123],"not":[128],"power":[131],"machine;":[135],"they":[136],"run":[137],"time":[140],"pointer":[143],"machine.":[144],"The":[145],"genesis":[146],"work":[149,193],"was":[150,171,182],"discovery":[152],"subtle":[155],"error":[156],"previous":[162],"allegedly":[163],"algorithm":[165,170],"dominators.":[168],"That":[169],"an":[172],"attempt":[173],"simplify":[175],"complicated":[178],"algorithm,":[179],"which":[180],"itself":[181],"intended":[183],"correct":[185],"errors":[186],"yet":[189],"earlier":[190,242],"algorithm.":[191],"provides":[194],"systematic":[196],"study":[197],"subtleties":[200],"problem,":[204],"techniques":[206,229],"needed":[207],"solve":[209],"it":[210],"time,":[213],"range":[216],"application":[218],"resulting":[221],"methods.":[222],"have":[224],"tried":[225],"make":[227],"as":[230,233,235],"simple":[231],"general":[234],"possible":[236],"understand":[239],"exactly":[240],"how":[241],"approaches":[243],"were":[248],"either":[249],"incorrect":[250],"or":[251],"overly":[252],"complicated.":[253]},"counts_by_year":[{"year":2025,"cited_by_count":4},{"year":2024,"cited_by_count":3},{"year":2023,"cited_by_count":2},{"year":2021,"cited_by_count":4},{"year":2020,"cited_by_count":2},{"year":2019,"cited_by_count":5},{"year":2018,"cited_by_count":7},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":10},{"year":2015,"cited_by_count":12},{"year":2014,"cited_by_count":6},{"year":2013,"cited_by_count":6},{"year":2012,"cited_by_count":5}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}