Follow
niv buchbinder
niv buchbinder
Verified email at post.tau.ac.il - Homepage
Title
Cited by
Cited by
Year
A tight linear time (1/2)-approximation for unconstrained submodular maximization
N Buchbinder, M Feldman, J Seffi, R Schwartz
SIAM Journal on Computing 44 (5), 1384-1402, 2015
4972015
The design of competitive online algorithms via a primal–dual approach
N Buchbinder, JS Naor
Foundations and Trends® in Theoretical Computer Science 3 (2–3), 93-263, 2009
4472009
Online primal-dual algorithms for maximizing ad-auctions revenue
N Buchbinder, K Jain, J Naor
European Symposium on Algorithms, 253-264, 2007
3952007
Submodular maximization with cardinality constraints
N Buchbinder, M Feldman, J Naor, R Schwartz
Proceedings of the twenty-fifth annual ACM-SIAM symposium on Discrete …, 2014
3572014
Online primal-dual algorithms for covering and packing
N Buchbinder, J Naor
Mathematics of Operations Research 34 (2), 270-286, 2009
344*2009
The online set cover problem
N Alon, B Awerbuch, Y Azar
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing …, 2003
3252003
A primal-dual randomized algorithm for weighted paging
N Bansal, N Buchbinder, J Naor
Journal of the ACM (JACM) 59 (4), 1-24, 2012
1752012
A general approach to online network optimization problems
N Alon, B Awerbuch, Y Azar, N Buchbinder, J Naor
ACM Transactions on Algorithms (TALG) 2 (4), 640-660, 2006
1742006
A Polylogarithmic-Competitive Algorithm for the k-Server Problem
N Bansal, N Buchbinder, A Madry, J Naor
Journal of the ACM (JACM) 62 (5), 1-49, 2015
1732015
Online job-migration for reducing the electricity bill in the cloud
N Buchbinder, N Jain, I Menache
NETWORKING 2011: 10th International IFIP TC 6 Networking Conference …, 2011
1252011
Deterministic algorithms for submodular maximization problems
N Buchbinder, M Feldman
ACM Transactions on Algorithms (TALG) 14 (3), 1-20, 2018
1242018
Online submodular maximization with preemption
N Buchbinder, M Feldman, R Schwartz
ACM Transactions on Algorithms (TALG) 15 (3), 1-31, 2019
1082019
Constrained submodular maximization via a nonsymmetric technique
N Buchbinder, M Feldman
Mathematics of Operations Research 44 (3), 988-1005, 2019
902019
Secretary problems via linear programming
N Buchbinder, K Jain, M Singh
Mathematics of Operations Research 39 (1), 190-206, 2014
89*2014
Randomized competitive algorithms for generalized caching
N Bansal, N Buchbinder, J Naor
Proceedings of the fortieth annual ACM symposium on Theory of computing, 235-244, 2008
87*2008
Improved bounds for online routing and packing via a primal-dual approach
N Buchbinder, J Naor
2006 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS'06 …, 2006
872006
Online algorithms for covering and packing problems with convex objectives
Y Azar, N Buchbinder, THH Chan, S Chen, IR Cohen, A Gupta, Z Huang, ...
2016 IEEE 57th Annual Symposium on Foundations of Computer Science (FOCS …, 2016
662016
Unified algorithms for online learning and competitive analysis
N Buchbinder, S Chen, JS Naor, O Shamir
Conference on Learning Theory, 5.1-5.18, 2012
652012
Simplex partitioning via exponential clocks and the multiway cut problem
N Buchbinder, J Naor, R Schwartz
Proceedings of the forty-fifth annual ACM symposium on Theory of computing …, 2013
63*2013
Competitive analysis via regularization
N Buchbinder, S Chen, J Naor
Proceedings of the twenty-fifth annual ACM-SIAM symposium on Discrete …, 2014
622014
The system can't perform the operation now. Try again later.
Articles 1–20