Morteza Zadimoghaddam

From MaRDI portal
Person:547298

Available identifiers

zbMath Open zadimoghaddam.mortezaMaRDI QIDQ547298

List of research outcomes





PublicationDate of PublicationType
Edge-weighted online bipartite matching2024-06-06Paper
Submodular maximization with nearly optimal approximation, adaptivity and query complexity2019-10-15Paper
Learning Disjunctions: Near-Optimal Trade-off between Mistakes and “I Don't Knows”2019-05-15Paper
Online submodular welfare maximization: greedy beats 1/2 in random order2018-07-04Paper
Consistent hashing with bounded loads2018-03-15Paper
Online stochastic matching with unequal probabilities2017-10-05Paper
Constrained binary identification problem2017-01-30Paper
Optimal-time adaptive strong renaming, with applications to counting2015-09-11Paper
Online submodular welfare maximization: greedy beats 1/2 in random order2015-08-21Paper
Randomized composable core-sets for distributed submodular maximization2015-08-21Paper
Revenue maximization with nonexcludable goods2015-01-12Paper
Bicriteria online matching: maximizing weight and cardinality2015-01-12Paper
Minimizing movement2014-12-18Paper
Submodular secretary problem and extensions2014-12-05Paper
Minimizing movement2014-11-18Paper
The price of anarchy in network creation games2014-09-09Paper
The price of anarchy in network creation games2014-03-13Paper
Scheduling to minimize gaps and power consumption2014-02-05Paper
Constant price of anarchy in network-creation games via public-service advertising2012-08-29Paper
The price of anarchy in cooperative network creation games2012-04-24Paper
On the construction of prefix-free and fix-free codes with specified codeword compositions2012-03-19Paper
Online stochastic weighted matching: improved approximation algorithms2011-12-05Paper
\(O(1)\)-approximations for maximum movement problems2011-08-17Paper
Permutation betting markets: singleton betting with extra information2011-07-01Paper
Constant price of anarchy in network creation games via public service advertising2011-01-21Paper
Submodular secretary problem and extensions2010-09-10Paper
How efficient can gossip be? (On the cost of resilient information exchange)2010-09-07Paper
Minimizing the diameter of a network using shortcut edges2010-06-22Paper
Spanning trees with minimum weighted degrees2010-03-24Paper
Finding an Integral vector in an Unknown Polyhedral Cone2010-01-31Paper
Ordinal Embedding: Approximation Algorithms and Dimensionality Reduction2008-11-27Paper

Research outcomes over time

This page was built for person: Morteza Zadimoghaddam