I am a research scientist at Google Research (New York office). In January 2014, I
received my PhD in computer science from MIT (CSAIL) under supervision of Professor
Erik D. Demaine. I work on applying optimization techniques to various practical
problems in order to find provably efficient algorithms. In particular, I am
interested in Submodular Optimization and its applications in large scale data mining
and machine learning problems.
-
Consistent Hashing with Bounded Loads
Vahab Mirrokni, Mikkel Thorup, Morteza Zadimoghaddam
Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms
(2018), pp. 587-604
-
Bicriteria Distributed Submodular Maximization in a Few Rounds
Alessandro Epasto, Vahab Mirrokni, Morteza Zadimoghaddam
SPAA (2017)
-
Bicriteria Distributed Submodular Maximization in a
Few Rounds
Alessandro Epasto, Morteza Zadimoghaddam, Vahab Mirrokni
29th ACM Symposium on Parallelism in Algorithms and Architectures SPAA 2017 (to
appear)
-
Scalable Feature Selection via Distributed
Diversity Maximization
Sepehr Abbasi Zadeh, Mehrdad Ghadiri, Vahab S.
Mirrokni, Morteza Zadimoghaddam
AAAI (2017), pp. 2876-2883
-
Submodular Optimization Over Sliding Windows
Alessandro Epasto, Morteza Zadimoghaddam, Sergei Vassilvitskii, Silvio Lattanzi
Proceedings of the 26th International World Wide Web Conference, WWW (2017)
-
Greedy Column Subset Selection: New Bounds and
Distributed Algorithms
Aditya Bhaskara, Afshin Rostamizadeh, Jason
Altschuler, Morteza Zadimoghaddam,
Thomas Fu, Vahab
Mirrokni
ICML (2016) (to appear)
-
Horizontally Scalable Submodular Maximization
Mario Lučić, Olivier Bachem, Morteza Zadimoghaddam, Andreas Krause
International Conference on Machine Learning (2016)
-
Online Stochastic Matching with Unequal Probabilities
Aranyak Mehta, Bo Waggoner, Morteza Zadimoghaddam
SODA, SIAM (2015), pp. 1388-1404
-
Online Submodular Welfare Maximization: Greedy
Beats 1/2 in Random Order
Nitish Korula, Vahab S. Mirrokni, Morteza Zadimoghaddam
STOC (2015), pp. 889-898
-
Randomized Composable Core-sets for Distributed
Submodular Maximization
Vahab S. Mirrokni, Morteza Zadimoghaddam
CoRR, vol. abs/1506.06715 (2015)
-
Randomized Composable Core-sets for Distributed
Submodular Maximization
Vahab S. Mirrokni, Morteza Zadimoghaddam
STOC (2015), pp. 153-162
-
Revenue Maximization with Nonexcludable Goods
Mohammadhossein Bateni, Nima Haghpanah, Balasubramanian Sivan, Morteza Zadimoghaddam
Transactions on Economics and Computation (2015)
-
Bicriteria Online Matching: Maximizing Weight and Cardinality
Nitish Korula, Vahab S. Mirrokni, Morteza Zadimoghaddam
WINE (2013), pp. 305-318
-
Revenue Maximization with Nonexcludable Goods
Mohammadhossein Bateni, Nima Haghpanah, Balasubramanian Sivan, Morteza Zadimoghaddam
Internet and Network Economics - 9th International Workshop, WINE 2013, Springer
-
Submodular secretary problems with extensions
Mohammadhossein Bateni, MohammadTaghi Hajiaghayi,
Morteza Zadimoghaddam
ACM Transactions on Algorithms, vol. 9 (4) (2013)
-
Submodular secretary problems with extensions
Mohammadhossein Bateni, MohammadTaghi Hajiaghayi,
Morteza Zadimoghaddam
ACM Transactions on Algorithms, vol. 9 (4) (2013)
-
Simultaneous Approximations for Adversarial and Stochastic Online Budgeted
Allocation
Vahab Mirrokni, Shayan Oveis Gharan, Morteza Zadimoghaddam
Symposium on Discrete Algorithms (SODA), ACM/SIAM (2012)
-
Online Stochastic Weighted Matching: Improved Approximation Algorithms
Bernard Haeupler, Vahab Mirrokni, Morteza Zadimoghaddam
Workshop of Network and Internet Economics (WINE) 2011
-
Permutation betting markets: singleton betting with extra information
Mohammad Ghodsi, Hamid Mahini, Vahab S.
Mirrokni, Morteza Zadimoghaddam
ACM Conference on Electronic Commerce (2008), pp. 180-189
