( en | de | ru )

 

Disambiguation of "Henzinger, Monika"

Author of the publication

copydeleteadd this publication to your clipboard
Almost Tight Error Bounds on Differentially Private Continual Counting.

, , and . SODA, page 5003-5039. SIAM, (2023)

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 Weiß

Monika Mynarska

Monika Becker

Monika Zwerger

 

Other publications of authors with the same name

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)Constant-Time Dynamic (Δ+1)-Coloring., and . STACS, volume 154 of LIPIcs, page 53:1-53:18. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2020)Improved Guarantees for Vertex Sparsification in Planar Graphs., , and . SIAM J. Discret. Math., 34 (1): 130-162 (2020)Faster Fully Dynamic Transitive Closure in Practice., , and . SEA, volume 160 of LIPIcs, page 14:1-14:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2020)Efficient and Dynamic Algorithms for Alternating Büchi Games and Maximal End-Component Decomposition., and . J. ACM, 61 (3): 15:1-15:40 (2014)Dynamic Approximate Maximum Independent Set of Intervals, Hypercubes and Hyperrectangles., , and . SoCG, volume 164 of LIPIcs, page 51:1-51:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2020)Recent Advances in Fully Dynamic Graph Algorithms (Invited Talk)., , and . SAND, volume 221 of LIPIcs, page 1:1-1:47. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2022)Fine-Grained Complexity Lower Bounds for Problems in Computer Aided Verification.. Principles of Systems Design, volume 13660 of Lecture Notes in Computer Science, page 292-305. Springer, (2022)Practical Fully Dynamic Minimum Cut Algorithms., , and . ALENEX, page 13-26. SIAM, (2022)