( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Almost Tight Error Bounds on Differentially Private Continual Counting.

, , и . SODA, стр. 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.

Monika Mühlbauer

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

Monika Weiß

Monika Frey

Monika Wacker

Monika Woszczyna

 

Другие публикации лиц с тем же именем

An Almost-Tight Distributed Algorithm for Computing Single-Source Shortest Paths., , и . CoRR, (2015)New deterministic approximation algorithms for fully dynamic matching., , и . STOC, стр. 398-411. ACM, (2016)A Comparison of Techniques for Sampling Web Pages., , , , и . STACS, том 3 из LIPIcs, стр. 13-30. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, Germany, (2009)Fully Dynamic k-Center Clustering in Low Dimensional Metrics., , , , и . ALENEX, стр. 143-153. SIAM, (2021)Tight Bounds for Online Graph Partitioning., , , и . CoRR, (2020)Symbolic algorithms for qualitative analysis of Markov decision processes with Büchi objectives., , , и . Formal Methods Syst. Des., 42 (3): 301-327 (2013)Deterministic Dynamic Matching in O(1) Update Time., , и . Algorithmica, 82 (4): 1057-1080 (2020)Algorithms and Hardness for Diameter in Dynamic Graphs., , , , и . CoRR, (2018)On Multiple Round Sponsored Search Auctions with Budgets, , , и . CoRR, (2011)Fast Dynamic Cuts, Distances and Effective Resistances via Vertex Sparsifiers., , , , и . FOCS, стр. 1135-1146. IEEE, (2020)