Author pages are created from data sourced from our academic publisher partnerships and public sources.
- Publications
- Influence
Share This Author
Locality-sensitive hashing scheme based on p-stable distributions
- Mayur Datar, Nicole Immorlica, P. Indyk, V. Mirrokni
- Computer ScienceSCG '04
- 8 June 2004
TLDR
Maximizing Non-Monotone Submodular Functions
- U. Feige, V. Mirrokni, J. Vondrák
- Mathematics48th Annual IEEE Symposium on Foundations of…
- 21 October 2007
Submodular maximization generalizes many important problems including Max Cut in directed/undirected graphs and hypergraphs, certain constraint satisfaction problems and maximum facility location…
Online Stochastic Matching: Beating 1-1/e
- J. Feldman, Aranyak Mehta, V. Mirrokni, S. Muthukrishnan
- Computer Science50th Annual IEEE Symposium on Foundations of…
- 25 May 2009
TLDR
Approximating submodular functions everywhere
- M. Goemans, Nicholas J. A. Harvey, S. Iwata, V. Mirrokni
- Mathematics, Computer ScienceSODA
- 4 January 2009
TLDR
Stochastic bandits robust to adversarial corruptions
- Thodoris Lykouris, V. Mirrokni, Renato Paes Leme
- Computer ScienceSTOC
- 25 March 2018
We introduce a new model of stochastic bandits with adversarial corruptions which aims to capture settings where most of the input follows a stochastic pattern but some fraction of it can be…
Optimal marketing strategies over social networks
- Jason D. Hartline, V. Mirrokni, Mukund Sundararajan
- BusinessWWW
- 21 April 2008
TLDR
Non-monotone submodular maximization under matroid and knapsack constraints
- Jon Lee, V. Mirrokni, V. Nagarajan, M. Sviridenko
- Mathematics, Computer ScienceSTOC '09
- 2 February 2009
TLDR
Sink equilibria and convergence
- M. Goemans, V. Mirrokni, A. Vetta
- Economics46th Annual IEEE Symposium on Foundations of…
- 23 October 2005
TLDR
Online Ad Assignment with Free Disposal
- J. Feldman, Nitish Korula, V. Mirrokni, S. Muthukrishnan, Martin Pál
- Computer ScienceWINE
- 9 December 2009
We study an online weighted assignment problem with a set of fixed nodes corresponding to advertisers and online arrival of nodes corresponding to ad impressions. Advertiser a has a contract for n(a)…
Tight approximation algorithms for maximum general assignment problems
- L. Fleischer, M. Goemans, V. Mirrokni, M. Sviridenko
- Computer ScienceSODA '06
- 22 January 2006
TLDR
...
...