Morteza Zadimoghaddam
Publication record assembled from the DBLP archive of ranked conferences.
Papers indexed
45
Venues
18
Active years
2007–2025
Best venue rank
A*
Where they publish
Papers
45 indexed papers, newest first.
| Year | Venue | Title | Authors |
|---|---|---|---|
| 2025 | ICML | Scalable Private Partition Selection via Adaptive Weighting. | Justin Y. Chen, Vincent Cohen-Addad, Alessandro Epasto, Morteza Zadimoghaddam |
| 2025 | STOC | The Cost of Consistency: Submodular Maximization with Constant Recourse. | Paul Dtting, Federico Fusco, Silvio Lattanzi, Ashkan Norouzi-Fard, Ola Svensson, Morteza Zadimoghaddam |
| 2024 | ICML | Consistent Submodular Maximization. | Paul Duetting, Federico Fusco, Silvio Lattanzi, Ashkan Norouzi-Fard, Morteza Zadimoghaddam |
| 2023 | ICML | Fully Dynamic Submodular Maximization over Matroids. | Paul Duetting, Federico Fusco, Silvio Lattanzi, Ashkan Norouzi-Fard, Morteza Zadimoghaddam |
| 2022 | ICML | Deletion Robust Submodular Maximization over Matroids. | Paul Duetting, Federico Fusco, Silvio Lattanzi, Ashkan Norouzi-Fard, Morteza Zadimoghaddam |
| 2020 | FOCS | Edge-Weighted Online Bipartite Matching. | Matthew Fahrbach, Zhiyi Huang, Runzhou Tao, Morteza Zadimoghaddam |
| 2020 | ITA | Residual Based Sampling for Online Low Rank Approximation. | Aditya Bhaskara, Silvio Lattanzi, Sergei Vassilvitskii, Morteza Zadimoghaddam |
| 2019 | FOCS | Residual Based Sampling for Online Low Rank Approximation. | Aditya Bhaskara, Silvio Lattanzi, Sergei Vassilvitskii, Morteza Zadimoghaddam |
| 2019 | ICML | Submodular Streaming in All Its Glory: Tight Approximation, Minimum Memory and Low Adaptive Complexity. | Ehsan Kazemi, Marko Mitrovic, Morteza Zadimoghaddam, Silvio Lattanzi, Amin Karbasi |
| 2019 | ICML | Non-monotone Submodular Maximization with Nearly Optimal Adaptivity and Query Complexity. | Matthew Fahrbach, Vahab S. Mirrokni, Morteza Zadimoghaddam |
| 2019 | PODS | Better Sliding Window Algorithms to Maximize Subadditive and Diversity Objectives. | Michele Borassi, Alessandro Epasto, Silvio Lattanzi, Sergei Vassilvitskii, Morteza Zadimoghaddam |
| 2019 | SODA | Submodular Maximization with Nearly Optimal Approximation, Adaptivity and Query Complexity. | Matthew Fahrbach, Vahab S. Mirrokni, Morteza Zadimoghaddam |
| 2019 | SPAA | Scalable Diversity Maximization via Small-size Composable Core-sets (Brief Announcement). | Alessandro Epasto, Vahab S. Mirrokni, Morteza Zadimoghaddam |
| 2018 | ICML | Scalable Deletion-Robust Submodular Maximization: Data Summarization with Privacy and Fairness Constraints. | Ehsan Kazemi, Morteza Zadimoghaddam, Amin Karbasi |
| 2018 | ICML | Proportional Allocation: Simple, Distributed, and Diverse Matching with High Entropy. | Shipra Agrawal, Morteza Zadimoghaddam, Vahab S. Mirrokni |
| 2018 | ICML | Data Summarization at Scale: A Two-Stage Submodular Approach. | Marko Mitrovic, Ehsan Kazemi, Morteza Zadimoghaddam, Amin Karbasi |
| 2018 | SODA | Consistent Hashing with Bounded Loads. | Vahab S. Mirrokni, Mikkel Thorup, Morteza Zadimoghaddam |
| 2017 | AAAI | Scalable Feature Selection via Distributed Diversity Maximization. | Sepehr Abbasi Zadeh, Mehrdad Ghadiri, Vahab S. Mirrokni, Morteza Zadimoghaddam |
| 2017 | ICML | Probabilistic Submodular Maximization in Sub-Linear Time. | Serban Stan, Morteza Zadimoghaddam, Andreas Krause, Amin Karbasi |
| 2017 | WWW | Submodular Optimization Over Sliding Windows. | Alessandro Epasto, Silvio Lattanzi, Sergei Vassilvitskii, Morteza Zadimoghaddam |
| 2017 | SIGMETRICS | Overcommitment in Cloud Services Bin packing with Chance Constraints. | Maxime C. Cohen, Philipp W. Keller, Vahab S. Mirrokni, Morteza Zadimoghaddam |
| 2017 | SPAA | Bicriteria Distributed Submodular Maximization in a Few Rounds. | Alessandro Epasto, Vahab S. Mirrokni, Morteza Zadimoghaddam |
| 2016 | ICML | Greedy Column Subset Selection: New Bounds and Distributed Algorithms. | Jason M. Altschuler, Aditya Bhaskara, Gang Fu, Vahab S. Mirrokni, Afshin Rostamizadeh, Morteza Zadimoghaddam |
| 2016 | ICML | Horizontally Scalable Submodular Maximization. | Mario Lucic, Olivier Bachem, Morteza Zadimoghaddam, Andreas Krause |
| 2015 | AISTATS | Sparse Solutions to Nonnegative Linear Systems and Applications. | Aditya Bhaskara, Ananda Theertha Suresh, Morteza Zadimoghaddam |
| 2015 | SODA | Online Stochastic Matching with Unequal Probabilities. | Aranyak Mehta, Bo Waggoner, Morteza Zadimoghaddam |
| 2015 | STOC | Online Submodular Welfare Maximization: Greedy Beats 1/2 in Random Order. | Nitish Korula, Vahab S. Mirrokni, Morteza Zadimoghaddam |
| 2015 | STOC | Randomized Composable Core-sets for Distributed Submodular Maximization. | Vahab S. Mirrokni, Morteza Zadimoghaddam |
| 2014 | WWW | How to influence people with partial incentives. | Erik D. Demaine, MohammadTaghi Hajiaghayi, Hamid Mahini, David L. Malec, S. Raghavan, Anshul Sawant, Morteza Zadimoghaddam |
| 2013 | AAAI | Optimal Coalition Structure Generation in Cooperative Graph Games. | Yoram Bachrach, Pushmeet Kohli, Vladimir Kolmogorov, Morteza Zadimoghaddam |
| 2013 | SODA | Learning Disjunctions: Near-Optimal Trade-off between Mistakes and "I Don't Know's". | Erik D. Demaine, Morteza Zadimoghaddam |
| 2013 | STACS | Constrained Binary Identification Problem. | Amin Karbasi, Morteza Zadimoghaddam |
| 2012 | ITW | Sequential group testing with graph constraints. | Amin Karbasi, Morteza Zadimoghaddam |
| 2012 | SODA | Simultaneous approximations for adversarial and stochastic online budgeted allocation. | Vahab S. Mirrokni, Shayan Oveis Gharan, Morteza Zadimoghaddam |
| 2011 | ISIT | Compression with graphical constraints: An interactive browser. | Amin Karbasi, Morteza Zadimoghaddam |
| 2011 | PODC | Optimal-time adaptive strong renaming, with applications to counting. | Dan Alistarh, James Aspnes, Keren Censor-Hillel, Seth Gilbert, Morteza Zadimoghaddam |
| 2010 | ICALP | How Efficient Can Gossip Be? (On the Cost of Resilient Information Exchange). | Dan Alistarh, Seth Gilbert, Rachid Guerraoui, Morteza Zadimoghaddam |
| 2010 | SPAA | Scheduling to minimize power consumption using submodular functions. | Erik D. Demaine, Morteza Zadimoghaddam |
| 2010 | SPAA | Collaborative scoring with dishonest participants. | Seth Gilbert, Rachid Guerraoui, Faezeh Malakouti Rad, Morteza Zadimoghaddam |
| 2010 | WAW | Constant Price of Anarchy in Network Creation Games via Public Service Advertising. | Erik D. Demaine, Morteza Zadimoghaddam |
| 2009 | STACS | The Price of Anarchy in Cooperative Network Creation Games. | Erik D. Demaine, MohammadTaghi Hajiaghayi, Hamid Mahini, Morteza Zadimoghaddam |
| 2008 | CISS | Some notes on fix-free codes. | Ali Kakhbod, Ali Nazari, Morteza Zadimoghaddam |
| 2007 | PODC | The price of anarchy in network creation games. | Erik D. Demaine, MohammadTaghi Hajiaghayi, Hamid Mahini, Morteza Zadimoghaddam |
| 2007 | SODA | Minimizing movement. | Erik D. Demaine, Mohammad Taghi Hajiaghayi, Hamid Mahini, Amin S. Sayedi-Roshkhar, Shayan Oveis Gharan, Morteza Zadimoghaddam |
| 2007 | SPAA | Scheduling to minimize gaps and power consumption. | Erik D. Demaine, Mohammad Ghodsi, Mohammad Taghi Hajiaghayi, Amin S. Sayedi-Roshkhar, Morteza Zadimoghaddam |