|
The Online Set Cover Problem. Noga Alon, Baruch
Awerbuch, Yossi Azar, Niv Buchbinder, and Seffi Naor, 35th Annual ACM
Symposium on Theory of Computing (STOC 2003), pp. 100-105. [ps]
Lower and Upper Bounds on Obtaining
History Independence. Niv Buchbinder and
Erez Petrank, 23rd Annual Int. Cryptography Conference (Crypto 2003), pp.
445-462. [ps]
A General Approach to Online
Network Optimization Problems. Noga Alon, Baruch Awerbuch, Yossi Azar, Niv
Buchbinder, and Seffi Naor, ACM-SIAM Symposium on Discrete Algorithms
(SODA 2004). [ps]
Online Primal-Dual Algorithms for
Covering and Packing Problems.
Niv Buchbinder and Seffi Naor, 13th Annual European Symposium on
Algorithms (ESA 2005) [ps] full version [pdf]
Fair Online Load Balancing. Niv Buchbinder and
Seffi Naor, 18th ACM Symposium on Parallelism in Algorithms and
Architectures (SPAA 2006) [ps]
Improved Bounds for Online Routing
and Packing via a Primal-Dual Approach. Niv Buchbinder and Seffi Naor, 47th
annual ieee Symposium on Foundations of Computer Science (FOCS 2006) [ps]
Online Primal-Dual Algorithms for Maximizing Ad-Auctions
Revenue. Niv Buchbinder, Kamal Jain and Seffi Naor, 15th
Annual European Symposium on Algorithms (ESA 2007) - Best Paper [ps]
An O(log2k)-competitive
Algorithm for Metric Bipartite Matching. Nikhil Bansal, Niv Buchbinder, Anupam Gupta,
Seffi Naor, 15th Annual European Symposium on Algorithms (ESA 2007) [ps]
A Primal-Dual Randomized Algorithm
for Weighted Paging.
Nikhil Bansal, Niv Buchbinder and Seffi Naor, 48th annual
ieee Symposium on Foundations of Computer Science (FOCS 2007).[pdf]
Online Make-to-Order Joint
Replenishment Model: Primal Dual Competitive Algorithms. Niv Buchbinder, Tracy
Kimbrel, Retsef Levi, Konstantin Makarychev and Maxim Sviridenko, (SODA
2008). [ps]
Non-cooperative Cost Sharing Games
via Subsidies. Niv Buchbinder, Liane Lewin-Eytan, Joseph (Seffi)
Naor, Ariel Orda, 1st International Symposium on Algorithmic Game Theory
(SAGT 2008). [pdf]
Randomized Competitive Algorithms
for Generalized Caching. Nikhil Bansal, Niv Buchbinder and Seffi Naor, 40th
Annual ACM Symposium on Theory of Computing (STOC 2008). [pdf]
Dynamic Power Allocation under
Arbitrary Varying Channels -- An Online Approach. Niv
Buchbinder, Liane Lewin-Eytan, Ishai Menache, Seffi Naor and Ariel Orda, 28th
Conference on Computer Communications (INFOCOM 2009). [pdf]
Towards the Randomized k-Server
Conjecture: A Primal-Dual Approach. Nikhil Bansal, Niv Buchbinder and Seffi Naor,
ACM-SIAM Symposium on Discrete Algorithms (SODA 2010). [pdf]
Dynamic Power Allocation under Arbitrary Varying Channels
– The Multi-User Case. Niv Buchbinder, Liane Lewin-Eytan, Ishai Menache,
Seffi Naor and Ariel Orda, 29th Conference on Computer
Communications (INFOCOM 2010).
Frequency Capping in Online Advertising. Niv
Buchbinder, Moran Feldman, Arpita Ghosh and Seffi Naor, submitted.
Unfair Metrical Task Systems on HSTs and Applications. Nikhil
Bansal, Niv Buchbinder and Seffi Naor, submitted.
Maximizing Social Welfare Online. Yossi
Azar, Niv Buchbinder and Kamal Jain, submitted.
Incentives in Online Auctions and Secretary Problems via
Linear Programming. Niv Buchbinder, Kamal Jain and Mohit Singh,
submitted.
|
