The following pages link to Morteza Zadimoghaddam (Q547298):
Displayed 30 items.
- Permutation betting markets: singleton betting with extra information (Q547299) (← links)
- On the construction of prefix-free and fix-free codes with specified codeword compositions (Q765325) (← links)
- Spanning trees with minimum weighted degrees (Q2380008) (← links)
- Scheduling to minimize gaps and power consumption (Q2434309) (← links)
- Constant Price of Anarchy in Network-Creation Games via Public-Service Advertising (Q2909128) (← links)
- Minimizing movement (Q2930255) (← links)
- Submodular secretary problem and extensions (Q2933663) (← links)
- (Q2934604) (← links)
- Revenue Maximization with Nonexcludable Goods (Q2937745) (← links)
- Bicriteria Online Matching: Maximizing Weight and Cardinality (Q2937766) (← links)
- Randomized Composable Core-sets for Distributed Submodular Maximization (Q2941499) (← links)
- Online Submodular Welfare Maximization (Q2941586) (← links)
- Optimal-time adaptive strong renaming, with applications to counting (Q2943401) (← links)
- (Q2957915) (← links)
- Constant Price of Anarchy in Network Creation Games via Public Service Advertising (Q3067511) (← links)
- O(1)-Approximations for Maximum Movement Problems (Q3088082) (← links)
- Online Stochastic Weighted Matching: Improved Approximation Algorithms (Q3102585) (← links)
- The price of anarchy in network creation games (Q3189054) (← links)
- Ordinal Embedding: Approximation Algorithms and Dimensionality Reduction (Q3541784) (← links)
- Minimizing the Diameter of a Network Using Shortcut Edges (Q3569910) (← links)
- How Efficient Can Gossip Be? (On the Cost of Resilient Information Exchange) (Q3587432) (← links)
- Submodular Secretary Problem and Extensions (Q3588398) (← links)
- Online Submodular Welfare Maximization: Greedy Beats 1/2 in Random Order (Q4571927) (← links)
- (Q4607920) (← links)
- Submodular Maximization with Nearly Optimal Approximation, Adaptivity and Query Complexity (Q5236198) (← links)
- Online Stochastic Matching with Unequal Probabilities (Q5363007) (← links)
- (Q5389986) (← links)
- The price of anarchy in network creation games (Q5401424) (← links)
- Learning Disjunctions: Near-Optimal Trade-off between Mistakes and “I Don't Knows” (Q5741808) (← links)
- Finding an Integral vector in an Unknown Polyhedral Cone (Q6217417) (← links)