{"id":"https://openalex.org/W2242691822","doi":"https://doi.org/10.1145/2764913","title":"Dominator Tree Certification and Divergent Spanning Trees","display_name":"Dominator Tree Certification and Divergent Spanning Trees","publication_year":2015,"publication_date":"2015-11-16","ids":{"openalex":"https://openalex.org/W2242691822","doi":"https://doi.org/10.1145/2764913","mag":"2242691822"},"language":"en","primary_location":{"id":"doi:10.1145/2764913","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2764913","pdf_url":null,"source":{"id":"https://openalex.org/S137348503","display_name":"ACM Transactions on Algorithms","issn_l":"1549-6325","issn":["1549-6325","1549-6333"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Transactions on Algorithms","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/A5024478433","display_name":"Loukas Georgiadis","orcid":"https://orcid.org/0000-0002-9706-7409"},"institutions":[{"id":"https://openalex.org/I194019607","display_name":"University of Ioannina","ror":"https://ror.org/01qg3j183","country_code":"GR","type":"education","lineage":["https://openalex.org/I194019607"]}],"countries":["GR"],"is_corresponding":true,"raw_author_name":"Loukas Georgiadis","raw_affiliation_strings":["University of Ioannina, Greece"],"affiliations":[{"raw_affiliation_string":"University of Ioannina, Greece","institution_ids":["https://openalex.org/I194019607"]}]},{"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 University and Intertrust Technologies, Princeton, NJ"],"affiliations":[{"raw_affiliation_string":"Princeton University and Intertrust Technologies, Princeton, NJ","institution_ids":["https://openalex.org/I20089843"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5024478433"],"corresponding_institution_ids":["https://openalex.org/I194019607"],"apc_list":null,"apc_paid":null,"fwci":2.92850242,"has_fulltext":false,"cited_by_count":18,"citation_normalized_percentile":{"value":0.9298346,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":"12","issue":"1","first_page":"1","last_page":"42"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10142","display_name":"Formal Methods in Verification","score":0.9993000030517578,"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.9993000030517578,"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.998199999332428,"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.9927999973297119,"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/correctness","display_name":"Correctness","score":0.9230921268463135},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7217866778373718},{"id":"https://openalex.org/keywords/certificate","display_name":"Certificate","score":0.657090961933136},{"id":"https://openalex.org/keywords/control-flow-graph","display_name":"Control flow graph","score":0.5764861106872559},{"id":"https://openalex.org/keywords/spanning-tree","display_name":"Spanning tree","score":0.5212774276733398},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.49389153718948364},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4678780734539032},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.41654539108276367},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.40512946248054504},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.23448297381401062},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.18684083223342896},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.06275922060012817}],"concepts":[{"id":"https://openalex.org/C55439883","wikidata":"https://www.wikidata.org/wiki/Q360812","display_name":"Correctness","level":2,"score":0.9230921268463135},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7217866778373718},{"id":"https://openalex.org/C96865113","wikidata":"https://www.wikidata.org/wiki/Q2946816","display_name":"Certificate","level":2,"score":0.657090961933136},{"id":"https://openalex.org/C27458966","wikidata":"https://www.wikidata.org/wiki/Q1187693","display_name":"Control flow graph","level":2,"score":0.5764861106872559},{"id":"https://openalex.org/C64331007","wikidata":"https://www.wikidata.org/wiki/Q831672","display_name":"Spanning tree","level":2,"score":0.5212774276733398},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.49389153718948364},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4678780734539032},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.41654539108276367},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.40512946248054504},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.23448297381401062},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.18684083223342896},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.06275922060012817}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/2764913","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2764913","pdf_url":null,"source":{"id":"https://openalex.org/S137348503","display_name":"ACM Transactions on Algorithms","issn_l":"1549-6325","issn":["1549-6325","1549-6333"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Transactions on Algorithms","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":65,"referenced_works":["https://openalex.org/W55887128","https://openalex.org/W80750942","https://openalex.org/W103911866","https://openalex.org/W130397153","https://openalex.org/W976211528","https://openalex.org/W1510700297","https://openalex.org/W1676865579","https://openalex.org/W1811642211","https://openalex.org/W1951501494","https://openalex.org/W1971061054","https://openalex.org/W1974231393","https://openalex.org/W1982205631","https://openalex.org/W1985245264","https://openalex.org/W1985701647","https://openalex.org/W1986022261","https://openalex.org/W1990854931","https://openalex.org/W1993449345","https://openalex.org/W1996839061","https://openalex.org/W2001331197","https://openalex.org/W2007143180","https://openalex.org/W2010188140","https://openalex.org/W2011379509","https://openalex.org/W2014665344","https://openalex.org/W2015485656","https://openalex.org/W2016000144","https://openalex.org/W2022175859","https://openalex.org/W2023541076","https://openalex.org/W2026511056","https://openalex.org/W2027991598","https://openalex.org/W2032370604","https://openalex.org/W2035780934","https://openalex.org/W2036227822","https://openalex.org/W2039800402","https://openalex.org/W2039846580","https://openalex.org/W2043310936","https://openalex.org/W2046567643","https://openalex.org/W2049105156","https://openalex.org/W2054253211","https://openalex.org/W2070852497","https://openalex.org/W2072988564","https://openalex.org/W2075288969","https://openalex.org/W2076850117","https://openalex.org/W2079000395","https://openalex.org/W2082318969","https://openalex.org/W2102888019","https://openalex.org/W2111117034","https://openalex.org/W2111379929","https://openalex.org/W2118382442","https://openalex.org/W2119179558","https://openalex.org/W2119424404","https://openalex.org/W2141116886","https://openalex.org/W2146441023","https://openalex.org/W2150566739","https://openalex.org/W2153351498","https://openalex.org/W2161872042","https://openalex.org/W2165901913","https://openalex.org/W2170095699","https://openalex.org/W2185197589","https://openalex.org/W2258857078","https://openalex.org/W2539250576","https://openalex.org/W2752853835","https://openalex.org/W2911781688","https://openalex.org/W2949209817","https://openalex.org/W4256575237","https://openalex.org/W4285719527"],"related_works":["https://openalex.org/W2404647514","https://openalex.org/W1667647204","https://openalex.org/W4247536566","https://openalex.org/W2018477250","https://openalex.org/W3119814709","https://openalex.org/W4241418540","https://openalex.org/W1508895727","https://openalex.org/W2725786787","https://openalex.org/W4283160672","https://openalex.org/W2132134937"],"abstract_inverted_index":{"How":[0,143],"does":[1,144],"one":[2,33,58,145],"verify":[3,123,146,198],"that":[4,17,36,107,124,147,213],"the":[5,18,27,37,45,54,63,66,89,105,120,125,129,135,148,168,175,199,202,222,227,258],"output":[6,38,97],"of":[7,29,65,139,151,170,177,201,229,261],"a":[8,41,51,74,85,100,108,152,171,184,188,216,235],"complicated":[9,79],"program":[10,19,91,111],"is":[11,20,84,114,155],"correct?":[12,156],"One":[13],"can":[14,34,118],"formally":[15,81],"prove":[16,62],"correct,":[21],"but":[22,98],"this":[23,140],"may":[24,76],"be":[25,77],"beyond":[26],"power":[28],"existing":[30],"methods.":[31],"Alternatively,":[32],"check":[35],"produced":[39],"for":[40,160,187],"particular":[42],"input":[43],"satisfies":[44,128],"desired":[46,130],"input--output":[47,55,126,131],"relation":[48],"by":[49],"running":[50],"checker":[52,75],"on":[53],"pair.":[56],"Then":[57],"only":[59,95,262],"needs":[60],"to":[61,80,92,116,122,193,196,207,226,242,257],"correctness":[64,101,113,169,185,200,217],"checker.":[67],"For":[68],"some":[69],"problems,":[70],"however,":[71],"even":[72,166],"such":[73,244],"too":[78],"verify.":[82],"There":[83],"third":[86],"alternative:":[87],"augment":[88,208],"original":[90],"produce":[93,215],"not":[94],"an":[96],"also":[99,220],"certificate":[102,121,186,224],",":[103],"with":[104],"property":[106],"very":[109],"simple":[110],"(whose":[112],"easy":[115],"prove)":[117],"use":[119,194],"pair":[127],"relation.":[132],"We":[133,182,219],"consider":[134],"following":[136],"important":[137],"instance":[138],"general":[141],"question:":[142],"dominator":[149,172,189,223],"tree":[150,173],"flow":[153,236],"graph":[154],"Existing":[157],"fast":[158,209],"algorithms":[159,211,241,248,254],"finding":[161,230],"dominators":[162],"are":[163],"complicated,":[164],"and":[165,204,238,265],"verifying":[167],"in":[174,234,250],"absence":[176],"additional":[178],"information":[179],"seems":[180],"complicated.":[181],"define":[183],"tree,":[190,203],"show":[191,205],"how":[192,206],"it":[195],"easily":[197],"dominator-finding":[210],"so":[212],"they":[214,266],"certificate.":[218],"relate":[221],"problem":[225,228],"divergent":[231],"spanning":[232],"trees":[233],"graph,":[237],"we":[239],"develop":[240],"find":[243],"trees.":[245],"All":[246],"our":[247],"run":[249],"linear":[251],"time.":[252,271],"Previous":[253],"apply":[255],"just":[256],"special":[259],"case":[260],"trivial":[263],"dominators,":[264],"take":[267],"at":[268],"least":[269],"quadratic":[270]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":1},{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":2},{"year":2019,"cited_by_count":2},{"year":2018,"cited_by_count":2},{"year":2017,"cited_by_count":3},{"year":2016,"cited_by_count":4}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}