Author of the publication

Fraud Detection for Random Walks.

, , , and . ITCS, volume 287 of LIPIcs, page 36:1-36:22. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2024)

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.

 

Other publications of authors with the same name

Tight bounds on the threshold for permuted k-colorability, , and . CoRR, (2011)Scalable Mechanisms for Rational Secret Sharing, , and . CoRR, (2012)Robbing the bandit: less regret in online geometric optimization against an adaptive adversary., and . SODA, page 937-943. ACM Press, (2006)Error limiting reductions between classification tasks., , , , and . ICML, volume 119 of ACM International Conference Proceeding Series, page 49-56. ACM, (2005)Brief announcement: breaking the O(nm) bit barrier, secure multiparty computation with a static adversary., , , and . PODC, page 227-228. ACM, (2012)Resource-competitive error correction.. FOMC, page 53-58. ACM, (2014)Fraud Detection for Random Walks., , , and . ITCS, volume 287 of LIPIcs, page 36:1-36:22. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2024)Tight Bounds on the Threshold for Permuted k-Colorability., , and . APPROX-RANDOM, volume 7408 of Lecture Notes in Computer Science, page 505-516. Springer, (2012)An Empirical Comparison of Algorithms for Aggregating Expert Predictions., , , , and . UAI, AUAI Press, (2006)A Scalable Algorithm for Multiparty Interactive Communication with Private Channels., , , and . ICDCN, page 8:1-8:15. ACM, (2020)