Niv Buchbinder

	2012
34		Niv Buchbinder, Liane Lewin-Eytan, Ishai Menache, Joseph Naor, Ariel Orda: Dynamic Power Allocation Under Arbitrary Varying Channels - An Online Approach. IEEE/ACM Trans. Netw. 20(2): 477-487 (2012)
33		Nikhil Bansal, Niv Buchbinder, Joseph Naor: Randomized Competitive Algorithms for Generalized Caching. SIAM J. Comput. 41(2): 391-414 (2012)
	2011
32		Nikhil Bansal, Niv Buchbinder, Aleksander Madry, Joseph Naor: A Polylogarithmic-Competitive Algorithm for the k-Server Problem. FOCS 2011: 267-276
31		Niv Buchbinder, Navendu Jain, Ishai Menache: Online Job-Migration for Reducing the Electricity Bill in the Cloud. Networking (1) 2011: 172-185
30		Niv Buchbinder, Moran Feldman, Arpita Ghosh, Joseph Naor: Frequency Capping in Online Advertising. WADS 2011: 147-158
29		Nikhil Bansal, Niv Buchbinder, Aleksander Madry, Joseph Naor: A Polylogarithmic-Competitive Algorithm for the k-Server Problem CoRR abs/1110.1580: (2011)
	2010
28		Jacob Abernethy, Peter L. Bartlett, Niv Buchbinder, Isabelle Stanton: A Regularization Approach to Metrical Task Systems. ALT 2010: 270-284
27		Yossi Azar, Niv Buchbinder, Kamal Jain: How to Allocate Goods in an Online Market? ESA (2) 2010: 51-62
26		Nikhil Bansal, Niv Buchbinder, Joseph Naor: Metrical Task Systems and the k-Server Problem on HSTs. ICALP (1) 2010: 287-298
25		Niv Buchbinder, Liane Lewin-Eytan, Ishai Menache, Joseph Naor, Ariel Orda: Dynamic Power Allocation Under Arbitrary Varying Channels - The Multi-User Case. INFOCOM 2010: 2402-2410
24		Niv Buchbinder, Kamal Jain, Mohit Singh: Secretary Problems via Linear Programming. IPCO 2010: 163-176
23		Nikhil Bansal, Niv Buchbinder, Joseph Naor: Towards the Randomized k-Server Conjecture: A Primal-Dual Approach. SODA 2010: 40-55
22		Niv Buchbinder, Kamal Jain, Mohit Singh: Incentives in Online Auctions via Linear Programming. WINE 2010: 106-117
21		Niv Buchbinder, Liane Lewin-Eytan, Joseph Naor, Ariel Orda: Non-Cooperative Cost Sharing Games via Subsidies. Theory Comput. Syst. 47(1): 15-37 (2010)
	2009
20		Niv Buchbinder, Liane Lewin-Eytan, Ishai Menache, Joseph Naor, Ariel Orda: Dynamic Power Allocation Under Arbitrary Varying Channels - An Online Approach. INFOCOM 2009: 145-153
19		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)
18		Niv Buchbinder, Joseph Naor: Online Primal-Dual Algorithms for Covering and Packing. Math. Oper. Res. 34(2): 270-286 (2009)
17		Noga Alon, Baruch Awerbuch, Yossi Azar, Niv Buchbinder, Joseph Naor: The Online Set Cover Problem. SIAM J. Comput. 39(2): 361-370 (2009)
16		Niv Buchbinder, Kamal Jain, Mohit Singh: Secretary problems and incentives via linear programming. SIGecom Exchanges 8(2): 6 (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	Jacob Abernethy	[28]
2	Noga Alon	[2] [4] [7] [17]
3	Baruch Awerbuch	[2] [4] [7] [17]
4	Yossi Azar	[2] [4] [7] [17] [27]
5	Nikhil Bansal	[10] [11] [13] [23] [26] [29] [32] [33]
6	Katherine Barabash	[1]
7	Peter L. Bartlett	[28]
8	Tamar Domani	[1]
9	Moran Feldman	[30]
10	Arpita Ghosh	[30]
11	Anupam Gupta	[11]
12	Kamal Jain	[12] [16] [22] [24] [27]
13	Navendu Jain	[31]
14	Tracy Kimbrel	[14]
15	Elliot K. Kolodner	[1]
16	Retsef Levi	[14]
17	Liane Lewin-Eytan	[15] [20] [21] [25] [34]
18	Aleksander Madry	[29] [32]
19	Konstantin Makarychev	[14]
20	Ishai Menache	[20] [25] [31] [34]
21	Joseph Naor (Seffi Naor)	[2] [4] [5] [7] [8] [9] [10] [11] [12] [13] [15] [17] [18] [19] [20] [21] [23] [25] [26] [29] [30] [32] [33] [34]
22	Ariel Orda	[15] [20] [21] [25] [34]
23	Yoav Ossia	[1]
24	Erez Petrank	[3] [6]
25	Shlomit S. Pinter	[1]
26	Janice C. Shepherd	[1]
27	Mohit Singh	[16] [22] [24]
28	Ron Sivan	[1]
29	Isabelle Stanton	[28]
30	Maxim Sviridenko	[14]
31	Victor Umansky	[1]

Colors in the list of coauthors

Last update Sun May 27 04:04:01 2012 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page