{"id":"https://openalex.org/W2005353519","doi":"https://doi.org/10.1145/2597631","title":"Efficient and Dynamic Algorithms for Alternating B\u00fcchi Games and Maximal End-Component Decomposition","display_name":"Efficient and Dynamic Algorithms for Alternating B\u00fcchi Games and Maximal End-Component Decomposition","publication_year":2014,"publication_date":"2014-05-01","ids":{"openalex":"https://openalex.org/W2005353519","doi":"https://doi.org/10.1145/2597631","mag":"2005353519"},"language":"en","primary_location":{"id":"doi:10.1145/2597631","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2597631","pdf_url":null,"source":{"id":"https://openalex.org/S118992489","display_name":"Journal of the ACM","issn_l":"0004-5411","issn":["0004-5411","1557-735X"],"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":"Journal of the ACM","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/A5052607806","display_name":"Krishnendu Chatterjee","orcid":"https://orcid.org/0000-0002-4561-241X"},"institutions":[{"id":"https://openalex.org/I157556583","display_name":"Institute of Science and Technology Austria","ror":"https://ror.org/03gnh5541","country_code":"AT","type":"education","lineage":["https://openalex.org/I157556583"]}],"countries":["AT"],"is_corresponding":false,"raw_author_name":"Krishnendu Chatterjee","raw_affiliation_strings":["IST, Austria","IST, Austria;"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"IST, Austria","institution_ids":["https://openalex.org/I157556583"]},{"raw_affiliation_string":"IST, Austria;","institution_ids":["https://openalex.org/I157556583"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5003641345","display_name":"Monika Henzinger","orcid":"https://orcid.org/0000-0002-5008-6530"},"institutions":[{"id":"https://openalex.org/I129774422","display_name":"University of Vienna","ror":"https://ror.org/03prydq77","country_code":"AT","type":"education","lineage":["https://openalex.org/I129774422"]}],"countries":["AT"],"is_corresponding":false,"raw_author_name":"Monika Henzinger","raw_affiliation_strings":["University of Vienna, Austria"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Vienna, Austria","institution_ids":["https://openalex.org/I129774422"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":9.8197,"has_fulltext":false,"cited_by_count":55,"citation_normalized_percentile":{"value":0.98520024,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":"61","issue":"3","first_page":"1","last_page":"40"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10142","display_name":"Formal Methods in Verification","score":0.9991999864578247,"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.9991999864578247,"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.996999979019165,"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/T11574","display_name":"Artificial Intelligence in Games","score":0.9914000034332275,"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/combinatorics","display_name":"Combinatorics","score":0.6287571787834167},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.5728681683540344},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5523145198822021},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5066607594490051},{"id":"https://openalex.org/keywords/probabilistic-logic","display_name":"Probabilistic logic","score":0.46972882747650146},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.44965696334838867},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.42710429430007935},{"id":"https://openalex.org/keywords/sequence","display_name":"Sequence (biology)","score":0.41803181171417236},{"id":"https://openalex.org/keywords/markov-chain","display_name":"Markov chain","score":0.41454562544822693},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.4122445285320282},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.3355785608291626}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6287571787834167},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.5728681683540344},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5523145198822021},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5066607594490051},{"id":"https://openalex.org/C49937458","wikidata":"https://www.wikidata.org/wiki/Q2599292","display_name":"Probabilistic logic","level":2,"score":0.46972882747650146},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.44965696334838867},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.42710429430007935},{"id":"https://openalex.org/C2778112365","wikidata":"https://www.wikidata.org/wiki/Q3511065","display_name":"Sequence (biology)","level":2,"score":0.41803181171417236},{"id":"https://openalex.org/C98763669","wikidata":"https://www.wikidata.org/wiki/Q176645","display_name":"Markov chain","level":2,"score":0.41454562544822693},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.4122445285320282},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3355785608291626},{"id":"https://openalex.org/C54355233","wikidata":"https://www.wikidata.org/wiki/Q7162","display_name":"Genetics","level":1,"score":0.0},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","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.1145/2597631","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2597631","pdf_url":null,"source":{"id":"https://openalex.org/S118992489","display_name":"Journal of the ACM","issn_l":"0004-5411","issn":["0004-5411","1557-735X"],"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":"Journal of the ACM","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Peace, Justice and strong institutions","score":0.6499999761581421,"id":"https://metadata.un.org/sdg/16"}],"awards":[{"id":"https://openalex.org/G2453763618","display_name":"Modern Graph Algorithmic Techniques in Formal Verification","funder_award_id":"P 23499","funder_id":"https://openalex.org/F4320321181","funder_display_name":"Austrian Science Fund"},{"id":"https://openalex.org/G5680279288","display_name":null,"funder_award_id":"S11407-N23 (RiSE)","funder_id":"https://openalex.org/F4320321181","funder_display_name":"Austrian Science Fund"},{"id":"https://openalex.org/G643268663","display_name":null,"funder_award_id":"(279307: Graph Games)","funder_id":"https://openalex.org/F4320334678","funder_display_name":"European Research Council"},{"id":"https://openalex.org/G8996196328","display_name":"Challenges in Sponsored Search Auctions","funder_award_id":"ICT10-002","funder_id":"https://openalex.org/F4320321003","funder_display_name":"Vienna Science and Technology Fund"}],"funders":[{"id":"https://openalex.org/F4320308943","display_name":"Microsoft Research","ror":"https://ror.org/00d0nc645"},{"id":"https://openalex.org/F4320321003","display_name":"Vienna Science and Technology Fund","ror":"https://ror.org/01f9mc681"},{"id":"https://openalex.org/F4320321181","display_name":"Austrian Science Fund","ror":"https://ror.org/013tf3c58"},{"id":"https://openalex.org/F4320334678","display_name":"European Research Council","ror":"https://ror.org/0472cxd90"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":63,"referenced_works":["https://openalex.org/W1491002653","https://openalex.org/W1491037212","https://openalex.org/W1496590343","https://openalex.org/W1505081061","https://openalex.org/W1506225460","https://openalex.org/W1539382740","https://openalex.org/W1570288637","https://openalex.org/W1584587517","https://openalex.org/W1608875152","https://openalex.org/W1624593473","https://openalex.org/W1667094241","https://openalex.org/W1698053229","https://openalex.org/W1748602292","https://openalex.org/W1816620374","https://openalex.org/W1850900101","https://openalex.org/W1930640507","https://openalex.org/W1966347268","https://openalex.org/W1968137129","https://openalex.org/W1971138850","https://openalex.org/W1972203711","https://openalex.org/W1979349468","https://openalex.org/W2011735245","https://openalex.org/W2016206563","https://openalex.org/W2020293036","https://openalex.org/W2020617153","https://openalex.org/W2022810653","https://openalex.org/W2025063471","https://openalex.org/W2028145673","https://openalex.org/W2030372341","https://openalex.org/W2038680194","https://openalex.org/W2043507528","https://openalex.org/W2044354687","https://openalex.org/W2048905609","https://openalex.org/W2060375000","https://openalex.org/W2085849292","https://openalex.org/W2093468548","https://openalex.org/W2106042170","https://openalex.org/W2113127944","https://openalex.org/W2115980619","https://openalex.org/W2118382442","https://openalex.org/W2125267391","https://openalex.org/W2131742729","https://openalex.org/W2138856440","https://openalex.org/W2162150822","https://openalex.org/W2170933628","https://openalex.org/W2178626170","https://openalex.org/W2182670256","https://openalex.org/W2293287097","https://openalex.org/W2319440520","https://openalex.org/W2394731499","https://openalex.org/W2561675875","https://openalex.org/W2610777504","https://openalex.org/W2615768957","https://openalex.org/W2801026249","https://openalex.org/W2963555463","https://openalex.org/W3023554972","https://openalex.org/W3100786387","https://openalex.org/W3136367277","https://openalex.org/W4205178514","https://openalex.org/W4212901716","https://openalex.org/W4241108585","https://openalex.org/W4242441073","https://openalex.org/W6828102672"],"related_works":["https://openalex.org/W2943623134","https://openalex.org/W1660242800","https://openalex.org/W2494523064","https://openalex.org/W2215759665","https://openalex.org/W2960358116","https://openalex.org/W2077211377","https://openalex.org/W2030292806","https://openalex.org/W3041172967","https://openalex.org/W2749065928","https://openalex.org/W2147155098"],"abstract_inverted_index":{"The":[0,27],"computation":[1],"of":[2,25,49,56,106,124,143,164,190,196,228,237,325,331,337],"the":[3,35,47,54,59,63,67,82,104,178,211,233,247,281,305,321,364],"winning":[4,108,179],"set":[5,105,180],"for":[6,33,102,110,156,181,215,246,285,368],"B\u00fcchi":[7,111,182,287],"objectives":[8,112,183],"in":[9,18,58,114,132,151,184,199,226,340],"alternating":[10,115,185,286],"games":[11,116,135,186],"on":[12],"graphs":[13],"is":[14,37,46,53,255,269,278],"a":[15,22,77,188,194,238,326,329,335],"central":[16],"problem":[17,36,225],"computer-aided":[19],"verification":[20,227],"with":[21,117,136],"large":[23],"number":[24,48,55],"applications.":[26],"long-standing":[28,306],"best":[29],"known":[30],"upper":[31],"bound":[32,92,123,142,163],"solving":[34],"\u00d5":[38,68,125],"(":[39,69,87,97,126,145,166,201,258,272,308,342,352],"n":[40,45,70,88,98,127,146,159,202,273,300,309,343],"\u00b7":[41,71,128,168,260,296,310],"m":[42,52,72,129,157,167,170,259,262,298,311,353],"),":[43],"where":[44],"vertices":[50,109],"and":[51,149,265,350],"edges":[57],"graph.":[60,239],"We":[61,172,218,240],"are":[62,210,363],"first":[64,212,253,365],"to":[65,85,95,176,319],"break":[66],")":[73,203,312,344,354],"boundary":[74],"by":[75],"presenting":[76],"new":[78],"technique":[79,283],"that":[80],"reduces":[81],"running":[83],"time":[84,205,313,346,356],"O":[86,96,144,165,200,257,271,293,307,341,351],"2":[89,99,274,301],").":[90],"This":[91],"also":[93],"leads":[94],")-time":[100,263,275],"algorithms":[101,209,214,245,362,367],"computing":[103,232],"almost-sure":[107],"(1)":[113],"probabilistic":[118,229],"transitions":[119],"(improving":[120,139,155],"an":[121,140,161,256,270,292],"earlier":[122,141,162],")),":[130,148],"(2)":[131],"concurrent":[133],"graph":[134,223,327],"constant":[137],"actions":[138],"3":[147],"(3)":[150],"Markov":[152],"decision":[153],"processes":[154],">":[158],"4/3":[160],"\u221a":[169,261,297],")).":[171],"then":[173,219],"show":[174,317],"how":[175,318],"maintain":[177,320],"under":[187,328],"sequence":[189,195,330,336],"edge":[191,197,332,338,348,358],"insertions":[192,333],"or":[193,334],"deletions":[198,339],"amortized":[204,345],"per":[206,347,357],"operation.":[207],"Our":[208,252],"dynamic":[213,366],"this":[216,369],"problem.":[217,251,370],"consider":[220],"another":[221],"core":[222],"theoretic":[224],"systems,":[230],"namely":[231],"maximal":[234,248,322],"end-component":[235,249,323],"decomposition":[236,250,324],"present":[241],"two":[242],"improved":[243],"static":[244],"algorithm":[254,268,276,303],"algorithm,":[264],"our":[266,361],"second":[267],"which":[277],"obtained":[279],"using":[280],"same":[282],"as":[284],"games.":[288],"Thus,":[289],"we":[290,316],"obtain":[291],"(min":[294],"{m":[295],",":[299],"})-time":[302],"improving":[304],"bound.":[314],"Finally,":[315],"deletion,":[349],"worst-case":[355],"insertion.":[359],"Again,":[360]},"counts_by_year":[{"year":2025,"cited_by_count":4},{"year":2024,"cited_by_count":4},{"year":2023,"cited_by_count":3},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":3},{"year":2020,"cited_by_count":4},{"year":2019,"cited_by_count":3},{"year":2018,"cited_by_count":5},{"year":2017,"cited_by_count":8},{"year":2016,"cited_by_count":10},{"year":2015,"cited_by_count":9},{"year":2014,"cited_by_count":1}],"updated_date":"2026-08-06T08:24:18.245995","created_date":"2025-10-10T00:00:00"}