default search action
Monika Henzinger
- > Home > Persons > Monika Henzinger
Publications
- 2021
- [j73]Krishnendu Chatterjee
, Wolfgang Dvorák, Monika Henzinger
Algorithms and conditional lower bounds for planning problems. Artif. Intell. 297: 103499 (2021) - [c133]Krishnendu Chatterjee, Monika Henzinger
Faster Algorithms for Bounded Liveness in Graphs and Game Graphs. ICALP 2021: 124:1-124:21 - [c132]Krishnendu Chatterjee, Wolfgang Dvorák, Monika Henzinger
Symbolic Time and Space Tradeoffs for Probabilistic Verification. LICS 2021: 1-13 - [i87]Krishnendu Chatterjee, Wolfgang Dvorák, Monika Henzinger, Alexander Svozil:
Symbolic Time and Space Tradeoffs for Probabilistic Verification. CoRR abs/2104.07466 (2021) - 2019
- [c116]Krishnendu Chatterjee, Wolfgang Dvorák, Monika Henzinger
Near-Linear Time Algorithms for Streett Objectives in Graphs and MDPs. CONCUR 2019: 7:1-7:16 - [i58]Krishnendu Chatterjee, Wolfgang Dvorák, Monika Henzinger, Alexander Svozil:
Quasipolynomial Set-Based Symbolic Algorithms for Parity Games. CoRR abs/1909.04983 (2019) - [i57]Krishnendu Chatterjee, Wolfgang Dvorák, Monika Henzinger, Alexander Svozil:
Near-Linear Time Algorithms for Streett Objectives in Graphs and MDPs. CoRR abs/1909.05539 (2019) - 2018
- [c109]Krishnendu Chatterjee, Wolfgang Dvorák, Monika Henzinger, Alexander Svozil:
Algorithms and Conditional Lower Bounds for Planning Problems. ICAPS 2018: 56-64 - [c107]Krishnendu Chatterjee, Monika Henzinger, Veronika Loitzenbauer, Simin Oraee, Viktor Toman
Symbolic Algorithms for Graphs and Markov Decision Processes with Fairness Objectives. CAV (2) 2018: 178-197 - [c104]Krishnendu Chatterjee, Wolfgang Dvorák, Monika Henzinger
Quasipolynomial Set-Based Symbolic Algorithms for Parity Games. LPAR 2018: 233-253 - [c102]Krishnendu Chatterjee
Lower Bounds for Symbolic Computation on Graphs: Strongly Connected Components, Liveness, Safety, and Diameter. SODA 2018: 2341-2356 - [i51]Krishnendu Chatterjee, Monika Henzinger, Veronika Loitzenbauer, Simin Oraee, Viktor Toman:
Symbolic Algorithms for Graphs and Markov Decision Processes with Fairness Objectives. CoRR abs/1804.00206 (2018) - [i50]Krishnendu Chatterjee, Wolfgang Dvorák, Monika Henzinger, Alexander Svozil:
Algorithms and Conditional Lower Bounds for Planning Problems. CoRR abs/1804.07031 (2018) - 2017
- [j56]Krishnendu Chatterjee
Improved Algorithms for Parity and Streett objectives. Log. Methods Comput. Sci. 13(3) (2017) - [c99]Krishnendu Chatterjee
Improved Set-Based Symbolic Algorithms for Parity Games. CSL 2017: 18:1-18:21 - [c91]Krishnendu Chatterjee
Faster Algorithms for Mean-Payoff Parity Games. MFCS 2017: 39:1-39:14 - [i42]Krishnendu Chatterjee, Wolfgang Dvorák, Monika Henzinger, Veronika Loitzenbauer:
Improved Set-based Symbolic Algorithms for Parity Games. CoRR abs/1706.04889 (2017) - [i40]Krishnendu Chatterjee, Monika Henzinger, Alexander Svozil:
Faster Algorithms for Mean-Payoff Parity Games. CoRR abs/1706.06139 (2017) - [i36]Krishnendu Chatterjee, Wolfgang Dvorák, Monika Henzinger, Veronika Loitzenbauer:
Lower Bounds for Symbolic Computation on Graphs: Strongly Connected Components, Liveness, Safety, and Diameter. CoRR abs/1711.09148 (2017) - 2016
- [c85]Krishnendu Chatterjee, Wolfgang Dvorák, Monika Henzinger
Model and Objective Separation with Conditional Lower Bounds: Disjunction is Harder than Conjunction. LICS 2016: 197-206 - [c84]Krishnendu Chatterjee, Wolfgang Dvorák, Monika Henzinger
Conditionally Optimal Algorithms for Generalized Büchi Games. MFCS 2016: 25:1-25:15 - [i34]Krishnendu Chatterjee, Wolfgang Dvorák, Monika Henzinger, Veronika Loitzenbauer:
Model and Objective Separation with Conditional Lower Bounds: Disjunction is Harder than Conjunction. CoRR abs/1602.02670 (2016) - [i29]Krishnendu Chatterjee, Monika Henzinger, Sebastian Krinninger, Danupon Nanongkai:
Polynomial-Time Algorithms for Energy Games with Special Weight Structures. CoRR abs/1604.08234 (2016) - [i27]Krishnendu Chatterjee, Wolfgang Dvorák, Monika Henzinger, Veronika Loitzenbauer:
Conditionally Optimal Algorithms for Generalized Büchi Games. CoRR abs/1607.05850 (2016) - 2015
- [c78]Krishnendu Chatterjee
Improved Algorithms for One-Pair and k-Pair Streett Objectives. LICS 2015: 269-280 - 2014
- [j46]Krishnendu Chatterjee, Monika Henzinger
Polynomial-Time Algorithms for Energy Games with Special Weight Structures. Algorithmica 70(3): 457-492 (2014) - [j45]Krishnendu Chatterjee, Monika Henzinger:
Efficient and Dynamic Algorithms for Alternating Büchi Games and Maximal End-Component Decomposition. J. ACM 61(3): 15:1-15:40 (2014) - [j44]Krishnendu Chatterjee
Approximating the minimum cycle mean. Theor. Comput. Sci. 547: 104-116 (2014) - [i13]Krishnendu Chatterjee, Monika Henzinger, Veronika Loitzenbauer:
Improved Algorithms for One-Pair and k-Pair Streett Objectives. CoRR abs/1410.0833 (2014) - 2013
- [j43]Krishnendu Chatterjee, Monika Henzinger
Symbolic algorithms for qualitative analysis of Markov decision processes with Büchi objectives. Formal Methods Syst. Des. 42(3): 301-327 (2013) - [c61]Krishnendu Chatterjee, Monika Henzinger, Sebastian Krinninger, Veronika Loitzenbauer:
Approximating the minimum cycle mean. GandALF 2013: 136-149 - 2012
- [c59]Krishnendu Chatterjee, Monika Henzinger, Sebastian Krinninger
Polynomial-Time Algorithms for Energy Games with Special Weight Structures. ESA 2012: 301-312 - [c57]Krishnendu Chatterjee, Monika Henzinger:
An O(n2) time algorithm for alternating Büchi games. SODA 2012: 1386-1399 - 2011
- [c55]Krishnendu Chatterjee, Monika Henzinger, Manas Joglekar, Nisarg Shah:
Symbolic Algorithms for Qualitative Analysis of Markov Decision Processes with Büchi Objectives. CAV 2011: 260-276 - [c53]Krishnendu Chatterjee, Monika Henzinger:
Faster and Dynamic Algorithms for Maximal End-Component Decomposition and Related Graph Problems in Probabilistic Verification. SODA 2011: 1318-1336 - [i7]Krishnendu Chatterjee, Monika Henzinger, Manas Joglekar, Nisarg Shah:
Symbolic Algorithms for Qualitative Analysis of Markov Decision Processes with Büchi Objectives. CoRR abs/1104.3348 (2011) - [i6]Krishnendu Chatterjee, Monika Henzinger:
An O(n^2) Time Algorithm for Alternating Büchi Games. CoRR abs/1109.5018 (2011)
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-10-18 00:55 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: