( en | de | ru )

 

Disambiguation of "Henzinger, Monika"

Author of the publication

copydeleteadd this publication to your clipboard
Symbolic algorithms for qualitative analysis of Markov decision processes with Büchi objectives.

, , , and . Formal Methods Syst. Des., 42 (3): 301-327 (2013)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Monika Mühlbauer

Modelling wall interactions of a high-pressure, hollow cone spray. TU Darmstadt, (2009)

Monika Behnke

Monika Oppermann

Monika Jacob

Monika Weitze

 

Other publications of authors with the same name

Fully Dynamic Single-Source Reachability in Practice: An Experimental Study., , and . CoRR, (2019)Improved Algorithms for Decremental Single-Source Reachability on Directed Graphs., , and . ICALP (1), volume 9134 of Lecture Notes in Computer Science, page 725-736. Springer, (2015)Sublinear-Time Maintenance of Breadth-First Spanning Tree in Partially Dynamic Networks., , and . ICALP (2), volume 7966 of Lecture Notes in Computer Science, page 607-619. Springer, (2013)Graph Minors for Preserving Terminal Distances Approximately - Lower and Upper Bounds., , and . ICALP, volume 55 of LIPIcs, page 131:1-131:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2016)Ad Exchange: Envy-Free Auctions with Mediators., , and . WINE, volume 9470 of Lecture Notes in Computer Science, page 104-117. Springer, (2015)Efficient and Dynamic Algorithms for Alternating Büchi Games and Maximal End-Component Decomposition., and . J. ACM, 61 (3): 15:1-15:40 (2014)Practical Fully Dynamic Minimum Cut Algorithms., , and . ALENEX, page 13-26. SIAM, (2022)Query-free news search., , , and . WWW, page 1-10. ACM, (2003)Finding near-duplicate web pages: a large-scale evaluation of algorithms.. SIGIR, page 284-291. ACM, (2006)A deterministic almost-tight distributed algorithm for approximating single-source shortest paths., , and . STOC, page 489-498. ACM, (2016)