Morteza Zadimoghaddam

According to our database1, Morteza Zadimoghaddam authored at least 51 papers between 2007 and 2019.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2019
Submodular Maximization with Nearly Optimal Approximation, Adaptivity and Query Complexity.
Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms, 2019

2018
Consistent Hashing with Bounded Loads.
Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, 2018

Data Summarization at Scale: A Two-Stage Submodular Approach.
Proceedings of the 35th International Conference on Machine Learning, 2018

Proportional Allocation: Simple, Distributed, and Diverse Matching with High Entropy.
Proceedings of the 35th International Conference on Machine Learning, 2018

Scalable Deletion-Robust Submodular Maximization: Data Summarization with Privacy and Fairness Constraints.
Proceedings of the 35th International Conference on Machine Learning, 2018

2017
Submodular Optimization Over Sliding Windows.
Proceedings of the 26th International Conference on World Wide Web, 2017

Bicriteria Distributed Submodular Maximization in a Few Rounds.
Proceedings of the 29th ACM Symposium on Parallelism in Algorithms and Architectures, 2017

Overcommitment in Cloud Services Bin packing with Chance Constraints.
Proceedings of the 2017 ACM SIGMETRICS / International Conference on Measurement and Modeling of Computer Systems, Urbana-Champaign, IL, USA, June 05, 2017

Probabilistic Submodular Maximization in Sub-Linear Time.
Proceedings of the 34th International Conference on Machine Learning, 2017

Scalable Feature Selection via Distributed Diversity Maximization.
Proceedings of the Thirty-First AAAI Conference on Artificial Intelligence, 2017

2016
Network Creation Games.
Encyclopedia of Algorithms, 2016

Fast Distributed Submodular Cover: Public-Private Data Summarization.
Proceedings of the Advances in Neural Information Processing Systems 29: Annual Conference on Neural Information Processing Systems 2016, 2016

Horizontally Scalable Submodular Maximization.
Proceedings of the 33nd International Conference on Machine Learning, 2016

Greedy Column Subset Selection: New Bounds and Distributed Algorithms.
Proceedings of the 33nd International Conference on Machine Learning, 2016

2015
Randomized Composable Core-sets for Distributed Submodular Maximization.
Proceedings of the Forty-Seventh Annual ACM on Symposium on Theory of Computing, 2015

Online Submodular Welfare Maximization: Greedy Beats 1/2 in Random Order.
Proceedings of the Forty-Seventh Annual ACM on Symposium on Theory of Computing, 2015

Online Stochastic Matching with Unequal Probabilities.
Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, 2015

Sparse Solutions to Nonnegative Linear Systems and Applications.
Proceedings of the Eighteenth International Conference on Artificial Intelligence and Statistics, 2015

2014
Online allocation algorithms with applications in computational advertising.
PhD thesis, 2014

How to influence people with partial incentives.
Proceedings of the 23rd International World Wide Web Conference, 2014

Cooperative weakest link games.
Proceedings of the International conference on Autonomous Agents and Multi-Agent Systems, 2014

2013
Bicriteria Online Matching: Maximizing Weight and Cardinality.
Proceedings of the Web and Internet Economics - 9th International Conference, 2013

Revenue Maximization with Nonexcludable Goods.
Proceedings of the Web and Internet Economics - 9th International Conference, 2013

Constrained Binary Identification Problem.
Proceedings of the 30th International Symposium on Theoretical Aspects of Computer Science, 2013

Learning Disjunctions: Near-Optimal Trade-off between Mistakes and "I Don't Know's".
Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms, 2013

Optimal Coalition Structure Generation in Cooperative Graph Games.
Proceedings of the Twenty-Seventh AAAI Conference on Artificial Intelligence, 2013

2012
Efficiently Learning from Revealed Preference.
Proceedings of the Internet and Network Economics - 8th International Workshop, 2012

Simultaneous approximations for adversarial and stochastic online budgeted allocation.
Proceedings of the Twenty-Third Annual ACM-SIAM Symposium on Discrete Algorithms, 2012

Sequential group testing with graph constraints.
Proceedings of the 2012 IEEE Information Theory Workshop, 2012

2011
A cooperative approach to collusion in auctions.
SIGecom Exchanges, 2011

On the construction of prefix-free and fix-free codes with specified codeword compositions.
Discrete Applied Mathematics, 2011

Online Stochastic Weighted Matching: Improved Approximation Algorithms.
Proceedings of the Internet and Network Economics - 7th International Workshop, 2011

Optimal-time adaptive strong renaming, with applications to counting.
Proceedings of the 30th Annual ACM Symposium on Principles of Distributed Computing, 2011

Compression with graphical constraints: An interactive browser.
Proceedings of the 2011 IEEE International Symposium on Information Theory Proceedings, 2011

O(1)-Approximations for Maximum Movement Problems.
Proceedings of the Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, 2011

2010
Collusion in VCG Path Procurement Auctions.
Proceedings of the Internet and Network Economics - 6th International Workshop, 2010

Constant Price of Anarchy in Network Creation Games via Public Service Advertising.
Proceedings of the Algorithms and Models for the Web-Graph - 7th International Workshop, 2010

Minimizing the Diameter of a Network Using Shortcut Edges.
Proceedings of the Algorithm Theory, 2010

Collaborative scoring with dishonest participants.
Proceedings of the SPAA 2010: Proceedings of the 22nd Annual ACM Symposium on Parallelism in Algorithms and Architectures, 2010

Scheduling to minimize power consumption using submodular functions.
Proceedings of the SPAA 2010: Proceedings of the 22nd Annual ACM Symposium on Parallelism in Algorithms and Architectures, 2010

Trading off Mistakes and Don't-Know Predictions.
Proceedings of the Advances in Neural Information Processing Systems 23: 24th Annual Conference on Neural Information Processing Systems 2010. Proceedings of a meeting held 6-9 December 2010, 2010

How Efficient Can Gossip Be? (On the Cost of Resilient Information Exchange).
Proceedings of the Automata, Languages and Programming, 37th International Colloquium, 2010

Submodular Secretary Problem and Extensions.
Proceedings of the Approximation, 2010

2009
The Price of Anarchy in Cooperative Network Creation Games.
Proceedings of the 26th International Symposium on Theoretical Aspects of Computer Science, 2009

2008
Permutation betting markets: singleton betting with extra information.
Proceedings of the Proceedings 9th ACM Conference on Electronic Commerce (EC-2008), 2008

Some notes on fix-free codes.
Proceedings of the 42nd Annual Conference on Information Sciences and Systems, 2008

Ordinal Embedding: Approximation Algorithms and Dimensionality Reduction.
Proceedings of the Approximation, 2008

2007
Spanning trees with minimum weighted degrees.
Inf. Process. Lett., 2007

Scheduling to minimize gaps and power consumption.
Proceedings of the SPAA 2007: Proceedings of the 19th Annual ACM Symposium on Parallelism in Algorithms and Architectures, 2007

Minimizing movement.
Proceedings of the Eighteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2007

The price of anarchy in network creation games.
Proceedings of the Twenty-Sixth Annual ACM Symposium on Principles of Distributed Computing, 2007


  Loading...