Niv Buchbinder

ORCID

Publication Activity (10 Years)

Years Active: 2001-2024
Publications (10 Years): 43

Top Venues

Publications

Niv Buchbinder, Anupam Gupta, Daniel Hathcock, Anna R. Karlin, Sherry Sarkar
Maintaining Matroid Intersections Online. SODA (2024)
Niv Buchbinder, Moran Feldman
Constrained Submodular Maximization via New Bounds for DR-Submodular Functions. STOC (2024)
Sayan Bhattacharya, Niv Buchbinder, Roie Levin, Thatchaphol Saranurak
Chasing Positive Bodies. CoRR (2023)
Niv Buchbinder, Moran Feldman
Constrained Submodular Maximization via New Bounds for DR-Submodular Functions. CoRR (2023)
Niv Buchbinder, Anupam Gupta, Daniel Hathcock, Anna R. Karlin, Sherry Sarkar
Maintaining Matroid Intersections Online. CoRR (2023)
Niv Buchbinder, Moran Feldman, Mohit Garg
Deterministic \(\boldsymbol{(\unicode{x00BD}+\varepsilon)}\) -Approximation for Submodular Maximization over a Matroid. SIAM J. Comput. 52 (4) (2023)
Niv Buchbinder, Christian Coester, Joseph Naor
Online k-taxi via Double Coverage and time-reverse primal-dual. Math. Program. 197 (2) (2023)
Niv Buchbinder, Joseph (Seffi) Naor, David Wajc
Lossless Online Rounding for Online Bipartite Matching (Despite its Impossibility). SODA (2023)
Sayan Bhattacharya, Niv Buchbinder, Roie Levin, Thatchaphol Saranurak
Chasing Positive Bodies. FOCS (2023)
Niv Buchbinder, Joseph Naor, David Wajc
A Randomness Threshold for Online Bipartite Matching, via Lossless Online Rounding. CoRR (2021)
Niv Buchbinder, Yaron Fairstein, Konstantina Mellou, Ishai Menache, Joseph (Seffi) Naor
Online Virtual Machine Allocation with Lifetime and Load Predictions. SIGMETRICS (Abstracts) (2021)
Niv Buchbinder, Roy Schwartz, Baruch Weizman
Simplex Transformations and the Multiway Cut Problem. Math. Oper. Res. 46 (2) (2021)
Sébastien Bubeck, Niv Buchbinder, Christian Coester, Mark Sellke
Metrical Service Systems with Transformations. ITCS (2021)
Niv Buchbinder, Christian Coester, Joseph (Seffi) Naor
Online k-Taxi via Double Coverage and Time-Reverse Primal-Dual. IPCO (2021)
Niv Buchbinder, Iftach Haitner, Nissan Levi, Eliad Tsfadia
Fair Coin Flipping: Tighter Analysis and the Many-Party Case. CoRR (2021)
Sébastien Bubeck, Niv Buchbinder, Christian Coester, Mark Sellke
Metrical Service Systems with Transformations. CoRR (2020)
Niv Buchbinder, Moran Feldman, Yuval Filmus, Mohit Garg
Online submodular maximization: beating 1/2 made simple. Math. Program. 183 (1) (2020)
Niv Buchbinder, Yaron Fairstein, Konstantina Mellou, Ishai Menache, Joseph Naor
Online Virtual Machine Allocation with Predictions. CoRR (2020)
Niv Buchbinder, Christian Coester, Joseph Naor
Online k-Taxi via Double Coverage and Time-Reverse Primal-Dual. CoRR (2020)
Niv Buchbinder, Anupam Gupta, Marco Molinaro, Joseph (Seffi) Naor
k-Servers with a Smile: Online Algorithms via Projections. SODA (2019)
Niv Buchbinder, Roy Schwartz, Baruch Weizman
A simple algorithm for the multiway cut problem. Oper. Res. Lett. 47 (6) (2019)
Niv Buchbinder, Moran Feldman
Constrained Submodular Maximization via a Nonsymmetric Technique. Math. Oper. Res. 44 (3) (2019)
Niv Buchbinder, Moran Feldman, Mohit Garg
Deterministic (½ + ε)-Approximation for Submodular Maximization over a Matroid. SODA (2019)
Niv Buchbinder, Moran Feldman, Roy Schwartz
Online Submodular Maximization with Preemption. ACM Trans. Algorithms 15 (3) (2019)
Niv Buchbinder, Moran Feldman, Yuval Filmus, Mohit Garg
Online Submodular Maximization: Beating 1/2 Made Simple. IPCO (2019)
Niv Buchbinder, Danny Segev, Yevgeny Tkach
Online Algorithms for Maximum Cardinality Matching with Edge Arrivals. Algorithmica 81 (5) (2019)
Niv Buchbinder, Moran Feldman
Deterministic Algorithms for Submodular Maximization Problems. ACM Trans. Algorithms 14 (3) (2018)
Niv Buchbinder, Joseph (Seffi) Naor, Roy Schwartz
Simplex Partitioning via Exponential Clocks and the Multiway-Cut Problem. SIAM J. Comput. 47 (4) (2018)
Niv Buchbinder, Moran Feldman, Mohit Garg
Deterministic (1/2 + ε)-Approximation for Submodular Maximization over a Matroid. CoRR (2018)
Niv Buchbinder, Moran Feldman, Mohit Garg
Online Submodular Maximization: Beating 1/2 Made Simple. CoRR (2018)
Niv Buchbinder, Anupam Gupta, Marco Molinaro, Joseph Naor
k-Servers with a Smile: Online Algorithms via Projections. CoRR (2018)
Niv Buchbinder, Iftach Haitner, Nissan Levi, Eliad Tsfadia
Fair Coin Flipping: Tighter Analysis and the Many-Party Case. SODA (2017)
Niv Buchbinder, Danny Segev, Yevgeny Tkach
Online Algorithms for Maximum Cardinality Matching with Edge Arrivals. ESA (2017)
Niv Buchbinder, Roy Schwartz, Baruch Weizman
Simplex Transformations and the Multiway Cut Problem. SODA (2017)
Niv Buchbinder, Moran Feldman, Joseph (Seffi) Naor, Ohad Talmon
(depth)-Competitive Algorithm for Online Multi-level Aggregation. SODA (2017)
Niv Buchbinder, Nikhil R. Devanur, Debmalya Panigrahi
Algorithms and Optimization under Uncertainty (NII Shonan Meeting 2017-5). NII Shonan Meet. Rep. 2017 (2017)
Niv Buchbinder, Moran Feldman, Joseph Naor, Ohad Talmon
O(depth)-Competitive Algorithm for Online Multi-level Aggregation. CoRR (2017)
Niv Buchbinder, Moran Feldman, Roy Schwartz
Comparing Apples and Oranges: Query Trade-off in Submodular Maximization. Math. Oper. Res. 42 (2) (2017)
Niv Buchbinder, Shahar Chen, Joseph Naor, Ohad Shamir
Unified Algorithms for Online Learning and Competitive Analysis. Math. Oper. Res. 41 (2) (2016)
Yossi Azar, Niv Buchbinder, T.-H. Hubert Chan, Shahar Chen, Ilan Reuven Cohen, Anupam Gupta, Zhiyi Huang, Ning Kang, Viswanath Nagarajan, Joseph Naor, Debmalya Panigrahi
Online Algorithms for Covering and Packing Problems with Convex Objectives. FOCS (2016)
Niv Buchbinder, Moran Feldman
Constrained Submodular Maximization via a Non-symmetric Technique. CoRR (2016)
Niv Buchbinder, Moran Feldman
Deterministic Algorithms for Submodular Maximization Problems. SODA (2016)
Yossi Azar, Niv Buchbinder, Kamal Jain
How to Allocate Goods in an Online Market? Algorithmica 74 (2) (2016)
Niv Buchbinder, Moran Feldman, Joseph Naor, Roy Schwartz
A Tight Linear Time (1/2)-Approximation for Unconstrained Submodular Maximization. SIAM J. Comput. 44 (5) (2015)
Niv Buchbinder, Moran Feldman, Roy Schwartz
Comparing Apples and Oranges: Query Tradeoff in Submodular Maximization. SODA (2015)
Niv Buchbinder, Moran Feldman
Deterministic Algorithms for Submodular Maximization Problems. CoRR (2015)
Niv Buchbinder, Moran Feldman, Roy Schwartz
Online Submodular Maximization with Preemption. SODA (2015)
Niv Buchbinder, Moran Feldman, Roy Schwartz
Online Submodular Maximization with Preemption. CoRR (2015)
Nikhil Bansal, Niv Buchbinder, Aleksander Madry, Joseph Naor
-Server Problem. J. ACM 62 (5) (2015)
Niv Buchbinder, Rica Gonen
Incentive Compatible Mulit-Unit Combinatorial Auctions: A Primal Dual Approach. Algorithmica 72 (1) (2015)
Niv Buchbinder, Moran Feldman, Arpita Ghosh, Joseph Naor
Frequency capping in online advertising. J. Sched. 17 (4) (2014)
Niv Buchbinder, Shahar Chen, Joseph Naor
Competitive Analysis via Regularization. SODA (2014)
Niv Buchbinder, Moran Feldman, Joseph Naor, Roy Schwartz
Submodular Maximization with Cardinality Constraints. SODA (2014)
Niv Buchbinder, Shahar Chen, Anupam Gupta, Viswanath Nagarajan, Joseph Naor
Online Packing and Covering Framework with Convex Objectives. CoRR (2014)
Niv Buchbinder, Moran Feldman, Roy Schwartz
Comparing Apples and Oranges: Query Tradeoff in Submodular Maximization. CoRR (2014)
Nikhil Bansal, Niv Buchbinder, Anupam Gupta, Joseph Naor
A Randomized O(log2 k)-Competitive Algorithm for Metric Bipartite Matching. Algorithmica 68 (2) (2014)
Niv Buchbinder, Shahar Chen, Joseph Naor
Competitive Algorithms for Restricted Caching and Matroid Caching. ESA (2014)
Niv Buchbinder, Kamal Jain, Mohit Singh
Secretary Problems via Linear Programming. Math. Oper. Res. 39 (1) (2014)
Niv Buchbinder, Tracy Kimbrel, Retsef Levi, Konstantin Makarychev, Maxim Sviridenko
Online Make-to-Order Joint Replenishment Model: Primal-Dual Competitive Algorithms. Oper. Res. 61 (4) (2013)
Niv Buchbinder, Joseph Naor
Fair online load balancing. J. Sched. 16 (1) (2013)
Niv Buchbinder, Joseph Naor, Roy Schwartz
Simplex partitioning via exponential clocks and the multiway cut problem. STOC (2013)
Niv Buchbinder, Moran Feldman, Joseph Naor, Roy Schwartz
A Tight Linear Time (1/2)-Approximation for Unconstrained Submodular Maximization. FOCS (2012)
Niv Buchbinder, Joseph Naor, R. Ravi, Mohit Singh
Approximation Algorithms for Online Weighted Rank Function Maximization under Matroid Constraints. ICALP (1) (2012)
Nikhil Bansal, Niv Buchbinder, Joseph Naor
A Primal-Dual Randomized Algorithm for Weighted Paging. J. ACM 59 (4) (2012)
Niv Buchbinder, Joseph Naor, R. Ravi, Mohit Singh
Approximation Algorithms for Online Weighted Rank Function Maximization under Matroid Constraints CoRR (2012)
Nikhil Bansal, Niv Buchbinder, Joseph Naor
Randomized Competitive Algorithms for Generalized Caching. SIAM J. Comput. 41 (2) (2012)
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) (2012)
Niv Buchbinder, Shahar Chen, Joseph Naor, Ohad Shamir
Unified Algorithms for Online Learning and Competitive Analysis. COLT (2012)
Niv Buchbinder, Navendu Jain, Ishai Menache
Online Job-Migration for Reducing the Electricity Bill in the Cloud. Networking (1) (2011)
Niv Buchbinder, Moran Feldman, Arpita Ghosh, Joseph Naor
Frequency Capping in Online Advertising. WADS (2011)
Nikhil Bansal, Niv Buchbinder, Aleksander Madry, Joseph Naor
A Polylogarithmic-Competitive Algorithm for the k-Server Problem CoRR (2011)
Nikhil Bansal, Niv Buchbinder, Aleksander Madry, Joseph Naor
A Polylogarithmic-Competitive Algorithm for the k-Server Problem. FOCS (2011)
Jacob D. Abernethy, Peter L. Bartlett, Niv Buchbinder, Isabelle Stanton
A Regularization Approach to Metrical Task Systems. ALT (2010)
Niv Buchbinder, Kamal Jain, Mohit Singh
Incentives in Online Auctions via Linear Programming. WINE (2010)
Yossi Azar, Niv Buchbinder, Kamal Jain
How to Allocate Goods in an Online Market? ESA (2) (2010)
Niv Buchbinder, Liane Lewin-Eytan, Joseph Naor, Ariel Orda
Non-Cooperative Cost Sharing Games via Subsidies. Theory Comput. Syst. 47 (1) (2010)
Nikhil Bansal, Niv Buchbinder, Joseph Naor
Towards the Randomized k-Server Conjecture: A Primal-Dual Approach. SODA (2010)
Niv Buchbinder, Kamal Jain, Mohit Singh
Secretary Problems via Linear Programming. IPCO (2010)
Niv Buchbinder, Liane Lewin-Eytan, Ishai Menache, Joseph Naor, Ariel Orda
Dynamic Power Allocation Under Arbitrary Varying Channels - The Multi-User Case. INFOCOM (2010)
Nikhil Bansal, Niv Buchbinder, Joseph Naor
-Server Problem on HSTs. ICALP (1) (2010)
Niv Buchbinder, Joseph Naor
The Design of Competitive Online Algorithms via a Primal-Dual Approach. Found. Trends Theor. Comput. Sci. 3 (2-3) (2009)
Noga Alon, Baruch Awerbuch, Yossi Azar, Niv Buchbinder, Joseph Naor
The Online Set Cover Problem. SIAM J. Comput. 39 (2) (2009)
Niv Buchbinder, Joseph Naor
Online Primal-Dual Algorithms for Covering and Packing. Math. Oper. Res. 34 (2) (2009)
Niv Buchbinder, Kamal Jain, Mohit Singh
Secretary problems and incentives via linear programming. SIGecom Exch. 8 (2) (2009)
Niv Buchbinder, Liane Lewin-Eytan, Ishai Menache, Joseph Naor, Ariel Orda
Dynamic Power Allocation Under Arbitrary Varying Channels - An Online Approach. INFOCOM (2009)
Niv Buchbinder, Liane Lewin-Eytan, Joseph Naor, Ariel Orda
Non-cooperative Cost Sharing Games Via Subsidies. SAGT (2008)
Niv Buchbinder, Tracy Kimbrel, Retsef Levi, Konstantin Makarychev, Maxim Sviridenko
Online make-to-order joint replenishment model: primal dual competitive algorithms. SODA (2008)
Nikhil Bansal, Niv Buchbinder, Joseph Naor
Randomized competitive algorithms for generalized caching. STOC (2008)
Niv Buchbinder, Kamal Jain, Joseph Naor
Online Primal-Dual Algorithms for Maximizing Ad-Auctions Revenue. ESA (2007)
Nikhil Bansal, Niv Buchbinder, Joseph Naor
A Primal-Dual Randomized Algorithm for Weighted Paging. FOCS (2007)
Nikhil Bansal, Niv Buchbinder, Anupam Gupta, Joseph Naor
)-Competitive Algorithm for Metric Bipartite Matching. ESA (2007)
Niv Buchbinder, Joseph Naor
Fair online load balancing. SPAA (2006)
Niv Buchbinder, Joseph Naor
Improved Bounds for Online Routing and Packing Via a Primal-Dual Approach. FOCS (2006)
Niv Buchbinder, Erez Petrank
Lower and upper bounds on obtaining history independence. Inf. Comput. 204 (2) (2006)
Noga Alon, Baruch Awerbuch, Yossi Azar, Niv Buchbinder, Joseph Naor
A general approach to online network optimization problems. ACM Trans. Algorithms 2 (4) (2006)
Niv Buchbinder, Joseph Naor
Online Primal-Dual Algorithms for Covering and Packing Problems. ESA (2005)
Noga Alon, Baruch Awerbuch, Yossi Azar, Niv Buchbinder, Joseph Naor
A general approach to online network optimization problems. SODA (2004)
Niv Buchbinder, Erez Petrank
Lower and Upper Bounds on Obtaining History Independence. CRYPTO (2003)
Noga Alon, Baruch Awerbuch, Yossi Azar, Niv Buchbinder, Joseph Naor
The online set cover problem. STOC (2003)
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)

Niv Buchbinder.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Niv Buchbinder