The following pages link to Niv Buchbinder (Q398846):
Displayed 50 items.
- Fair online load balancing (Q398848) (← links)
- A randomized \(O(\log^2k)\)-competitive algorithm for metric bipartite matching (Q476428) (← links)
- Non-cooperative cost sharing games via subsidies (Q987398) (← links)
- Online algorithms for maximum cardinality matching with edge arrivals (Q1741843) (← links)
- A simple algorithm for the multiway cut problem (Q2294387) (← links)
- Incentive compatible mulit-unit combinatorial auctions: a primal dual approach (Q2345944) (← links)
- Lower and upper bounds on obtaining history independence (Q2490116) (← links)
- Unified Algorithms for Online Learning and Competitive Analysis (Q2806821) (← links)
- Approximation Algorithms for Online Weighted Rank Function Maximization under Matroid Constraints (Q2843243) (← links)
- Competitive Algorithms for Restricted Caching and Matroid Caching (Q2921406) (← links)
- A general approach to online network optimization problems (Q2944534) (← links)
- Online Primal-Dual Algorithms for Covering and Packing (Q3169034) (← links)
- A Polylogarithmic-Competitive Algorithm for the <i>k</i> -Server Problem (Q3177748) (← links)
- A Tight Linear Time (1/2)-Approximation for Unconstrained Submodular Maximization (Q3449564) (← links)
- An O(log2 k)-Competitive Algorithm for Metric Bipartite Matching (Q3527240) (← links)
- (Q3549707) (← links)
- The Online Set Cover Problem (Q3558005) (← links)
- (Q3579387) (← links)
- Metrical Task Systems and the k-Server Problem on HSTs (Q3587386) (← links)
- The Design of Competitive Online Algorithms via a Primal—Dual Approach (Q3636884) (← links)
- Deterministic Algorithms for Submodular Maximization Problems (Q4554360) (← links)
- Deterministic Algorithms for Submodular Maximization Problems (Q4575606) (← links)
- <i>O</i>(depth)-Competitive Algorithm for Online Multi-level Aggregation (Q4575823) (← links)
- Simplex Transformations and the Multiway Cut Problem (Q4575907) (← links)
- Fair Coin Flipping: Tighter Analysis and the Many-Party Case (Q4575919) (← links)
- Simplex Partitioning via Exponential Clocks and the Multiway-Cut Problem (Q4577771) (← links)
- A Regularization Approach to Metrical Task Systems (Q4930704) (← links)
- Online Submodular Maximization with Preemption (Q4972676) (← links)
- Simplex Transformations and the Multiway Cut Problem (Q5000653) (← links)
- Constrained Submodular Maximization via a Nonsymmetric Technique (Q5108227) (← links)
- Online Algorithms for Maximum Cardinality Matching with Edge Arrivals (Q5111708) (← links)
- Online Make-to-Order Joint Replenishment Model: Primal-Dual Competitive Algorithms (Q5166263) (← links)
- <i>k</i>-Servers with a Smile: Online Algorithms via Projections (Q5236188) (← links)
- Deterministic (½ + <i>ε</i>)-Approximation for Submodular Maximization over a Matroid (Q5236197) (← links)
- Comparing Apples and Oranges: Query Tradeoff in Submodular Maximization (Q5363100) (← links)
- Online Submodular Maximization with Preemption (Q5363102) (← links)
- Competitive Analysis via Regularization (Q5383991) (← links)
- Submodular Maximization with Cardinality Constraints (Q5384068) (← links)
- A Primal-Dual Randomized Algorithm for Weighted Paging (Q5395689) (← links)
- (Q5417604) (← links)
- Advances in Cryptology - CRYPTO 2003 (Q5428135) (← links)
- Non-cooperative Cost Sharing Games Via Subsidies (Q5459998) (← links)
- Algorithms – ESA 2005 (Q5475877) (← links)
- A Polylogarithmic-Competitive Algorithm for the k-Server Problem (Q5494971) (← links)
- Simplex partitioning via exponential clocks and the multiway cut problem (Q5495824) (← links)
- (Q5501312) (← links)
- Online \(k\)-taxi via double coverage and time-reverse primal-dual (Q5918418) (← links)
- Online submodular maximization: beating 1/2 made simple (Q5918911) (← links)
- Online \(k\)-taxi via double coverage and time-reverse primal-dual (Q5925636) (← links)
- Deterministic \(\boldsymbol{(\unicode{x00BD}+\varepsilon)}\) -Approximation for Submodular Maximization over a Matroid (Q6170425) (← links)