Niv Buchbinder

According to our database, Niv Buchbinder authored at least 74 papers between 2001 and 2025.

Collaborative distances:

• Dijkstra number of three.
• Erdős number of two.

2025

Trading Prophets with Initial Capital.

Yossi Azar, Niv Buchbinder, Roie Levin, Or Vardi

CoRR, October, 2025

Competitively Consistent Clustering.

Niv Buchbinder, Roie Levin, Yue Yang

CoRR, August, 2025

Competitive Bundle Trading.

Yossi Azar, Niv Buchbinder, Roie Levin, Or Vardi

CoRR, July, 2025

Extending the Extension: Deterministic Algorithm for Non-monotone Submodular Maximization.

Niv Buchbinder, Moran Feldman

Proceedings of the 57th Annual ACM Symposium on Theory of Computing, 2025

Brief Announcement: Load Balancing with Duration Predictions.

Yossi Azar, Niv Buchbinder, Tomer Epshtein

Proceedings of the 37th ACM Symposium on Parallelism in Algorithms and Architectures, 2025

2024

Constrained Submodular Maximization via New Bounds for DR-Submodular Functions.

Niv Buchbinder, Moran Feldman

Proceedings of the 56th Annual ACM Symposium on Theory of Computing, 2024

Maintaining Matroid Intersections Online.

Niv Buchbinder, Anupam Gupta, Daniel Hathcock, Anna R. Karlin, Sherry Sarkar

Proceedings of the 2024 ACM-SIAM Symposium on Discrete Algorithms, 2024

Deterministic Algorithm and Faster Algorithm for Submodular Maximization Subject to a Matroid Constraint.

Niv Buchbinder, Moran Feldman

Proceedings of the 65th IEEE Annual Symposium on Foundations of Computer Science, 2024

2023

Deterministic (1/2 + ε)-Approximation for Submodular Maximization over a Matroid.

Niv Buchbinder, Moran Feldman, Mohit Garg

SIAM J. Comput., August, 2023

Lossless Online Rounding for Online Bipartite Matching (Despite its Impossibility).

Niv Buchbinder, Joseph (Seffi) Naor, David Wajc

Proceedings of the 2023 ACM-SIAM Symposium on Discrete Algorithms, 2023

Chasing Positive Bodies.

Sayan Bhattacharya, Niv Buchbinder, Roie Levin, Thatchaphol Saranurak

Proceedings of the 64th IEEE Annual Symposium on Foundations of Computer Science, 2023

2021

A Randomness Threshold for Online Bipartite Matching, via Lossless Online Rounding.

Niv Buchbinder, Joseph Naor, David Wajc

CoRR, 2021

Online Virtual Machine Allocation with Lifetime and Load Predictions.

Niv Buchbinder, Yaron Fairstein, Konstantina Mellou, Ishai Menache, Joseph (Seffi) Naor

Proceedings of the SIGMETRICS '21: ACM SIGMETRICS / International Conference on Measurement and Modeling of Computer Systems, 2021

Online k-Taxi via Double Coverage and Time-Reverse Primal-Dual.

Niv Buchbinder, Christian Coester, Joseph (Seffi) Naor

Proceedings of the Integer Programming and Combinatorial Optimization, 2021

Metrical Service Systems with Transformations.

Sébastien Bubeck, Niv Buchbinder, Christian Coester, Mark Sellke

Proceedings of the 12th Innovations in Theoretical Computer Science Conference, 2021

2020

Online Virtual Machine Allocation with Predictions.

Niv Buchbinder, Yaron Fairstein, Konstantina Mellou, Ishai Menache, Joseph Naor

CoRR, 2020

2019

A simple algorithm for the multiway cut problem.

Niv Buchbinder, Roy Schwartz, Baruch Weizman

Oper. Res. Lett., 2019

Constrained Submodular Maximization via a Nonsymmetric Technique.

Niv Buchbinder, Moran Feldman

Math. Oper. Res., 2019

k-Servers with a Smile: Online Algorithms via Projections.

Niv Buchbinder, Anupam Gupta, Marco Molinaro, Joseph (Seffi) Naor

Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms, 2019

Deterministic (½ + ε)-Approximation for Submodular Maximization over a Matroid.

Niv Buchbinder, Moran Feldman, Mohit Garg

Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms, 2019

Online Submodular Maximization: Beating 1/2 Made Simple.

Niv Buchbinder, Moran Feldman, Yuval Filmus, Mohit Garg

Proceedings of the Integer Programming and Combinatorial Optimization, 2019

2018

Online Submodular Maximization: Beating 1/2 Made Simple.

Niv Buchbinder, Moran Feldman, Mohit Garg

CoRR, 2018

Submodular Functions Maximization Problems.

Niv Buchbinder, Moran Feldman

Proceedings of the Handbook of Approximation Algorithms and Metaheuristics, 2018

2017

Algorithms and Optimization under Uncertainty (NII Shonan Meeting 2017-5).

Niv Buchbinder, Nikhil R. Devanur, Debmalya Panigrahi

NII Shonan Meet. Rep., 2017

Comparing Apples and Oranges: Query Trade-off in Submodular Maximization.

Niv Buchbinder, Moran Feldman, Roy Schwartz

Math. Oper. Res., 2017

O(depth)-Competitive Algorithm for Online Multi-level Aggregation.

Niv Buchbinder, Moran Feldman, Joseph Naor, Ohad Talmon

CoRR, 2017

Simplex Transformations and the Multiway Cut Problem.

Niv Buchbinder, Roy Schwartz, Baruch Weizman

Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, 2017

Fair Coin Flipping: Tighter Analysis and the Many-Party Case.

Niv Buchbinder, Iftach Haitner, Nissan Levi, Eliad Tsfadia

Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, 2017

<i>O</i>(depth)-Competitive Algorithm for Online Multi-level Aggregation.

Niv Buchbinder, Moran Feldman, Joseph (Seffi) Naor, Ohad Talmon

Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, 2017

Online Algorithms for Maximum Cardinality Matching with Edge Arrivals.

Niv Buchbinder, Danny Segev, Yevgeny Tkach

Proceedings of the 25th Annual European Symposium on Algorithms, 2017

2016

Constrained Submodular Maximization via a Non-symmetric Technique.

Niv Buchbinder, Moran Feldman

CoRR, 2016

Deterministic Algorithms for Submodular Maximization Problems.

Niv Buchbinder, Moran Feldman

Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, 2016

Online Algorithms for Covering and Packing Problems with Convex Objectives.

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

Proceedings of the IEEE 57th Annual Symposium on Foundations of Computer Science, 2016

2015

A Polylogarithmic-Competitive Algorithm for the <i>k</i>-Server Problem.

Nikhil Bansal, Niv Buchbinder, Aleksander Madry, Joseph Naor

J. ACM, 2015

Incentive Compatible Mulit-Unit Combinatorial Auctions: A Primal Dual Approach.

Niv Buchbinder, Rica Gonen

Algorithmica, 2015

Online Submodular Maximization with Preemption.

Niv Buchbinder, Moran Feldman, Roy Schwartz

Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, 2015

Comparing Apples and Oranges: Query Tradeoff in Submodular Maximization.

Niv Buchbinder, Moran Feldman, Roy Schwartz

Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, 2015

2014

Online Packing and Covering Framework with Convex Objectives.

Niv Buchbinder, Shahar Chen, Anupam Gupta, Viswanath Nagarajan, Joseph Naor

CoRR, 2014

A Randomized O(log2 k)-Competitive Algorithm for Metric Bipartite Matching.

Nikhil Bansal, Niv Buchbinder, Anupam Gupta, Joseph Naor

Algorithmica, 2014

Submodular Maximization with Cardinality Constraints.

Niv Buchbinder, Moran Feldman, Joseph Naor, Roy Schwartz

Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms, 2014

Competitive Analysis via Regularization.

Niv Buchbinder, Shahar Chen, Joseph Naor

Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms, 2014

Competitive Algorithms for Restricted Caching and Matroid Caching.

Niv Buchbinder, Shahar Chen, Joseph Naor

Proceedings of the Algorithms - ESA 2014, 2014

2013

Simplex partitioning via exponential clocks and the multiway cut problem.

Niv Buchbinder, Joseph Naor, Roy Schwartz

Proceedings of the Symposium on Theory of Computing Conference, 2013

2012

Unified Algorithms for Online Learning and Competitive Analysis.

Niv Buchbinder, Shahar Chen, Joseph Naor, Ohad Shamir

Proceedings of the COLT 2012, 2012

Approximation Algorithms for Online Weighted Rank Function Maximization under Matroid Constraints.

Niv Buchbinder, Joseph Naor, R. Ravi, Mohit Singh

Proceedings of the Automata, Languages, and Programming - 39th International Colloquium, 2012

A Tight Linear Time (1/2)-Approximation for Unconstrained Submodular Maximization.

Niv Buchbinder, Moran Feldman, Joseph Naor, Roy Schwartz

Proceedings of the 53rd Annual IEEE Symposium on Foundations of Computer Science, 2012

2011

Frequency Capping in Online Advertising.

Niv Buchbinder, Moran Feldman, Arpita Ghosh, Joseph Naor

Proceedings of the Algorithms and Data Structures - 12th International Symposium, 2011

Online Job-Migration for Reducing the Electricity Bill in the Cloud.

Niv Buchbinder, Navendu Jain, Ishai Menache

Proceedings of the NETWORKING 2011, 2011

A Polylogarithmic-Competitive Algorithm for the k-Server Problem.

Nikhil Bansal, Niv Buchbinder, Aleksander Madry, Joseph Naor

Proceedings of the IEEE 52nd Annual Symposium on Foundations of Computer Science, 2011

2010

Incentives in Online Auctions via Linear Programming.

Niv Buchbinder, Kamal Jain, Mohit Singh

Proceedings of the Internet and Network Economics - 6th International Workshop, 2010

Towards the Randomized k-Server Conjecture: A Primal-Dual Approach.

Nikhil Bansal, Niv Buchbinder, Joseph Naor

Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete Algorithms, 2010

Secretary Problems via Linear Programming.

Niv Buchbinder, Kamal Jain, Mohit Singh

Proceedings of the Integer Programming and Combinatorial Optimization, 2010

Dynamic Power Allocation Under Arbitrary Varying Channels - The Multi-User Case.

Niv Buchbinder, Liane Lewin-Eytan, Ishai Menache, Joseph Naor, Ariel Orda

Proceedings of the INFOCOM 2010. 29th IEEE International Conference on Computer Communications, 2010

Metrical Task Systems and the <i>k</i>-Server Problem on HSTs.

Nikhil Bansal, Niv Buchbinder, Joseph Naor

Proceedings of the Automata, Languages and Programming, 37th International Colloquium, 2010

How to Allocate Goods in an Online Market?

Yossi Azar, Niv Buchbinder, Kamal Jain

Proceedings of the Algorithms, 2010

A Regularization Approach to Metrical Task Systems.

Jacob D. Abernethy, Peter L. Bartlett, Niv Buchbinder, Isabelle Stanton

Proceedings of the Algorithmic Learning Theory, 21st International Conference, 2010

2009

Secretary problems and incentives via linear programming.

Niv Buchbinder, Kamal Jain, Mohit Singh

SIGecom Exch., 2009

Online Primal-Dual Algorithms for Covering and Packing.

Niv Buchbinder, Joseph Naor

Math. Oper. Res., 2009

The Design of Competitive Online Algorithms via a Primal-Dual Approach.

Niv Buchbinder, Joseph Naor

Found. Trends Theor. Comput. Sci., 2009

Dynamic Power Allocation Under Arbitrary Varying Channels - An Online Approach.

Niv Buchbinder, Liane Lewin-Eytan, Ishai Menache, Joseph Naor, Ariel Orda

Proceedings of the INFOCOM 2009. 28th IEEE International Conference on Computer Communications, 2009

2008

Designing competitive online algorithms via a primal-dual approach.

Niv Buchbinder

PhD thesis, 2008

Randomized competitive algorithms for generalized caching.

Nikhil Bansal, Niv Buchbinder, Joseph Naor

Proceedings of the 40th Annual ACM Symposium on Theory of Computing, 2008

Online make-to-order joint replenishment model: primal dual competitive algorithms.

Niv Buchbinder, Tracy Kimbrel, Retsef Levi, Konstantin Makarychev, Maxim Sviridenko

Proceedings of the Nineteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2008

Non-cooperative Cost Sharing Games Via Subsidies.

Niv Buchbinder, Liane Lewin-Eytan, Joseph Naor, Ariel Orda

Proceedings of the Algorithmic Game Theory, First International Symposium, 2008

2007

A Primal-Dual Randomized Algorithm for Weighted Paging.

Nikhil Bansal, Niv Buchbinder, Joseph Naor

Proceedings of the 48th Annual IEEE Symposium on Foundations of Computer Science, 2007

Online Primal-Dual Algorithms for Maximizing Ad-Auctions Revenue.

Niv Buchbinder, Kamal Jain, Joseph Naor

Proceedings of the Algorithms, 2007

An <i>O</i> (log² <i>k</i> )-Competitive Algorithm for Metric Bipartite Matching.

Nikhil Bansal, Niv Buchbinder, Anupam Gupta, Joseph Naor

Proceedings of the Algorithms, 2007

2006

Fair online load balancing.

Niv Buchbinder, Joseph Naor

Proceedings of the SPAA 2006: Proceedings of the 18th Annual ACM Symposium on Parallelism in Algorithms and Architectures, Cambridge, Massachusetts, USA, July 30, 2006

Improved Bounds for Online Routing and Packing Via a Primal-Dual Approach.

Niv Buchbinder, Joseph Naor

Proceedings of the 47th Annual IEEE Symposium on Foundations of Computer Science, 2006

2005

Online Primal-Dual Algorithms for Covering and Packing Problems.

Niv Buchbinder, Joseph Naor

Proceedings of the Algorithms, 2005

2004

A general approach to online network optimization problems.

Noga Alon, Baruch Awerbuch, Yossi Azar, Niv Buchbinder, Joseph Naor

Proceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2004

2003

The online set cover problem.

Noga Alon, Baruch Awerbuch, Yossi Azar, Niv Buchbinder, Joseph Naor

Proceedings of the 35th Annual ACM Symposium on Theory of Computing, 2003

Lower and Upper Bounds on Obtaining History Independence.

Niv Buchbinder, Erez Petrank

Proceedings of the Advances in Cryptology, 2003

2001

Mostly Accurate Stack Scanning.

Katherine Barabash, Niv Buchbinder, Tamar Domani, Elliot K. Kolodner, Yoav Ossia, Shlomit S. Pinter, Janice C. Shepherd, Ron Sivan, Victor Umansky

Proceedings of the 1st Java Virtual Machine Research and Technology Symposium, 2001