Author of the publication

Finding Hidden Cliques in Linear Time with High Probability.

, , and . Comb. Probab. Comput., 23 (1): 29-49 (2014)

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

Probability on Trees and Networks, and . Cambridge University Press, (2016)Non-Stochastic Multi-Player Multi-Armed Bandits: Optimal Rate With Collision Information, Sublinear Without., , , and . CoRR, (2019)Local Dynamics in Bargaining Networks via Random-Turn Games., , and . WINE, volume 6484 of Lecture Notes in Computer Science, page 133-144. Springer, (2010)A Birthday Paradox for Markov Chains, with an Optimal Bound for Collision in the Pollard Rho Algorithm for Discrete Logarithm., , , and . ANTS, volume 5011 of Lecture Notes in Computer Science, page 402-415. Springer, (2008)Bandit Convex Optimization: \(T\) Regret in One Dimension., , , and . COLT, volume 40 of JMLR Workshop and Conference Proceedings, page 266-278. JMLR.org, (2015)Recurrent graphs where two independent random walks collide finitely often, and . Electron. Comm. Probab., (2004)Trees and Markov convexity., , and . SODA, page 1028-1037. ACM Press, (2006)Fractals with Positive Length and Zero Buffon Needle Probability., , and . The American Mathematical Monthly, 110 (4): 314-325 (2003)Four Random Permutations Conjugated by an Adversary Generate $S_n$ with High Probability., , and . CoRR, (2014)Selling in Exclusive Markets: Some Observations on Prior-Free Mechanism Design., , and . ACM Trans. Economics and Comput., 1 (2): 7:1-7:31 (2013)