Morteza Zadimoghaddam

112 papers A* 34A 5B 7C 1Misc 2Journal 48Unranked 13
YearRankTypeTitle / Venue / Authors
2026 J jnl
Accelerating Scientific Research with Gemini: Case Studies and Common Techniques.
CoRR
David P. Woodruff, Vincent Cohen-Addad, Lalit Jain, Jieming Mao, Song Zuo, MohammadHossein Bateni, Simina Brânzei, Michael P. Brenner, Lin Chen, Ying Feng, Lance Fortnow, Gang Fu, Ziyi Guan, Zahra Hadizadeh, Mohammad T. Hajiaghayi, Mahdi JafariRaviz, Adel Javanmard, Karthik C. S., Ken-ichi Kawarabayashi, Ravi Kumar, Silvio Lattanzi, Euiwoong Lee, Yi Li, Ioannis Panageas, Dimitris Paparas, Benjamin Przybocki, Bernardo Subercaseaux, Ola Svensson, Shayan Taherijam, Xuan Wu, Eylon Yogev, Morteza Zadimoghaddam, Samson Zhou, Yossi Matias, James Manyika, Vahab Mirrokni
2025 J jnl
Deletion Robust Non-Monotone Submodular Maximization over Matroids.
J. Mach. Learn. Res.
Paul Dütting, Federico Fusco, Silvio Lattanzi, Ashkan Norouzi-Fard, Morteza Zadimoghaddam
2025 J jnl
Fully Dynamic Submodular Maximization over Matroids.
ACM Trans. Algorithms
Paul Dütting, Federico Fusco, Silvio Lattanzi, Ashkan Norouzi-Fard, Morteza Zadimoghaddam
2025 J jnl
How to DP-fy Your Data: A Practical Guide to Generating Synthetic Data With Differential Privacy.
CoRR
Natalia Ponomareva, Zheng Xu, H. Brendan McMahan, Peter Kairouz, Lucas Rosenblatt, Vincent Cohen-Addad, Cristóbal Guzmán, Ryan McKenna, Galen Andrew, Alex Bie, Da Yu, Alex Kurakin, Morteza Zadimoghaddam, Sergei Vassilvitskii, Andreas Terzis
2025 A* conf
Scalable Private Partition Selection via Adaptive Weighting.
ICML
Justin Y. Chen, Vincent Cohen-Addad, Alessandro Epasto, Morteza Zadimoghaddam
2025 J jnl
Scalable Private Partition Selection via Adaptive Weighting.
CoRR
Justin Y. Chen, Vincent Cohen-Addad, Alessandro Epasto, Morteza Zadimoghaddam
2025 J jnl
Scalable contribution bounding to achieve privacy.
CoRR
Vincent Cohen-Addad, Alessandro Epasto, Jason Lee, Morteza Zadimoghaddam
2025 A* conf
The Cost of Consistency: Submodular Maximization with Constant Recourse.
STOC
Paul Dütting, Federico Fusco, Silvio Lattanzi, Ashkan Norouzi-Fard, Ola Svensson, Morteza Zadimoghaddam
2024 A* conf
Consistent Submodular Maximization.
ICML
Paul Duetting, Federico Fusco, Silvio Lattanzi, Ashkan Norouzi-Fard, Morteza Zadimoghaddam
2024 J jnl
Consistent Submodular Maximization.
CoRR
Paul Dütting, Federico Fusco, Silvio Lattanzi, Ashkan Norouzi-Fard, Morteza Zadimoghaddam
2024 J jnl
GIST: Greedy Independent Set Thresholding for Diverse Data Summarization.
CoRR
Matthew Fahrbach, Srikumar Ramalingam, Morteza Zadimoghaddam, Sara Ahmadian, Gui Citovsky, Giulia DeSalvo
2024 J jnl
The Cost of Consistency: Submodular Maximization with Constant Recourse.
CoRR
Paul Dütting, Federico Fusco, Silvio Lattanzi, Ashkan Norouzi-Fard, Ola Svensson, Morteza Zadimoghaddam
2023 A* conf
Fully Dynamic Submodular Maximization over Matroids.
ICML
Paul Duetting, Federico Fusco, Silvio Lattanzi, Ashkan Norouzi-Fard, Morteza Zadimoghaddam
2023 J jnl
Fully Dynamic Submodular Maximization over Matroids.
CoRR
Paul Dütting, Federico Fusco, Silvio Lattanzi, Ashkan Norouzi-Fard, Morteza Zadimoghaddam
2022 J jnl
Deletion Robust Non-Monotone Submodular Maximization over Matroids.
CoRR
Paul Dütting, Federico Fusco, Silvio Lattanzi, Ashkan Norouzi-Fard, Morteza Zadimoghaddam
2022 A* conf
Deletion Robust Submodular Maximization over Matroids.
ICML
Paul Duetting, Federico Fusco, Silvio Lattanzi, Ashkan Norouzi-Fard, Morteza Zadimoghaddam
2022 J jnl
Deletion Robust Submodular Maximization over Matroids.
CoRR
Paul Dütting, Federico Fusco, Silvio Lattanzi, Ashkan Norouzi-Fard, Morteza Zadimoghaddam
2022 J jnl
Edge-Weighted Online Bipartite Matching.
J. ACM
Matthew Fahrbach, Zhiyi Huang, Runzhou Tao, Morteza Zadimoghaddam
2021 A conf
Distributed Load Balancing: A New Framework and Improved Guarantees.
ITCS
Sara Ahmadian, Allen Liu, Binghui Peng, Morteza Zadimoghaddam
2020 A* conf
Edge-Weighted Online Bipartite Matching.
FOCS
Matthew Fahrbach, Zhiyi Huang, Runzhou Tao, Morteza Zadimoghaddam
2020 J jnl
Edge-Weighted Online Bipartite Matching.
CoRR
Matthew Fahrbach, Zhiyi Huang, Runzhou Tao, Morteza Zadimoghaddam
2020 A* conf
Fully Dynamic Algorithm for Constrained Submodular Optimization.
NeurIPS
Silvio Lattanzi, Slobodan Mitrovic, Ashkan Norouzi-Fard, Jakub Tarnawski, Morteza Zadimoghaddam
2020 J jnl
Fully Dynamic Algorithm for Constrained Submodular Optimization.
CoRR
Silvio Lattanzi, Slobodan Mitrovic, Ashkan Norouzi-Fard, Jakub Tarnawski, Morteza Zadimoghaddam
2020 A* conf
Online MAP Inference of Determinantal Point Processes.
NeurIPS
Aditya Bhaskara, Amin Karbasi, Silvio Lattanzi, Morteza Zadimoghaddam
2020 Misc conf
Residual Based Sampling for Online Low Rank Approximation.
ITA
Aditya Bhaskara, Silvio Lattanzi, Sergei Vassilvitskii, Morteza Zadimoghaddam
2020 A* conf
Sliding Window Algorithms for k-Clustering Problems.
NeurIPS
Michele Borassi, Alessandro Epasto, Silvio Lattanzi, Sergei Vassilvitskii, Morteza Zadimoghaddam
2020 J jnl
Sliding Window Algorithms for k-Clustering Problems.
CoRR
Michele Borassi, Alessandro Epasto, Silvio Lattanzi, Sergei Vassilvitskii, Morteza Zadimoghaddam
2019 A* conf
Better Sliding Window Algorithms to Maximize Subadditive and Diversity Objectives.
PODS
Michele Borassi, Alessandro Epasto, Silvio Lattanzi, Sergei Vassilvitskii, Morteza Zadimoghaddam
2019 A* conf
Non-monotone Submodular Maximization with Nearly Optimal Adaptivity and Query Complexity.
ICML
Matthew Fahrbach, Vahab S. Mirrokni, Morteza Zadimoghaddam
2019 J jnl
Overcommitment in Cloud Services: Bin Packing with Chance Constraints.
Manag. Sci.
Maxime C. Cohen, Philipp W. Keller, Vahab S. Mirrokni, Morteza Zadimoghaddam
2019 A* conf
Residual Based Sampling for Online Low Rank Approximation.
FOCS
Aditya Bhaskara, Silvio Lattanzi, Sergei Vassilvitskii, Morteza Zadimoghaddam
2019 B conf
Scalable Diversity Maximization via Small-size Composable Core-sets (Brief Announcement).
SPAA
Alessandro Epasto, Vahab S. Mirrokni, Morteza Zadimoghaddam
2019 A* conf
Submodular Maximization with Nearly Optimal Approximation, Adaptivity and Query Complexity.
SODA
Matthew Fahrbach, Vahab S. Mirrokni, Morteza Zadimoghaddam
2019 A* conf
Submodular Streaming in All Its Glory: Tight Approximation, Minimum Memory and Low Adaptive Complexity.
ICML
Ehsan Kazemi, Marko Mitrovic, Morteza Zadimoghaddam, Silvio Lattanzi, Amin Karbasi
2019 J jnl
Submodular Streaming in All its Glory: Tight Approximation, Minimum Memory and Low Adaptive Complexity.
CoRR
Ehsan Kazemi, Marko Mitrovic, Morteza Zadimoghaddam, Silvio Lattanzi, Amin Karbasi
2018 A* conf
Consistent Hashing with Bounded Loads.
SODA
Vahab S. Mirrokni, Mikkel Thorup, Morteza Zadimoghaddam
2018 A* conf
Data Summarization at Scale: A Two-Stage Submodular Approach.
ICML
Marko Mitrovic, Ehsan Kazemi, Morteza Zadimoghaddam, Amin Karbasi
2018 J jnl
Data Summarization at Scale: A Two-Stage Submodular Approach.
CoRR
Marko Mitrovic, Ehsan Kazemi, Morteza Zadimoghaddam, Amin Karbasi
2018 J jnl
Non-monotone Submodular Maximization with Nearly Optimal Adaptivity Complexity.
CoRR
Matthew Fahrbach, Vahab S. Mirrokni, Morteza Zadimoghaddam
2018 J jnl
Online Submodular Welfare Maximization: Greedy Beats 1/2 in Random Order.
SIAM J. Comput.
Nitish Korula, Vahab S. Mirrokni, Morteza Zadimoghaddam
2018 A* conf
Proportional Allocation: Simple, Distributed, and Diverse Matching with High Entropy.
ICML
Shipra Agrawal, Morteza Zadimoghaddam, Vahab S. Mirrokni
2018 A* conf
Scalable Deletion-Robust Submodular Maximization: Data Summarization with Privacy and Fairness Constraints.
ICML
Ehsan Kazemi, Morteza Zadimoghaddam, Amin Karbasi
2018 J jnl
Submodular Maximization with Optimal Approximation, Adaptivity and Query Complexity.
CoRR
Matthew Fahrbach, Vahab S. Mirrokni, Morteza Zadimoghaddam
2017 B conf
Bicriteria Distributed Submodular Maximization in a Few Rounds.
SPAA
Alessandro Epasto, Vahab S. Mirrokni, Morteza Zadimoghaddam
2017 J jnl
Deletion-Robust Submodular Maximization at Scale.
CoRR
Ehsan Kazemi, Morteza Zadimoghaddam, Amin Karbasi
2017 J jnl
Online Submodular Welfare Maximization: Greedy Beats 1/2 in Random Order.
CoRR
Nitish Korula, Vahab S. Mirrokni, Morteza Zadimoghaddam
2017 J jnl
Online Weighted Matching: Beating the 1/2 Barrier.
CoRR
Morteza Zadimoghaddam
2017 J jnl
Overcommitment in Cloud Services - Bin packing with Chance Constraints.
CoRR
Maxime C. Cohen, Philipp W. Keller, Vahab S. Mirrokni, Morteza Zadimoghaddam
2017 — conf
Overcommitment in Cloud Services Bin packing with Chance Constraints.
SIGMETRICS (Abstracts)
Maxime C. Cohen, Philipp W. Keller, Vahab S. Mirrokni, Morteza Zadimoghaddam
2017 A* conf
Probabilistic Submodular Maximization in Sub-Linear Time.
ICML
Serban Stan, Morteza Zadimoghaddam, Andreas Krause, Amin Karbasi
2017 A* conf
Scalable Feature Selection via Distributed Diversity Maximization.
AAAI
Sepehr Abbasi Zadeh, Mehrdad Ghadiri, Vahab S. Mirrokni, Morteza Zadimoghaddam
2017 A* conf
Submodular Optimization Over Sliding Windows.
WWW
Alessandro Epasto, Silvio Lattanzi, Sergei Vassilvitskii, Morteza Zadimoghaddam
2016 J jnl
Consistent Hashing with Bounded Loads.
CoRR
Vahab S. Mirrokni, Mikkel Thorup, Morteza Zadimoghaddam
2016 — conf
Fast Distributed Submodular Cover: Public-Private Data Summarization.
NIPS
Baharan Mirzasoleiman, Morteza Zadimoghaddam, Amin Karbasi
2016 A* conf
Greedy Column Subset Selection: New Bounds and Distributed Algorithms.
ICML
Jason M. Altschuler, Aditya Bhaskara, Gang Fu, Vahab S. Mirrokni, Afshin Rostamizadeh, Morteza Zadimoghaddam
2016 J jnl
Greedy Column Subset Selection: New Bounds and Distributed Algorithms.
CoRR
Jason M. Altschuler, Aditya Bhaskara, Gang Fu, Vahab S. Mirrokni, Afshin Rostamizadeh, Morteza Zadimoghaddam
2016 A* conf
Horizontally Scalable Submodular Maximization.
ICML
Mario Lucic, Olivier Bachem, Morteza Zadimoghaddam, Andreas Krause
2016 J jnl
Horizontally Scalable Submodular Maximization.
CoRR
Mario Lucic, Olivier Bachem, Morteza Zadimoghaddam, Andreas Krause
2016 — ch.
Network Creation Games.
Encyclopedia of Algorithms
Erik D. Demaine, Mohammad Taghi Hajiaghayi, Hamid Mahini, Morteza Zadimoghaddam
2016 J jnl
Submodular Optimization over Sliding Windows.
CoRR
Alessandro Epasto, Silvio Lattanzi, Sergei Vassilvitskii, Morteza Zadimoghaddam
2015 A* conf
Online Stochastic Matching with Unequal Probabilities.
SODA
Aranyak Mehta, Bo Waggoner, Morteza Zadimoghaddam
2015 A* conf
Online Submodular Welfare Maximization: Greedy Beats 1/2 in Random Order.
STOC
Nitish Korula, Vahab S. Mirrokni, Morteza Zadimoghaddam
2015 A* conf
Randomized Composable Core-sets for Distributed Submodular Maximization.
STOC
Vahab S. Mirrokni, Morteza Zadimoghaddam
2015 J jnl
Randomized Composable Core-sets for Distributed Submodular Maximization.
CoRR
Vahab S. Mirrokni, Morteza Zadimoghaddam
2015 J jnl
Revenue Maximization with Nonexcludable Goods.
ACM Trans. Economics and Comput.
MohammadHossein Bateni, Nima Haghpanah, Balasubramanian Sivan, Morteza Zadimoghaddam
2015 A conf
Sparse Solutions to Nonnegative Linear Systems and Applications.
AISTATS
Aditya Bhaskara, Ananda Theertha Suresh, Morteza Zadimoghaddam
2015 J jnl
Sparse Solutions to Nonnegative Linear Systems and Applications.
CoRR
Aditya Bhaskara, Ananda Theertha Suresh, Morteza Zadimoghaddam
2014 A conf
Cooperative weakest link games.
AAMAS
Yoram Bachrach, Omer Lev, Shachar Lovett, Jeffrey S. Rosenschein, Morteza Zadimoghaddam
2014 J jnl
How to Influence People with Partial Incentives.
CoRR
Erik D. Demaine, MohammadTaghi Hajiaghayi, Hamid Mahini, David L. Malec, S. Raghavan, Anshul Sawant, Morteza Zadimoghaddam
2014 A* conf
How to influence people with partial incentives.
WWW
Erik D. Demaine, MohammadTaghi Hajiaghayi, Hamid Mahini, David L. Malec, S. Raghavan, Anshul Sawant, Morteza Zadimoghaddam
2014 — —
Online allocation algorithms with applications in computational advertising.
Morteza Zadimoghaddam
2013 — conf
Bicriteria Online Matching: Maximizing Weight and Cardinality.
WINE
Nitish Korula, Vahab S. Mirrokni, Morteza Zadimoghaddam
2013 A conf
Constrained Binary Identification Problem.
STACS
Amin Karbasi, Morteza Zadimoghaddam
2013 A* conf
Learning Disjunctions: Near-Optimal Trade-off between Mistakes and "I Don't Know's".
SODA
Erik D. Demaine, Morteza Zadimoghaddam
2013 A* conf
Optimal Coalition Structure Generation in Cooperative Graph Games.
AAAI
Yoram Bachrach, Pushmeet Kohli, Vladimir Kolmogorov, Morteza Zadimoghaddam
2013 — conf
Revenue Maximization with Nonexcludable Goods.
WINE
MohammadHossein Bateni, Nima Haghpanah, Balasubramanian Sivan, Morteza Zadimoghaddam
2013 J jnl
Scheduling to minimize gaps and power consumption.
J. Sched.
Erik D. Demaine, Mohammad Ghodsi, MohammadTaghi Hajiaghayi, Amin S. Sayedi-Roshkhar, Morteza Zadimoghaddam
2013 J jnl
Submodular secretary problem and extensions.
ACM Trans. Algorithms
MohammadHossein Bateni, Mohammad Taghi Hajiaghayi, Morteza Zadimoghaddam
2012 J jnl
Constant Price of Anarchy in Network-Creation Games via Public-Service Advertising.
Internet Math.
Erik D. Demaine, Morteza Zadimoghaddam
2012 J jnl
Efficiently Learning from Revealed Preference
CoRR
Morteza Zadimoghaddam, Aaron Roth
2012 — conf
Efficiently Learning from Revealed Preference.
WINE
Morteza Zadimoghaddam, Aaron Roth
2012 B conf
Sequential group testing with graph constraints.
ITW
Amin Karbasi, Morteza Zadimoghaddam
2012 A* conf
Simultaneous approximations for adversarial and stochastic online budgeted allocation.
SODA
Vahab S. Mirrokni, Shayan Oveis Gharan, Morteza Zadimoghaddam
2012 J jnl
The price of anarchy in network creation games.
ACM Trans. Algorithms
Erik D. Demaine, Mohammad Taghi Hajiaghayi, Hamid Mahini, Morteza Zadimoghaddam
2011 J jnl
A cooperative approach to collusion in auctions.
SIGecom Exch.
Yoram Bachrach, Morteza Zadimoghaddam, Peter B. Key
2011 B conf
Compression with graphical constraints: An interactive browser.
ISIT
Amin Karbasi, Morteza Zadimoghaddam
2011 — conf
O(1)-Approximations for Maximum Movement Problems.
APPROX-RANDOM
Piotr Berman, Erik D. Demaine, Morteza Zadimoghaddam
2011 J jnl
On the construction of prefix-free and fix-free codes with specified codeword compositions.
Discret. Appl. Math.
Ali Kakhbod, Morteza Zadimoghaddam
2011 — conf
Online Stochastic Weighted Matching: Improved Approximation Algorithms.
WINE
Bernhard Haeupler, Vahab S. Mirrokni, Morteza Zadimoghaddam
2011 J jnl
Optimal Coalition Structures in Graph Games
CoRR
Yoram Bachrach, Pushmeet Kohli, Vladimir Kolmogorov, Morteza Zadimoghaddam
2011 A* conf
Optimal-time adaptive strong renaming, with applications to counting.
PODC
Dan Alistarh, James Aspnes, Keren Censor-Hillel, Seth Gilbert, Morteza Zadimoghaddam
2011 J jnl
Permutation Betting Markets: Singleton Betting with Extra Information.
Algorithmica
Mohammad Ghodsi, Hamid Mahini, Vahab S. Mirrokni, Morteza Zadimoghaddam
2010 B conf
Collaborative scoring with dishonest participants.
SPAA
Seth Gilbert, Rachid Guerraoui, Faezeh Malakouti Rad, Morteza Zadimoghaddam
2010 — conf
Collusion in VCG Path Procurement Auctions.
WINE
Yoram Bachrach, Peter B. Key, Morteza Zadimoghaddam
2010 C conf
Constant Price of Anarchy in Network Creation Games via Public Service Advertising.
WAW
Erik D. Demaine, Morteza Zadimoghaddam
2010 — conf
How Efficient Can Gossip Be? (On the Cost of Resilient Information Exchange).
ICALP (2)
Dan Alistarh, Seth Gilbert, Rachid Guerraoui, Morteza Zadimoghaddam
2010 — conf
Minimizing the Diameter of a Network Using Shortcut Edges.
SWAT
Erik D. Demaine, Morteza Zadimoghaddam
2010 J jnl
On the Carter-Gill Conjecture
CoRR
Ali Kakhbod, Morteza Zadimoghaddam
2010 B conf
Scheduling to minimize power consumption using submodular functions.
SPAA
Erik D. Demaine, Morteza Zadimoghaddam
2010 — conf
Submodular Secretary Problem and Extensions.
APPROX-RANDOM
MohammadHossein Bateni, MohammadTaghi Hajiaghayi, Morteza Zadimoghaddam
2010 — conf
Trading off Mistakes and Don't-Know Predictions.
NIPS
Amin Sayedi, Morteza Zadimoghaddam, Avrim Blum
2009 J jnl
Minimizing movement.
ACM Trans. Algorithms
Erik D. Demaine, Mohammad Taghi Hajiaghayi, Hamid Mahini, Amin S. Sayedi-Roshkhar, Shayan Oveis Gharan, Morteza Zadimoghaddam
2009 J jnl
The Price of Anarchy in Cooperative Network Creation Games
CoRR
Erik D. Demaine, Mohammad Taghi Hajiaghayi, Hamid Mahini, Morteza Zadimoghaddam
2009 A conf
The Price of Anarchy in Cooperative Network Creation Games.
STACS
Erik D. Demaine, MohammadTaghi Hajiaghayi, Hamid Mahini, Morteza Zadimoghaddam
2009 J jnl
The price of anarchy in cooperative network creation games.
SIGecom Exch.
Erik D. Demaine, Mohammad Taghi Hajiaghayi, Hamid Mahini, Morteza Zadimoghaddam
2008 — conf
Ordinal Embedding: Approximation Algorithms and Dimensionality Reduction.
APPROX-RANDOM
Mihai Badoiu, Erik D. Demaine, MohammadTaghi Hajiaghayi, Anastasios Sidiropoulos, Morteza Zadimoghaddam
2008 A* conf
Permutation betting markets: singleton betting with extra information.
EC
Mohammad Ghodsi, Hamid Mahini, Vahab S. Mirrokni, Morteza Zadimoghaddam
2008 Misc conf
Some notes on fix-free codes.
CISS
Ali Kakhbod, Ali Nazari, Morteza Zadimoghaddam
2007 A* conf
Minimizing movement.
SODA
Erik D. Demaine, Mohammad Taghi Hajiaghayi, Hamid Mahini, Amin S. Sayedi-Roshkhar, Shayan Oveis Gharan, Morteza Zadimoghaddam
2007 B conf
Scheduling to minimize gaps and power consumption.
SPAA
Erik D. Demaine, Mohammad Ghodsi, Mohammad Taghi Hajiaghayi, Amin S. Sayedi-Roshkhar, Morteza Zadimoghaddam
2007 J jnl
Spanning trees with minimum weighted degrees.
Inf. Process. Lett.
Mohammad Ghodsi, Hamid Mahini, Kian Mirjalali, Shayan Oveis Gharan, Amin S. Sayedi-Roshkhar, Morteza Zadimoghaddam
2007 A* conf
The price of anarchy in network creation games.
PODC
Erik D. Demaine, MohammadTaghi Hajiaghayi, Hamid Mahini, Morteza Zadimoghaddam