( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Analysis of a very large web search engine query log

, , , и . SIGIR Forum, 33 (1): 6--12 (сентября 1999)
DOI: 10.1145/331403.331405

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 Miehlnickel

Monika Bölter

Monika Feldmann

Monika Teuber

 

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

An Almost-Tight Distributed Algorithm for Computing Single-Source Shortest Paths., , и . CoRR, (2015)Design of Dynamic Algorithms via Primal-Dual Method., , и . CoRR, (2016)New deterministic approximation algorithms for fully dynamic matching., , и . STOC, стр. 398-411. ACM, (2016)Auctions with Heterogeneous Items and Budget Limits., , и . WINE, том 7695 из Lecture Notes in Computer Science, стр. 44-57. Springer, (2012)Capacity Releasing Diffusion for Speed and Locality., , , , и . ICML, том 70 из Proceedings of Machine Learning Research, стр. 3598-3607. PMLR, (2017)Mechanisms for the Marriage and the Assignment Game., и . CIAC, том 6078 из Lecture Notes in Computer Science, стр. 6-12. Springer, (2010)Multi-parameter Mechanism Design under Budget and Matroid Constraints., и . ESA, том 6942 из Lecture Notes in Computer Science, стр. 192-202. Springer, (2011)Maximizing revenue from strategic recommendations under decaying trust., , и . CIKM, стр. 2283-2286. ACM, (2012)Constant-Time Dynamic (Δ+1)-Coloring and Weight Approximation for Minimum Spanning Forest: Dynamic Algorithms Meet Property Testing., и . CoRR, (2019)Tight Bounds for Online Graph Partitioning., , , и . CoRR, (2020)