{"id":"https://openalex.org/W2799045007","doi":"https://doi.org/10.1145/3209108.3209115","title":"A modal \u03bc perspective on solving parity games in quasi-polynomial time","display_name":"A modal \u03bc perspective on solving parity games in quasi-polynomial time","publication_year":2018,"publication_date":"2018-06-27","ids":{"openalex":"https://openalex.org/W2799045007","doi":"https://doi.org/10.1145/3209108.3209115","mag":"2799045007"},"language":"en","primary_location":{"id":"doi:10.1145/3209108.3209115","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3209108.3209115","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 33rd Annual ACM/IEEE Symposium on Logic in Computer Science","raw_type":"proceedings-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/A5039866284","display_name":"Karoliina Lehtinen","orcid":"https://orcid.org/0000-0003-1171-8790"},"institutions":[{"id":"https://openalex.org/I32021983","display_name":"Kiel University","ror":"https://ror.org/04v76ef78","country_code":"DE","type":"education","lineage":["https://openalex.org/I32021983"]}],"countries":["DE"],"is_corresponding":true,"raw_author_name":"Karoliina Lehtinen","raw_affiliation_strings":["Kiel University, Kiel, Germany"],"affiliations":[{"raw_affiliation_string":"Kiel University, Kiel, Germany","institution_ids":["https://openalex.org/I32021983"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5039866284"],"corresponding_institution_ids":["https://openalex.org/I32021983"],"apc_list":null,"apc_paid":null,"fwci":3.231,"has_fulltext":false,"cited_by_count":24,"citation_normalized_percentile":{"value":0.93033618,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":99},"biblio":{"volume":null,"issue":null,"first_page":"639","last_page":"648"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"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"}},"topics":[{"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/T10374","display_name":"Advanced Graph Theory Research","score":0.9923999905586243,"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.989300012588501,"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/parity","display_name":"Parity (physics)","score":0.6996824145317078},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.590673565864563},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.5139769911766052},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.46266818046569824},{"id":"https://openalex.org/keywords/polynomial","display_name":"Polynomial","score":0.4504174590110779},{"id":"https://openalex.org/keywords/modal","display_name":"Modal","score":0.448882520198822},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.43961861729621887},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.42108750343322754},{"id":"https://openalex.org/keywords/bisimulation","display_name":"Bisimulation","score":0.4201820194721222},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.32384687662124634}],"concepts":[{"id":"https://openalex.org/C2777151079","wikidata":"https://www.wikidata.org/wiki/Q141160","display_name":"Parity (physics)","level":2,"score":0.6996824145317078},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.590673565864563},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.5139769911766052},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.46266818046569824},{"id":"https://openalex.org/C90119067","wikidata":"https://www.wikidata.org/wiki/Q43260","display_name":"Polynomial","level":2,"score":0.4504174590110779},{"id":"https://openalex.org/C71139939","wikidata":"https://www.wikidata.org/wiki/Q910194","display_name":"Modal","level":2,"score":0.448882520198822},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.43961861729621887},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.42108750343322754},{"id":"https://openalex.org/C135315306","wikidata":"https://www.wikidata.org/wiki/Q866364","display_name":"Bisimulation","level":2,"score":0.4201820194721222},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.32384687662124634},{"id":"https://openalex.org/C185592680","wikidata":"https://www.wikidata.org/wiki/Q2329","display_name":"Chemistry","level":0,"score":0.0},{"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/C109214941","wikidata":"https://www.wikidata.org/wiki/Q18334","display_name":"Particle physics","level":1,"score":0.0},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0},{"id":"https://openalex.org/C188027245","wikidata":"https://www.wikidata.org/wiki/Q750446","display_name":"Polymer chemistry","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3209108.3209115","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3209108.3209115","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 33rd Annual ACM/IEEE Symposium on Logic in Computer Science","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G2048510855","display_name":null,"funder_award_id":"01IS160253","funder_id":"https://openalex.org/F4320321114","funder_display_name":"Bundesministerium f\u00fcr Bildung und Forschung"}],"funders":[{"id":"https://openalex.org/F4320321114","display_name":"Bundesministerium f\u00fcr Bildung und Forschung","ror":"https://ror.org/04pz7b180"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":20,"referenced_works":["https://openalex.org/W1136438031","https://openalex.org/W1487444734","https://openalex.org/W1507873625","https://openalex.org/W1564580204","https://openalex.org/W1567990440","https://openalex.org/W1591239571","https://openalex.org/W1917713630","https://openalex.org/W1977644778","https://openalex.org/W2047201474","https://openalex.org/W2067543765","https://openalex.org/W2141252092","https://openalex.org/W2142133061","https://openalex.org/W2170933628","https://openalex.org/W2586521831","https://openalex.org/W2593234065","https://openalex.org/W2753906754","https://openalex.org/W2783006893","https://openalex.org/W2950091953","https://openalex.org/W3142358799","https://openalex.org/W4214702250"],"related_works":["https://openalex.org/W1495872178","https://openalex.org/W1522712643","https://openalex.org/W2136070637","https://openalex.org/W2102135785","https://openalex.org/W2783071694","https://openalex.org/W1553849808","https://openalex.org/W1976268573","https://openalex.org/W2089212807","https://openalex.org/W2963587252","https://openalex.org/W1774334694"],"abstract_inverted_index":{"We":[0],"present":[1],"a":[2,14],"new":[3,15],"quasi-polynomial":[4],"algorithm":[5],"for":[6,21],"solving":[7],"parity":[8,22],"games.":[9],"It":[10],"is":[11,48],"based":[12],"on":[13],"bisimulation":[16],"invariant":[17],"measure":[18],"of":[19,31,41],"complexity":[20,30],"games,":[23],"called":[24],"the":[25,29,32,39],"register-index,":[26],"which":[27],"captures":[28],"priority":[33],"assignment.":[34],"For":[35],"fixed":[36],"parameter":[37],"k,":[38],"class":[40],"games":[42],"with":[43],"register-index":[44],"bounded":[45],"by":[46],"k":[47],"solvable":[49],"in":[50],"polynomial":[51],"time.":[52]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":3},{"year":2021,"cited_by_count":3},{"year":2020,"cited_by_count":6},{"year":2019,"cited_by_count":7},{"year":2017,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}