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 (Java Virtual Machine Research and Technology Symposium, 2001)

Online Primal-Dual Algorithms for Covering and Packing Problems. - Niv Buchbinder; Joseph Naor (ESA, 2005)

Improved Bounds for Online Routing and Packing Via a Primal-Dual Approach. - Niv Buchbinder; Joseph Naor (FOCS, 2006)

Lower and upper bounds on obtaining history independence. - Niv Buchbinder; Erez Petrank (Inf. Comput., 2006)

A general approach to online network optimization problems. - Noga Alon; Baruch Awerbuch; Yossi Azar; Niv Buchbinder; Joseph Naor (ACM Trans. Algorithms, 2006)

An O (log2 k )-Competitive Algorithm for Metric Bipartite Matching. - Nikhil Bansal 001; Niv Buchbinder; Anupam Gupta 001; Joseph Naor (ESA, 2007)

Online Primal-Dual Algorithms for Maximizing Ad-Auctions Revenue. - Niv Buchbinder; Kamal Jain; Joseph Naor (ESA, 2007)

Designing competitive online algorithms via a primal-dual approach. - Niv Buchbinder (2008)

The Design of Competitive Online Algorithms via a Primal-Dual Approach. - Niv Buchbinder; Joseph Naor (Found. Trends Theor. Comput. Sci., 2009)

Online Primal-Dual Algorithms for Covering and Packing. - Niv Buchbinder; Joseph Naor (Math. Oper. Res., 2009)

The Online Set Cover Problem. - Noga Alon; Baruch Awerbuch; Yossi Azar; Niv Buchbinder; Joseph Naor (SIAM J. Comput., 2009)

Secretary problems and incentives via linear programming. - Niv Buchbinder; Kamal Jain; Mohit Singh (SIGecom Exch., 2009)

A Regularization Approach to Metrical Task Systems. - Jacob D. Abernethy; Peter L. Bartlett; Niv Buchbinder; Isabelle Stanton (ALT, 2010)

Metrical Task Systems and the k-Server Problem on HSTs. - Nikhil Bansal 001; Niv Buchbinder; Joseph Naor (ICALP (1), 2010)

Dynamic Power Allocation Under Arbitrary Varying Channels - The Multi-User Case. - Niv Buchbinder; Liane Lewin-Eytan; Ishai Menache; Joseph Naor; Ariel Orda (INFOCOM, 2010)

Towards the Randomized k-Server Conjecture: A Primal-Dual Approach. - Nikhil Bansal 001; Niv Buchbinder; Joseph Naor (SODA, 2010)

Incentives in Online Auctions via Linear Programming. - Niv Buchbinder; Kamal Jain; Mohit Singh (WINE, 2010)

Non-Cooperative Cost Sharing Games via Subsidies. - Niv Buchbinder; Liane Lewin-Eytan; Joseph Naor; Ariel Orda (Theory Comput. Syst., 2010)

A Polylogarithmic-Competitive Algorithm for the k-Server Problem. - Nikhil Bansal 001; Niv Buchbinder; Aleksander Madry; Joseph Naor (FOCS, 2011)

Online Job-Migration for Reducing the Electricity Bill in the Cloud. - Niv Buchbinder; Navendu Jain; Ishai Menache (Networking (1), 2011)

Approximation Algorithms for Online Weighted Rank Function Maximization under Matroid Constraints. - Niv Buchbinder; Joseph Naor; R. Ravi 001; Mohit Singh (ICALP (1), 2012)

A Primal-Dual Randomized Algorithm for Weighted Paging. - Nikhil Bansal 001; Niv Buchbinder; Joseph Naor (J. ACM, 2012)

Randomized Competitive Algorithms for Generalized Caching. - Nikhil Bansal 001; Niv Buchbinder; Joseph Naor (SIAM J. Comput., 2012)

Dynamic Power Allocation Under Arbitrary Varying Channels - An Online Approach. - Niv Buchbinder; Liane Lewin-Eytan; Ishai Menache; Joseph Naor; Ariel Orda (IEEE/ACM Trans. Netw., 2012)

Online Make-to-Order Joint Replenishment Model: Primal-Dual Competitive Algorithms. - Niv Buchbinder; Tracy Kimbrel; Retsef Levi; Konstantin Makarychev; Maxim Sviridenko (Oper. Res., 2013)

Fair online load balancing. - Niv Buchbinder; Joseph Naor (J. Sched., 2013)

Competitive Algorithms for Restricted Caching and Matroid Caching. - Niv Buchbinder; Shahar Chen; Joseph Naor (ESA, 2014)

Competitive Analysis via Regularization. - Niv Buchbinder; Shahar Chen; Joseph Naor (SODA, 2014)

Submodular Maximization with Cardinality Constraints. - Niv Buchbinder; Moran Feldman; Joseph Naor; Roy Schwartz 002 (SODA, 2014)

A Randomized O(log2 k)-Competitive Algorithm for Metric Bipartite Matching. - Nikhil Bansal 001; Niv Buchbinder; Anupam Gupta 001; Joseph Naor (Algorithmica, 2014)

Online Packing and Covering Framework with Convex Objectives. - Niv Buchbinder; Shahar Chen; Anupam Gupta 001; Viswanath Nagarajan; Joseph Naor (CoRR, 2014)

Secretary Problems via Linear Programming. - Niv Buchbinder; Kamal Jain; Mohit Singh (Math. Oper. Res., 2014)

Frequency capping in online advertising. - Niv Buchbinder; Moran Feldman; Arpita Ghosh; Joseph Naor (J. Sched., 2014)

Comparing Apples and Oranges: Query Tradeoff in Submodular Maximization. - Niv Buchbinder; Moran Feldman; Roy Schwartz 002 (SODA, 2015)

Incentive Compatible Mulit-Unit Combinatorial Auctions: A Primal Dual Approach. - Niv Buchbinder; Rica Gonen (Algorithmica, 2015)

A Polylogarithmic-Competitive Algorithm for the k-Server Problem. - Nikhil Bansal 001; Niv Buchbinder; Aleksander Madry; Joseph Naor (J. ACM, 2015)

A Tight Linear Time (1/2)-Approximation for Unconstrained Submodular Maximization. - Niv Buchbinder; Moran Feldman; Joseph Naor; Roy Schwartz 002 (SIAM J. Comput., 2015)

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 001; Zhiyi Huang 002; Ning Kang 001; Viswanath Nagarajan; Joseph Naor; Debmalya Panigrahi (FOCS, 2016)

How to Allocate Goods in an Online Market? - Yossi Azar; Niv Buchbinder; Kamal Jain (Algorithmica, 2016)

Constrained Submodular Maximization via a Non-symmetric Technique. - Niv Buchbinder; Moran Feldman (CoRR, 2016)

Unified Algorithms for Online Learning and Competitive Analysis. - Niv Buchbinder; Shahar Chen; Joseph Naor; Ohad Shamir (Math. Oper. Res., 2016)

O(depth)-Competitive Algorithm for Online Multi-level Aggregation. - Niv Buchbinder; Moran Feldman; Joseph (Seffi) Naor; Ohad Talmon (SODA, 2017)

Fair Coin Flipping: Tighter Analysis and the Many-Party Case. - Niv Buchbinder; Iftach Haitner; Nissan Levi; Eliad Tsfadia (SODA, 2017)

O(depth)-Competitive Algorithm for Online Multi-level Aggregation. - Niv Buchbinder; Moran Feldman; Joseph Naor; Ohad Talmon (CoRR, 2017)

Comparing Apples and Oranges: Query Trade-off in Submodular Maximization. - Niv Buchbinder; Moran Feldman; Roy Schwartz 002 (Math. Oper. Res., 2017)

Algorithms and Optimization under Uncertainty (NII Shonan Meeting 2017-5). - Niv Buchbinder; Nikhil R. Devanur; Debmalya Panigrahi (NII Shonan Meet. Rep., 2017)

Submodular Functions Maximization Problems. - Niv Buchbinder; Moran Feldman (Handbook of Approximation Algorithms and Metaheuristics (1), 2018)

Online Submodular Maximization: Beating 1/2 Made Simple. - Niv Buchbinder; Moran Feldman; Mohit Garg 003 (CoRR, 2018)

Simplex Partitioning via Exponential Clocks and the Multiway-Cut Problem. - Niv Buchbinder; Joseph (Seffi) Naor; Roy Schwartz 002 (SIAM J. Comput., 2018)

Deterministic Algorithms for Submodular Maximization Problems. - Niv Buchbinder; Moran Feldman (ACM Trans. Algorithms, 2018)

Deterministic (½ + ε)-Approximation for Submodular Maximization over a Matroid. - Niv Buchbinder; Moran Feldman; Mohit Garg 003 (SODA, 2019)

k-Servers with a Smile: Online Algorithms via Projections. - Niv Buchbinder; Anupam Gupta 001; Marco Molinaro 001; Joseph (Seffi) Naor (SODA, 2019)

Online Algorithms for Maximum Cardinality Matching with Edge Arrivals. - Niv Buchbinder; Danny Segev; Yevgeny Tkach (Algorithmica, 2019)

Constrained Submodular Maximization via a Nonsymmetric Technique. - Niv Buchbinder; Moran Feldman (Math. Oper. Res., 2019)

A simple algorithm for the multiway cut problem. - Niv Buchbinder; Roy Schwartz 002; Baruch Weizman (Oper. Res. Lett., 2019)

Online Submodular Maximization with Preemption. - Niv Buchbinder; Moran Feldman; Roy Schwartz 002 (ACM Trans. Algorithms, 2019)

Online Virtual Machine Allocation with Predictions. - Niv Buchbinder; Yaron Fairstein; Konstantina Mellou; Ishai Menache; Joseph Naor (CoRR, 2020)

Online submodular maximization: beating 1/2 made simple. - Niv Buchbinder; Moran Feldman; Yuval Filmus; Mohit Garg 003 (Math. Program., 2020)

Metrical Service Systems with Transformations. - Sébastien Bubeck; Niv Buchbinder; Christian Coester; Mark Sellke (ITCS, 2021)

Online Virtual Machine Allocation with Lifetime and Load Predictions. - Niv Buchbinder; Yaron Fairstein; Konstantina Mellou; Ishai Menache; Joseph (Seffi) Naor (SIGMETRICS (Abstracts), 2021)

A Randomness Threshold for Online Bipartite Matching, via Lossless Online Rounding. - Niv Buchbinder; Joseph Naor; David Wajc (CoRR, 2021)

Simplex Transformations and the Multiway Cut Problem. - Niv Buchbinder; Roy Schwartz 002; Baruch Weizman (Math. Oper. Res., 2021)

Chasing Positive Bodies. - Sayan Bhattacharya; Niv Buchbinder; Roie Levin; Thatchaphol Saranurak (FOCS, 2023)

Lossless Online Rounding for Online Bipartite Matching (Despite its Impossibility). - Niv Buchbinder; Joseph (Seffi) Naor; David Wajc (SODA, 2023)

Online k-taxi via Double Coverage and time-reverse primal-dual. - Niv Buchbinder; Christian Coester; Joseph Naor (Math. Program., 2023)

Deterministic (1/2 + ε)-Approximation for Submodular Maximization over a Matroid. - Niv Buchbinder; Moran Feldman; Mohit Garg 003 (SIAM J. Comput., 2023)

Deterministic Algorithm and Faster Algorithm for Submodular Maximization Subject to a Matroid Constraint. - Niv Buchbinder; Moran Feldman (FOCS, 2024)

Maintaining Matroid Intersections Online. - Niv Buchbinder; Anupam Gupta 001; Daniel Hathcock; Anna R. Karlin; Sherry Sarkar (SODA, 2024)

Constrained Submodular Maximization via New Bounds for DR-Submodular Functions. - Niv Buchbinder; Moran Feldman (STOC, 2024)

Brief Announcement: Load Balancing with Duration Predictions. - Yossi Azar; Niv Buchbinder; Tomer Epshtein (SPAA, 2025)

Extending the Extension: Deterministic Algorithm for Non-monotone Submodular Maximization. - Niv Buchbinder; Moran Feldman (STOC, 2025)

Competitive Bundle Trading. - Yossi Azar; Niv Buchbinder; Roie Levin; Or Vardi (CoRR, 2025)

Competitively Consistent Clustering. - Niv Buchbinder; Roie Levin; Yue Yang (CoRR, 2025)