Niv Buchbinder

Most-cited papers

A Tight Linear Time (1/2)-Approximation for Unconstrained Submodular Maximization
Niv Buchbinder, Moran Feldman, J. Naor, Roy Schwartz
2012IEEE Annual Symposium on Foundations of Computer Science488 citations Open access
Semantic Scholar
The Design of Competitive Online Algorithms via a Primal-Dual Approach
Niv Buchbinder, J. Naor
2009Foundations and Trends® in Theoretical Computer Science435 citations
Semantic Scholar
Online Primal-Dual Algorithms for Maximizing Ad-Auctions Revenue
Niv Buchbinder, K. Jain, J. Naor
2007Embedded Systems and Applications386 citations
Semantic Scholar
Submodular Maximization with Cardinality Constraints
Niv Buchbinder, Moran Feldman, J. Naor, Roy Schwartz
2014ACM-SIAM Symposium on Discrete Algorithms348 citations Open access
Semantic Scholar
Online Primal-Dual Algorithms for Covering and Packing
Niv Buchbinder, J. Naor
2009Mathematics of Operations Research237 citations
Semantic Scholar
A primal-dual randomized algorithm for weighted paging
N. Bansal, Niv Buchbinder, J. Naor
2012IEEE Annual Symposium on Foundations of Computer Science184 citations Open access
Semantic Scholar
A general approach to online network optimization problems
N. Alon, B. Awerbuch, Y. Azar, Niv Buchbinder +1 more
2004ACM-SIAM Symposium on Discrete Algorithms158 citations
Semantic Scholar
A Polylogarithmic-Competitive Algorithm for the k-Server Problem
N. Bansal, Niv Buchbinder, A. Ma̧dry, Joseph +1 more
2011IEEE Annual Symposium on Foundations of Computer Science157 citations Open access
Semantic Scholar
Deterministic Algorithms for Submodular Maximization Problems
Niv Buchbinder, Moran Feldman
2015ACM-SIAM Symposium on Discrete Algorithms134 citations Open access
Semantic Scholar
Online Submodular Maximization with Preemption
Niv Buchbinder, Moran Feldman, Roy Schwartz
2015ACM-SIAM Symposium on Discrete Algorithms130 citations Open access
Semantic Scholar
Online Primal-Dual Algorithms for Covering and Packing Problems
Niv Buchbinder, J. Naor
2005Embedded Systems and Applications124 citations
Semantic Scholar
Constrained Submodular Maximization via a Non-symmetric Technique
Niv Buchbinder, Moran Feldman
2016Mathematics of Operations Research121 citations Open access
Semantic Scholar
Online Job-Migration for Reducing the Electricity Bill in the Cloud
Niv Buchbinder, Navendu Jain, I. Menache
2011Networking103 citations Open access
Semantic Scholar
Improved bounds for online routing and packing via a primal-dual approach
Niv Buchbinder, J. Naor
2006IEEE Annual Symposium on Foundations of Computer Science99 citations
Semantic Scholar
Online make-to-order joint replenishment model: primal dual competitive algorithms
Niv Buchbinder, T. Kimbrelt, R. Levi, K. Makarychev +1 more
2008ACM-SIAM Symposium on Discrete Algorithms90 citations
Semantic Scholar
Secretary Problems via Linear Programming
Niv Buchbinder, K. Jain, Mohit Singh
2010Mathematics of Operations Research86 citations
Semantic Scholar
Randomized competitive algorithms for generalized caching
N. Bansal, Niv Buchbinder, J. Naor
2008Symposium on the Theory of Computing83 citations Open access
Semantic Scholar
Competitive Analysis via Regularization
Niv Buchbinder, Shahar Chen, J. Naor
2014ACM-SIAM Symposium on Discrete Algorithms82 citations
Semantic Scholar
Online Algorithms for Covering and Packing Problems with Convex Objectives
Y. Azar, Niv Buchbinder, T.-H. Hubert Chan, Shahar Chen +7 more
2016IEEE Annual Symposium on Foundations of Computer Science75 citations
Semantic Scholar
Unified Algorithms for Online Learning and Competitive Analysis
Niv Buchbinder, Shahar Chen, J. Naor, Ohad Shamir
2012Annual Conference Computational Learning Theory65 citations Open access
Semantic Scholar
Comparing Apples and Oranges: Query Trade-off in Submodular Maximization
Niv Buchbinder, Moran Feldman, Roy Schwartz
2014Mathematics of Operations Research58 citations Open access
Semantic Scholar
Simplex partitioning via exponential clocks and the multiway cut problem
Niv Buchbinder, J. Naor, Roy Schwartz
2013Symposium on the Theory of Computing56 citations
Semantic Scholar
Constrained Submodular Maximization via New Bounds for DR-Submodular Functions
Niv Buchbinder, Moran Feldman
2023Symposium on the Theory of Computing53 citations Open access
Semantic Scholar
Submodular Functions Maximization Problems
Niv Buchbinder, Moran Feldman
2018Handbook of Approximation Algorithms and Metaheuristics53 citations
Semantic Scholar
Deterministic (1/2 + ε)-Approximation for Submodular Maximization over a Matroid
Niv Buchbinder, Moran Feldman, M. Garg
2018ACM-SIAM Symposium on Discrete Algorithms53 citations
Semantic Scholar
O(depth)-Competitive Algorithm for Online Multi-level Aggregation
Niv Buchbinder, Moran Feldman, J. Naor, Ohad Talmon
2017ACM-SIAM Symposium on Discrete Algorithms47 citations
Semantic Scholar
Online Algorithms for Maximum Cardinality Matching with Edge Arrivals
Niv Buchbinder, Danny Segev, Yevgeny Tkach
2018Algorithmica44 citations Open access
Semantic Scholar
A Randomized O(log2k)-Competitive Algorithm for Metric Bipartite Matching
N. Bansal, Niv Buchbinder, Anupam Gupta, J. Naor
2014Algorithmica43 citations
Semantic Scholar
Towards the randomized k-server conjecture: a primal-dual approach
N. Bansal, Niv Buchbinder, J. Naor
2010ACM-SIAM Symposium on Discrete Algorithms41 citations
Semantic Scholar
An O (log2 k )-Competitive Algorithm for Metric Bipartite Matching
N. Bansal, Niv Buchbinder, Anupam Gupta, J. Naor
2007Embedded Systems and Applications39 citations Open access
Semantic Scholar
Lower and upper bounds on obtaining history independence
Niv Buchbinder, E. Petrank
2003Information and Computation33 citations Open access
Semantic Scholar
Frequency capping in online advertising
Niv Buchbinder, Moran Feldman, Arpita Ghosh, J. Naor
2011Journal of Scheduling32 citations Open access
Semantic Scholar
How to Allocate Goods in an Online Market?
Y. Azar, Niv Buchbinder, K. Jain
2010Algorithmica31 citations
Semantic Scholar
k-Servers with a Smile: Online Algorithms via Projections
Niv Buchbinder, Anupam Gupta, M. Molinaro, Joseph +1 more
2018ACM-SIAM Symposium on Discrete Algorithms30 citations
Semantic Scholar
Dynamic Power Allocation Under Arbitrary Varying Channels - An Online Approach
Niv Buchbinder, L. Lewin-Eytan, I. Menache, J. Naor +1 more
2009IEEE INFOCOM 200930 citations Open access
Semantic Scholar
Online Virtual Machine Allocation with Lifetime and Load Predictions
Niv Buchbinder, Yaron Fairstein, Konstantina Mellou, I. Menache +1 more
2021Measurement and Modeling of Computer Systems29 citations
Semantic Scholar
A Randomized O(log2k)-Competitive Algorithm for Metric Bipartite Matching
N. Bansal, Niv Buchbinder, Anupam Gupta, J. Naor
2012Algorithmica29 citations
Semantic Scholar
Metrical Task Systems and the k-Server Problem on HSTs
N. Bansal, Niv Buchbinder, J. Naor
2010International Colloquium on Automata, Languages and Programming29 citations
Semantic Scholar
Deterministic Algorithm and Faster Algorithm for Submodular Maximization Subject to a Matroid Constraint
Niv Buchbinder, Moran Feldman
2024IEEE Annual Symposium on Foundations of Computer Science28 citations
Semantic Scholar
Online submodular maximization: beating 1/2 made simple
Niv Buchbinder, Moran Feldman, Yuval Filmus, M. Garg
2018Mathematical programming27 citations Open access
Semantic Scholar
Fair online load balancing
Niv Buchbinder, J. Naor
2006Journal of Scheduling26 citations
Semantic Scholar
Fair Coin Flipping: Tighter Analysis and the Many-Party Case
Niv Buchbinder, Iftach Haitner, Nissan Levi, Eliad Tsfadia
2017ACM-SIAM Symposium on Discrete Algorithms25 citations Open access
Semantic Scholar
Simplex Transformations and the Multiway Cut Problem
Niv Buchbinder, Roy Schwartz, Baruch Weizman
2017ACM-SIAM Symposium on Discrete Algorithms24 citations
Semantic Scholar
Non-Cooperative Cost Sharing Games via Subsidies
Niv Buchbinder, L. Lewin-Eytan, J. Naor, Ariel Orda
2010Theory of Computing Systems23 citations
Semantic Scholar
Lossless Online Rounding for Online Bipartite Matching (Despite its Impossibility)
Niv Buchbinder, J. Naor, David Wajc
2021ACM-SIAM Symposium on Discrete Algorithms19 citations Open access
Semantic Scholar
A Regularization Approach to Metrical Task Systems
J. Abernethy, P. Bartlett, Niv Buchbinder, I. Stanton
2010International Conference on Algorithmic Learning Theory19 citations
Semantic Scholar
Online Packing and Covering Framework with Convex Objectives
Niv Buchbinder, Shahar Chen, Anupam Gupta, V. Nagarajan +1 more
2014arXiv.org17 citations
Semantic Scholar
Dynamic Power Allocation Under Arbitrary Varying Channels - The Multi-User Case
Niv Buchbinder, L. Lewin-Eytan, I. Menache, J. Naor +1 more
20102010 Proceedings IEEE INFOCOM16 citations
Semantic Scholar
Extending the Extension: Deterministic Algorithm for Non-monotone Submodular Maximization
Niv Buchbinder, Moran Feldman
2024Symposium on the Theory of Computing14 citations Open access
Semantic Scholar
Incentive Compatible Mulit-Unit Combinatorial Auctions: A Primal Dual Approach
Niv Buchbinder, Rica Gonen
2015Algorithmica14 citations
Semantic Scholar