| 2008 |
|---|
| 15 | EE | Niv Buchbinder,
Liane Lewin-Eytan,
Joseph Naor,
Ariel Orda:
Non-cooperative Cost Sharing Games Via Subsidies.
SAGT 2008: 337-349 |
| 14 | EE | Niv Buchbinder,
Tracy Kimbrel,
Retsef Levi,
Konstantin Makarychev,
Maxim Sviridenko:
Online make-to-order joint replenishment model: primal dual competitive algorithms.
SODA 2008: 952-961 |
| 13 | EE | Nikhil Bansal,
Niv Buchbinder,
Joseph Naor:
Randomized competitive algorithms for generalized caching.
STOC 2008: 235-244 |
| 2007 |
|---|
| 12 | EE | Niv Buchbinder,
Kamal Jain,
Joseph Naor:
Online Primal-Dual Algorithms for Maximizing Ad-Auctions Revenue.
ESA 2007: 253-264 |
| 11 | EE | Nikhil Bansal,
Niv Buchbinder,
Anupam Gupta,
Joseph Naor:
An O (log2 k )-Competitive Algorithm for Metric Bipartite Matching.
ESA 2007: 522-533 |
| 10 | EE | Nikhil Bansal,
Niv Buchbinder,
Joseph Naor:
A Primal-Dual Randomized Algorithm for Weighted Paging.
FOCS 2007: 507-517 |
| 2006 |
|---|
| 9 | EE | Niv Buchbinder,
Joseph Naor:
Improved Bounds for Online Routing and Packing Via a Primal-Dual Approach.
FOCS 2006: 293-304 |
| 8 | EE | Niv Buchbinder,
Joseph Naor:
Fair online load balancing.
SPAA 2006: 291-298 |
| 7 | EE | Noga Alon,
Baruch Awerbuch,
Yossi Azar,
Niv Buchbinder,
Joseph Naor:
A general approach to online network optimization problems.
ACM Transactions on Algorithms 2(4): 640-660 (2006) |
| 6 | EE | Niv Buchbinder,
Erez Petrank:
Lower and upper bounds on obtaining history independence.
Inf. Comput. 204(2): 291-337 (2006) |
| 2005 |
|---|
| 5 | EE | Niv Buchbinder,
Joseph Naor:
Online Primal-Dual Algorithms for Covering and Packing Problems.
ESA 2005: 689-701 |
| 2004 |
|---|
| 4 | EE | Noga Alon,
Baruch Awerbuch,
Yossi Azar,
Niv Buchbinder,
Joseph Naor:
A general approach to online network optimization problems.
SODA 2004: 577-586 |
| 2003 |
|---|
| 3 | EE | Niv Buchbinder,
Erez Petrank:
Lower and Upper Bounds on Obtaining History Independence.
CRYPTO 2003: 445-462 |
| 2 | EE | Noga Alon,
Baruch Awerbuch,
Yossi Azar,
Niv Buchbinder,
Joseph Naor:
The online set cover problem.
STOC 2003: 100-105 |
| 2001 |
|---|
| 1 | EE | Katherine Barabash,
Niv Buchbinder,
Tamar Domani,
Elliot K. Kolodner,
Yoav Ossia,
Shlomit S. Pinter,
Janice C. Shepherd,
Ron Sivan,
Victor Umansky:
Mostly Accurate Stack Scanning.
Java™ Virtual Machine Research and Technology Symposium 2001 |
