{"id":"https://openalex.org/W1985245264","doi":"https://doi.org/10.1137/s0097539797317263","title":"Dominators in Linear Time","display_name":"Dominators in Linear Time","publication_year":1999,"publication_date":"1999-01-01","ids":{"openalex":"https://openalex.org/W1985245264","doi":"https://doi.org/10.1137/s0097539797317263","mag":"1985245264"},"language":"en","primary_location":{"id":"doi:10.1137/s0097539797317263","is_oa":false,"landing_page_url":"https://doi.org/10.1137/s0097539797317263","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/A5034291253","display_name":"Stephen Alstrup","orcid":"https://orcid.org/0000-0001-7896-8386"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Stephen Alstrup","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5074985275","display_name":"Dov Harel","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Dov Harel","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5088212535","display_name":"Peter W. Lauridsen","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Peter W. Lauridsen","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5039232562","display_name":"Mikkel Thorup","orcid":"https://orcid.org/0000-0001-5237-1709"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Mikkel Thorup","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5034291253"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":5.8608,"has_fulltext":false,"cited_by_count":146,"citation_normalized_percentile":{"value":0.96036585,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":100},"biblio":{"volume":"28","issue":"6","first_page":"2117","last_page":"2132"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10142","display_name":"Formal Methods in Verification","score":0.996399998664856,"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"}},"topics":[{"id":"https://openalex.org/T10142","display_name":"Formal Methods in Verification","score":0.996399998664856,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9955000281333923,"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/T12288","display_name":"Optimization and Search Problems","score":0.9955000281333923,"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/time-complexity","display_name":"Time complexity","score":0.6321570873260498},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5261620879173279},{"id":"https://openalex.org/keywords/flow","display_name":"Flow (mathematics)","score":0.5168941020965576},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4104197919368744},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.38056087493896484},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3269340395927429}],"concepts":[{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.6321570873260498},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5261620879173279},{"id":"https://openalex.org/C38349280","wikidata":"https://www.wikidata.org/wiki/Q1434290","display_name":"Flow (mathematics)","level":2,"score":0.5168941020965576},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4104197919368744},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.38056087493896484},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3269340395927429},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0}],"mesh":[],"locations_count":6,"locations":[{"id":"doi:10.1137/s0097539797317263","is_oa":false,"landing_page_url":"https://doi.org/10.1137/s0097539797317263","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:CiteSeerX.psu:10.1.1.22.50","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.22.50","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.it-c.dk/people/stephen/Papers/domsiam.ps","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.22.9016","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.22.9016","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.it-c.dk/people/stephen/Papers/tek96-35.ps","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.47.3474","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.47.3474","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.diku.dk/research/techreports/../published/97-28.ps.gz","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.53.4161","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.53.4161","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"ftp://ftp.diku.dk/diku/semantics/papers/D-320.ps.gz","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.57.5330","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.57.5330","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"ftp://ftp.diku.dk/pub/diku/users/stephen/domtec.ps","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":22,"referenced_works":["https://openalex.org/W1513250879","https://openalex.org/W1768003599","https://openalex.org/W1970691969","https://openalex.org/W1974231393","https://openalex.org/W1982205631","https://openalex.org/W1982842799","https://openalex.org/W1986261983","https://openalex.org/W2003312024","https://openalex.org/W2004116976","https://openalex.org/W2008441811","https://openalex.org/W2016658465","https://openalex.org/W2028503265","https://openalex.org/W2049105156","https://openalex.org/W2054420170","https://openalex.org/W2063301486","https://openalex.org/W2064617810","https://openalex.org/W2092576944","https://openalex.org/W2111379929","https://openalex.org/W2118382442","https://openalex.org/W2164485560","https://openalex.org/W2175995877","https://openalex.org/W2912027147"],"related_works":["https://openalex.org/W1979597421","https://openalex.org/W2007980826","https://openalex.org/W4245490552","https://openalex.org/W2061531152","https://openalex.org/W3002753104","https://openalex.org/W2077600819","https://openalex.org/W1587224694","https://openalex.org/W2042127053","https://openalex.org/W2142036596","https://openalex.org/W4238204885"],"abstract_inverted_index":{"A":[0],"linear":[1,122,128],"time":[2,123,129],"algorithm":[3,64,106,151],"is":[4,24,73],"presented":[5],"for":[6,19,65,134],"finding":[7],"dominators":[8],"in":[9,31,52,84,101,171],"control":[10,21],"flow":[11,22,36],"graphs.":[12],"1":[13],"Introduction":[14],"Finding":[15],"the":[16,27,32,66,74,80,147,153,168],"dominator":[17],"tree":[18],"a":[20,85,121],"graph":[23],"one":[25],"of":[26,34,76,82,149,155,167],"most":[28],"fundamental":[29],"problems":[30,137,170],"area":[33],"global":[35],"analysis":[37],"and":[38,56,78,100,111,152],"program":[39],"optimization":[40],"[2,":[41],"3,":[42],"4,":[43],"5,":[44,141],"10,":[45],"15].":[46],"The":[47,87],"problem":[48,67],"was":[49,68,107],"first":[50,164],"raised":[51],"1969":[53],"by":[54,109],"Lowry":[55],"Medlock":[57],"[15],":[58],"where":[59],"an":[60,103],"O(n":[61],"4":[62],")":[63],"proposed":[69],"(as":[70],"usual,":[71],"n":[72],"number":[75,81],"nodes":[77],"m":[79],"edges":[83],"graph).":[86],"result":[88],"has":[89,158],"been":[90,132,160],"improved":[91],"several":[92],"times":[93],"(see":[94,138],"e.g.":[95,139],"[1,":[96],"2,":[97],"17,":[98],"20]),":[99],"1979":[102],"O(mff(m;":[104],"n))":[105],"found":[108,133],"Lengauer":[110],"Tarjan":[112],"[14].":[113],"Finally,":[114],"at":[115],"STOC'85,":[116],"Dov":[117],"Harel":[118,144],"[11]":[119],"announced":[120],"algorithm.":[124],"Assuming":[125],"Harel's":[126,172],"result,":[127],"algorithms":[130],"have":[131],"many":[135],"other":[136],"[4,":[140],"10]).":[142],"However,":[143],"never":[145],"produced":[146],"details":[148],"his":[150,156],"soundness":[154],"approach":[157],"therefore":[159],"questioned.":[161],"Here":[162],"we":[163],"describe":[165],"some":[166],"concrete":[169],"approach,":[173],"...":[174]},"counts_by_year":[{"year":2024,"cited_by_count":4},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":4},{"year":2020,"cited_by_count":3},{"year":2019,"cited_by_count":6},{"year":2018,"cited_by_count":7},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":7},{"year":2015,"cited_by_count":14},{"year":2014,"cited_by_count":8},{"year":2013,"cited_by_count":10},{"year":2012,"cited_by_count":10}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}