Morteza Zadimoghaddam

From MaRDI portal
Revision as of 05:46, 7 October 2023 by Import231006081045 (talk | contribs) (Created automatically from import231006081045)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

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
https://portal.mardi4nfdi.de/entity/Q46079202018-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
Randomized Composable Core-sets for Distributed Submodular Maximization2015-08-21Paper
Online Submodular Welfare Maximization2015-08-21Paper
Revenue Maximization with Nonexcludable Goods2015-01-12Paper
Bicriteria Online Matching: Maximizing Weight and Cardinality2015-01-12Paper
https://portal.mardi4nfdi.de/entity/Q29346042014-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