( en | de | ru )

 

Disambiguation of "Henzinger, Monika"

Author of the publication

copydeleteadd this publication to your clipboard
A Combinatorial Cut-Based Algorithm for Solving Laplacian Linear Systems.

, , and . CoRR, (2020)

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 Mynarska

Monika Schumann

Monika Mochtarova

Monika Wacker

 

Other publications of authors with the same name

Valuation Compressions in VCG-Based Combinatorial Auctions., , and . ACM Trans. Economics and Comput., 6 (2): 5:1-5:18 (2018)Deterministic Dynamic Matching in O(1) Update Time., , and . Algorithmica, 82 (4): 1057-1080 (2020)Symbolic algorithms for qualitative analysis of Markov decision processes with Büchi objectives., , , and . Formal Methods Syst. Des., 42 (3): 301-327 (2013)Recent Advances in Fully Dynamic Graph Algorithms - A Quick Reference Guide., , and . ACM J. Exp. Algorithmics, (2022)Constant-Time Dynamic (Δ+1)-Coloring and Weight Approximation for Minimum Spanning Forest: Dynamic Algorithms Meet Property Testing., and . CoRR, (2019)Fast Dynamic Cuts, Distances and Effective Resistances via Vertex Sparsifiers., , , , and . FOCS, page 1135-1146. IEEE, (2020)Fine-Grained Complexity Lower Bounds for Families of Dynamic Graphs., , and . ESA, volume 244 of LIPIcs, page 65:1-65:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2022)Differentially Private Algorithms for Graphs Under Continual Observation., , and . ESA, volume 204 of LIPIcs, page 42:1-42:16. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2021)Faster Submodular Maximization for Several Classes of Matroids., , , and . ICALP, volume 261 of LIPIcs, page 74:1-74:18. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2023)Fully Dynamic k-Center Clustering in Low Dimensional Metrics., , , , and . ALENEX, page 143-153. SIAM, (2021)