Morteza Zadimoghaddam

ORCID

Publication Activity (10 Years)

Years Active: 2007-2024
Publications (10 Years): 49

Top Venues

Massachusetts Institute of Technology, Cambridge, MA, USA (PHD)

Education History

Massachusetts Institute of Technology, Cambridge, MA, USA

PHD

Publications

Paul Dütting, Federico Fusco, Silvio Lattanzi, Ashkan Norouzi-Fard, Morteza Zadimoghaddam
Consistent Submodular Maximization. CoRR (2024)
Matthew Fahrbach, Srikumar Ramalingam, Morteza Zadimoghaddam, Sara Ahmadian, Gui Citovsky, Giulia DeSalvo
GIST: Greedy Independent Set Thresholding for Diverse Data Summarization. CoRR (2024)
Paul Duetting, Federico Fusco, Silvio Lattanzi, Ashkan Norouzi-Fard, Morteza Zadimoghaddam
Fully Dynamic Submodular Maximization over Matroids. ICML (2023)
Paul Dütting, Federico Fusco, Silvio Lattanzi, Ashkan Norouzi-Fard, Morteza Zadimoghaddam
Fully Dynamic Submodular Maximization over Matroids. CoRR (2023)
Paul Dütting, Federico Fusco, Silvio Lattanzi, Ashkan Norouzi-Fard, Morteza Zadimoghaddam
Deletion Robust Non-Monotone Submodular Maximization over Matroids. CoRR (2022)
Matthew Fahrbach, Zhiyi Huang, Runzhou Tao, Morteza Zadimoghaddam
Edge-Weighted Online Bipartite Matching. J. ACM 69 (6) (2022)
Paul Dütting, Federico Fusco, Silvio Lattanzi, Ashkan Norouzi-Fard, Morteza Zadimoghaddam
Deletion Robust Submodular Maximization over Matroids. CoRR (2022)
Paul Duetting, Federico Fusco, Silvio Lattanzi, Ashkan Norouzi-Fard, Morteza Zadimoghaddam
Deletion Robust Submodular Maximization over Matroids. ICML (2022)
Sara Ahmadian, Allen Liu, Binghui Peng, Morteza Zadimoghaddam
Distributed Load Balancing: A New Framework and Improved Guarantees. ITCS (2021)
Aditya Bhaskara, Amin Karbasi, Silvio Lattanzi, Morteza Zadimoghaddam
Online MAP Inference of Determinantal Point Processes. NeurIPS (2020)
Silvio Lattanzi, Slobodan Mitrovic, Ashkan Norouzi-Fard, Jakub Tarnawski, Morteza Zadimoghaddam
Fully Dynamic Algorithm for Constrained Submodular Optimization. CoRR (2020)
Silvio Lattanzi, Slobodan Mitrovic, Ashkan Norouzi-Fard, Jakub Tarnawski, Morteza Zadimoghaddam
Fully Dynamic Algorithm for Constrained Submodular Optimization. NeurIPS (2020)
Matthew Fahrbach, Zhiyi Huang, Runzhou Tao, Morteza Zadimoghaddam
Edge-Weighted Online Bipartite Matching. CoRR (2020)
Michele Borassi, Alessandro Epasto, Silvio Lattanzi, Sergei Vassilvitskii, Morteza Zadimoghaddam
Sliding Window Algorithms for k-Clustering Problems. CoRR (2020)
Matthew Fahrbach, Zhiyi Huang, Runzhou Tao, Morteza Zadimoghaddam
Edge-Weighted Online Bipartite Matching. FOCS (2020)
Michele Borassi, Alessandro Epasto, Silvio Lattanzi, Sergei Vassilvitskii, Morteza Zadimoghaddam
Sliding Window Algorithms for k-Clustering Problems. NeurIPS (2020)
Aditya Bhaskara, Silvio Lattanzi, Sergei Vassilvitskii, Morteza Zadimoghaddam
Residual Based Sampling for Online Low Rank Approximation. ITA (2020)
Ehsan Kazemi, Marko Mitrovic, Morteza Zadimoghaddam, Silvio Lattanzi, Amin Karbasi
Submodular Streaming in All its Glory: Tight Approximation, Minimum Memory and Low Adaptive Complexity. CoRR (2019)
Alessandro Epasto, Vahab S. Mirrokni, Morteza Zadimoghaddam
Scalable Diversity Maximization via Small-size Composable Core-sets (Brief Announcement). SPAA (2019)
Maxime C. Cohen, Philipp W. Keller, Vahab S. Mirrokni, Morteza Zadimoghaddam
Overcommitment in Cloud Services: Bin Packing with Chance Constraints. Manag. Sci. 65 (7) (2019)
Aditya Bhaskara, Silvio Lattanzi, Sergei Vassilvitskii, Morteza Zadimoghaddam
Residual Based Sampling for Online Low Rank Approximation. FOCS (2019)
Michele Borassi, Alessandro Epasto, Silvio Lattanzi, Sergei Vassilvitskii, Morteza Zadimoghaddam
Better Sliding Window Algorithms to Maximize Subadditive and Diversity Objectives. PODS (2019)
Matthew Fahrbach, Vahab S. Mirrokni, Morteza Zadimoghaddam
Non-monotone Submodular Maximization with Nearly Optimal Adaptivity and Query Complexity. ICML (2019)
Matthew Fahrbach, Vahab S. Mirrokni, Morteza Zadimoghaddam
Submodular Maximization with Nearly Optimal Approximation, Adaptivity and Query Complexity. SODA (2019)
Ehsan Kazemi, Marko Mitrovic, Morteza Zadimoghaddam, Silvio Lattanzi, Amin Karbasi
Submodular Streaming in All Its Glory: Tight Approximation, Minimum Memory and Low Adaptive Complexity. ICML (2019)
Marko Mitrovic, Ehsan Kazemi, Morteza Zadimoghaddam, Amin Karbasi
Data Summarization at Scale: A Two-Stage Submodular Approach. CoRR (2018)
Ehsan Kazemi, Morteza Zadimoghaddam, Amin Karbasi
Scalable Deletion-Robust Submodular Maximization: Data Summarization with Privacy and Fairness Constraints. ICML (2018)
Nitish Korula, Vahab S. Mirrokni, Morteza Zadimoghaddam
Online Submodular Welfare Maximization: Greedy Beats 1/2 in Random Order. SIAM J. Comput. 47 (3) (2018)
Matthew Fahrbach, Vahab S. Mirrokni, Morteza Zadimoghaddam
Submodular Maximization with Optimal Approximation, Adaptivity and Query Complexity. CoRR (2018)
Marko Mitrovic, Ehsan Kazemi, Morteza Zadimoghaddam, Amin Karbasi
Data Summarization at Scale: A Two-Stage Submodular Approach. ICML (2018)
Vahab S. Mirrokni, Mikkel Thorup, Morteza Zadimoghaddam
Consistent Hashing with Bounded Loads. SODA (2018)
Matthew Fahrbach, Vahab S. Mirrokni, Morteza Zadimoghaddam
Non-monotone Submodular Maximization with Nearly Optimal Adaptivity Complexity. CoRR (2018)
Shipra Agrawal, Morteza Zadimoghaddam, Vahab S. Mirrokni
Proportional Allocation: Simple, Distributed, and Diverse Matching with High Entropy. ICML (2018)
Maxime C. Cohen, Philipp W. Keller, Vahab S. Mirrokni, Morteza Zadimoghaddam
Overcommitment in Cloud Services - Bin packing with Chance Constraints. CoRR (2017)
Serban Stan, Morteza Zadimoghaddam, Andreas Krause, Amin Karbasi
Probabilistic Submodular Maximization in Sub-Linear Time. ICML (2017)
Sepehr Abbasi Zadeh, Mehrdad Ghadiri, Vahab S. Mirrokni, Morteza Zadimoghaddam
Scalable Feature Selection via Distributed Diversity Maximization. AAAI (2017)
Alessandro Epasto, Silvio Lattanzi, Sergei Vassilvitskii, Morteza Zadimoghaddam
Submodular Optimization Over Sliding Windows. WWW (2017)
Alessandro Epasto, Vahab S. Mirrokni, Morteza Zadimoghaddam
Bicriteria Distributed Submodular Maximization in a Few Rounds. SPAA (2017)
Ehsan Kazemi, Morteza Zadimoghaddam, Amin Karbasi
Deletion-Robust Submodular Maximization at Scale. CoRR (2017)
Maxime C. Cohen, Philipp W. Keller, Vahab S. Mirrokni, Morteza Zadimoghaddam
Overcommitment in Cloud Services Bin packing with Chance Constraints. SIGMETRICS (Abstracts) (2017)
Morteza Zadimoghaddam
Online Weighted Matching: Beating the 1/2 Barrier. CoRR (2017)
Nitish Korula, Vahab S. Mirrokni, Morteza Zadimoghaddam
Online Submodular Welfare Maximization: Greedy Beats 1/2 in Random Order. CoRR (2017)
Vahab S. Mirrokni, Mikkel Thorup, Morteza Zadimoghaddam
Consistent Hashing with Bounded Loads. CoRR (2016)
Jason Altschuler, Aditya Bhaskara, Gang Fu, Vahab S. Mirrokni, Afshin Rostamizadeh, Morteza Zadimoghaddam
Greedy Column Subset Selection: New Bounds and Distributed Algorithms. CoRR (2016)
Mario Lucic, Olivier Bachem, Morteza Zadimoghaddam, Andreas Krause
Horizontally Scalable Submodular Maximization. CoRR (2016)
Baharan Mirzasoleiman, Morteza Zadimoghaddam, Amin Karbasi
Fast Distributed Submodular Cover: Public-Private Data Summarization. NIPS (2016)
Alessandro Epasto, Silvio Lattanzi, Sergei Vassilvitskii, Morteza Zadimoghaddam
Submodular Optimization over Sliding Windows. CoRR (2016)
Jason Altschuler, Aditya Bhaskara, Gang Fu, Vahab S. Mirrokni, Afshin Rostamizadeh, Morteza Zadimoghaddam
Greedy Column Subset Selection: New Bounds and Distributed Algorithms. ICML (2016)
Mario Lucic, Olivier Bachem, Morteza Zadimoghaddam, Andreas Krause
Horizontally Scalable Submodular Maximization. ICML (2016)
Aranyak Mehta, Bo Waggoner, Morteza Zadimoghaddam
Online Stochastic Matching with Unequal Probabilities. SODA (2015)
Vahab S. Mirrokni, Morteza Zadimoghaddam
Randomized Composable Core-sets for Distributed Submodular Maximization. CoRR (2015)
Aditya Bhaskara, Ananda Theertha Suresh, Morteza Zadimoghaddam
Sparse Solutions to Nonnegative Linear Systems and Applications. CoRR (2015)
Vahab S. Mirrokni, Morteza Zadimoghaddam
Randomized Composable Core-sets for Distributed Submodular Maximization. STOC (2015)
MohammadHossein Bateni, Nima Haghpanah, Balasubramanian Sivan, Morteza Zadimoghaddam
Revenue Maximization with Nonexcludable Goods. ACM Trans. Economics and Comput. 3 (4) (2015)
Aditya Bhaskara, Ananda Theertha Suresh, Morteza Zadimoghaddam
Sparse Solutions to Nonnegative Linear Systems and Applications. AISTATS (2015)
Nitish Korula, Vahab S. Mirrokni, Morteza Zadimoghaddam
Online Submodular Welfare Maximization: Greedy Beats 1/2 in Random Order. STOC (2015)
Erik D. Demaine, MohammadTaghi Hajiaghayi, Hamid Mahini, David L. Malec, S. Raghavan, Anshul Sawant, Morteza Zadimoghaddam
How to Influence People with Partial Incentives. CoRR (2014)
Erik D. Demaine, MohammadTaghi Hajiaghayi, Hamid Mahini, David L. Malec, S. Raghavan, Anshul Sawant, Morteza Zadimoghaddam
How to influence people with partial incentives. WWW (2014)
Yoram Bachrach, Omer Lev, Shachar Lovett, Jeffrey S. Rosenschein, Morteza Zadimoghaddam
Cooperative weakest link games. AAMAS (2014)
MohammadHossein Bateni, Mohammad Taghi Hajiaghayi, Morteza Zadimoghaddam
Submodular secretary problem and extensions. ACM Trans. Algorithms 9 (4) (2013)
Nitish Korula, Vahab S. Mirrokni, Morteza Zadimoghaddam
Bicriteria Online Matching: Maximizing Weight and Cardinality. WINE (2013)
Erik D. Demaine, Mohammad Ghodsi, MohammadTaghi Hajiaghayi, Amin S. Sayedi-Roshkhar, Morteza Zadimoghaddam
Scheduling to minimize gaps and power consumption. J. Sched. 16 (2) (2013)
MohammadHossein Bateni, Nima Haghpanah, Balasubramanian Sivan, Morteza Zadimoghaddam
Revenue Maximization with Nonexcludable Goods. WINE (2013)
Erik D. Demaine, Morteza Zadimoghaddam
Learning Disjunctions: Near-Optimal Trade-off between Mistakes and "I Don't Know's". SODA (2013)
Yoram Bachrach, Pushmeet Kohli, Vladimir Kolmogorov, Morteza Zadimoghaddam
Optimal Coalition Structure Generation in Cooperative Graph Games. AAAI (2013)
Amin Karbasi, Morteza Zadimoghaddam
Constrained Binary Identification Problem. STACS (2013)
Morteza Zadimoghaddam, Aaron Roth
Efficiently Learning from Revealed Preference CoRR (2012)
Vahab S. Mirrokni, Shayan Oveis Gharan, Morteza Zadimoghaddam
Simultaneous approximations for adversarial and stochastic online budgeted allocation. SODA (2012)
Morteza Zadimoghaddam, Aaron Roth
Efficiently Learning from Revealed Preference. WINE (2012)
Erik D. Demaine, Morteza Zadimoghaddam
Constant Price of Anarchy in Network-Creation Games via Public-Service Advertising. Internet Math. 8 (1-2) (2012)
Amin Karbasi, Morteza Zadimoghaddam
Sequential group testing with graph constraints. ITW (2012)
Erik D. Demaine, Mohammad Taghi Hajiaghayi, Hamid Mahini, Morteza Zadimoghaddam
The price of anarchy in network creation games. ACM Trans. Algorithms 8 (2) (2012)
Mohammad Ghodsi, Hamid Mahini, Vahab S. Mirrokni, Morteza Zadimoghaddam
Permutation Betting Markets: Singleton Betting with Extra Information. Algorithmica 60 (4) (2011)
Amin Karbasi, Morteza Zadimoghaddam
Compression with graphical constraints: An interactive browser. ISIT (2011)
Piotr Berman, Erik D. Demaine, Morteza Zadimoghaddam
O(1)-Approximations for Maximum Movement Problems. APPROX-RANDOM (2011)
Yoram Bachrach, Pushmeet Kohli, Vladimir Kolmogorov, Morteza Zadimoghaddam
Optimal Coalition Structures in Graph Games CoRR (2011)
Bernhard Haeupler, Vahab S. Mirrokni, Morteza Zadimoghaddam
Online Stochastic Weighted Matching: Improved Approximation Algorithms. WINE (2011)
Ali Kakhbod, Morteza Zadimoghaddam
On the construction of prefix-free and fix-free codes with specified codeword compositions. Discret. Appl. Math. 159 (18) (2011)
Dan Alistarh, James Aspnes, Keren Censor-Hillel, Seth Gilbert, Morteza Zadimoghaddam
Optimal-time adaptive strong renaming, with applications to counting. PODC (2011)
Yoram Bachrach, Morteza Zadimoghaddam, Peter B. Key
A cooperative approach to collusion in auctions. SIGecom Exch. 10 (1) (2011)
Dan Alistarh, Seth Gilbert, Rachid Guerraoui, Morteza Zadimoghaddam
How Efficient Can Gossip Be? (On the Cost of Resilient Information Exchange). ICALP (2) (2010)
Erik D. Demaine, Morteza Zadimoghaddam
Minimizing the Diameter of a Network Using Shortcut Edges. SWAT (2010)
Yoram Bachrach, Peter B. Key, Morteza Zadimoghaddam
Collusion in VCG Path Procurement Auctions. WINE (2010)
Seth Gilbert, Rachid Guerraoui, Faezeh Malakouti Rad, Morteza Zadimoghaddam
Collaborative scoring with dishonest participants. SPAA (2010)
Amin Sayedi, Morteza Zadimoghaddam, Avrim Blum
Trading off Mistakes and Don't-Know Predictions. NIPS (2010)
MohammadHossein Bateni, MohammadTaghi Hajiaghayi, Morteza Zadimoghaddam
Submodular Secretary Problem and Extensions. APPROX-RANDOM (2010)
Ali Kakhbod, Morteza Zadimoghaddam
On the Carter-Gill Conjecture CoRR (2010)
Erik D. Demaine, Morteza Zadimoghaddam
Constant Price of Anarchy in Network Creation Games via Public Service Advertising. WAW (2010)
Erik D. Demaine, Morteza Zadimoghaddam
Scheduling to minimize power consumption using submodular functions. SPAA (2010)
Erik D. Demaine, Mohammad Taghi Hajiaghayi, Hamid Mahini, Morteza Zadimoghaddam
The Price of Anarchy in Cooperative Network Creation Games CoRR (2009)
Erik D. Demaine, Mohammad Taghi Hajiaghayi, Hamid Mahini, Amin S. Sayedi-Roshkhar, Shayan Oveis Gharan, Morteza Zadimoghaddam
Minimizing movement. ACM Trans. Algorithms 5 (3) (2009)
Erik D. Demaine, Mohammad Taghi Hajiaghayi, Hamid Mahini, Morteza Zadimoghaddam
The price of anarchy in cooperative network creation games. SIGecom Exch. 8 (2) (2009)
Erik D. Demaine, MohammadTaghi Hajiaghayi, Hamid Mahini, Morteza Zadimoghaddam
The Price of Anarchy in Cooperative Network Creation Games. STACS (2009)
Mohammad Ghodsi, Hamid Mahini, Vahab S. Mirrokni, Morteza Zadimoghaddam
Permutation betting markets: singleton betting with extra information. EC (2008)
Mihai Badoiu, Erik D. Demaine, MohammadTaghi Hajiaghayi, Anastasios Sidiropoulos, Morteza Zadimoghaddam
Ordinal Embedding: Approximation Algorithms and Dimensionality Reduction. APPROX-RANDOM (2008)
Ali Kakhbod, Ali Nazari, Morteza Zadimoghaddam
Some notes on fix-free codes. CISS (2008)
Erik D. Demaine, Mohammad Taghi Hajiaghayi, Hamid Mahini, Amin S. Sayedi-Roshkhar, Shayan Oveis Gharan, Morteza Zadimoghaddam
Minimizing movement. SODA (2007)
Erik D. Demaine, Mohammad Ghodsi, Mohammad Taghi Hajiaghayi, Amin S. Sayedi-Roshkhar, Morteza Zadimoghaddam
Scheduling to minimize gaps and power consumption. SPAA (2007)
Mohammad Ghodsi, Hamid Mahini, Kian Mirjalali, Shayan Oveis Gharan, Amin S. Sayedi-Roshkhar, Morteza Zadimoghaddam
Spanning trees with minimum weighted degrees. Inf. Process. Lett. 104 (3) (2007)
Erik D. Demaine, MohammadTaghi Hajiaghayi, Hamid Mahini, Morteza Zadimoghaddam
The price of anarchy in network creation games. PODC (2007)

Morteza Zadimoghaddam.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Morteza Zadimoghaddam