Niv Buchbinder

	2009
17		Niv Buchbinder, Joseph Naor: The Design of Competitive Online Algorithms via a Primal-Dual Approach. Foundations and Trends in Theoretical Computer Science 3(2-3): 93-263 (2009)
16		Niv Buchbinder, Joseph Naor: Online Primal-Dual Algorithms for Covering and Packing. Math. Oper. Res. 34(2): 270-286 (2009)
	2008
15		Niv Buchbinder, Liane Lewin-Eytan, Joseph Naor, Ariel Orda: Non-cooperative Cost Sharing Games Via Subsidies. SAGT 2008: 337-349
14		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		Nikhil Bansal, Niv Buchbinder, Joseph Naor: Randomized competitive algorithms for generalized caching. STOC 2008: 235-244
	2007
12		Niv Buchbinder, Kamal Jain, Joseph Naor: Online Primal-Dual Algorithms for Maximizing Ad-Auctions Revenue. ESA 2007: 253-264
11		Nikhil Bansal, Niv Buchbinder, Anupam Gupta, Joseph Naor: An O (log2 k )-Competitive Algorithm for Metric Bipartite Matching. ESA 2007: 522-533
10		Nikhil Bansal, Niv Buchbinder, Joseph Naor: A Primal-Dual Randomized Algorithm for Weighted Paging. FOCS 2007: 507-517
	2006
9		Niv Buchbinder, Joseph Naor: Improved Bounds for Online Routing and Packing Via a Primal-Dual Approach. FOCS 2006: 293-304
8		Niv Buchbinder, Joseph Naor: Fair online load balancing. SPAA 2006: 291-298
7		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		Niv Buchbinder, Erez Petrank: Lower and upper bounds on obtaining history independence. Inf. Comput. 204(2): 291-337 (2006)
	2005
5		Niv Buchbinder, Joseph Naor: Online Primal-Dual Algorithms for Covering and Packing Problems. ESA 2005: 689-701
	2004
4		Noga Alon, Baruch Awerbuch, Yossi Azar, Niv Buchbinder, Joseph Naor: A general approach to online network optimization problems. SODA 2004: 577-586
	2003
3		Niv Buchbinder, Erez Petrank: Lower and Upper Bounds on Obtaining History Independence. CRYPTO 2003: 445-462
2		Noga Alon, Baruch Awerbuch, Yossi Azar, Niv Buchbinder, Joseph Naor: The online set cover problem. STOC 2003: 100-105
	2001
1		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

Coauthor Index

1	Noga Alon	[2] [4] [7]
2	Baruch Awerbuch	[2] [4] [7]
3	Yossi Azar	[2] [4] [7]
4	Nikhil Bansal	[10] [11] [13]
5	Katherine Barabash	[1]
6	Tamar Domani	[1]
7	Anupam Gupta	[11]
8	Kamal Jain	[12]
9	Tracy Kimbrel	[14]
10	Elliot K. Kolodner	[1]
11	Retsef Levi	[14]
12	Liane Lewin-Eytan	[15]
13	Konstantin Makarychev	[14]
14	Joseph Naor (Seffi Naor)	[2] [4] [5] [7] [8] [9] [10] [11] [12] [13] [15] [16] [17]
15	Ariel Orda	[15]
16	Yoav Ossia	[1]
17	Erez Petrank	[3] [6]
18	Shlomit S. Pinter	[1]
19	Janice C. Shepherd	[1]
20	Ron Sivan	[1]
21	Maxim Sviridenko	[14]
22	Victor Umansky	[1]