Niv Buchbinder

115 papers A* 32A 6B 9Journal 59Unranked 7

Year	Rank	Type	Title / Venue / Authors
2026	J	`jnl`	Fair Coin Flipping: Tighter Analysis and the Many-Party Case. J. Cryptol. Niv Buchbinder, Iftach Haitner, Nissan Levi, Eliad Tsfadia
2026	—	`conf`	Trading Prophets with Initial Capital. SOSA Yossi Azar, Niv Buchbinder, Roie Levin, Or Vardi
2025	B	`conf`	Brief Announcement: Load Balancing with Duration Predictions. SPAA Yossi Azar, Niv Buchbinder, Tomer Epshtein
2025	J	`jnl`	Chasing Submodular Objectives, and Submodular Maximization via Cutting Planes. CoRR Niv Buchbinder, Joseph Naor, David Wajc
2025	J	`jnl`	Competitive Bundle Trading. CoRR Yossi Azar, Niv Buchbinder, Roie Levin, Or Vardi
2025	A*	`conf`	Competitively Consistent Clustering. ICML Niv Buchbinder, Roie Levin, Yue Yang
2025	J	`jnl`	Competitively Consistent Clustering. CoRR Niv Buchbinder, Roie Levin, Yue Yang
2025	A*	`conf`	Extending the Extension: Deterministic Algorithm for Non-monotone Submodular Maximization. STOC Niv Buchbinder, Moran Feldman
2025	J	`jnl`	Load Balancing with Duration Predictions. CoRR Yossi Azar, Niv Buchbinder, Tomer Epshtein
2025	J	`jnl`	Trading Prophets with Initial Capital. CoRR Yossi Azar, Niv Buchbinder, Roie Levin, Or Vardi
2024	A*	`conf`	Constrained Submodular Maximization via New Bounds for DR-Submodular Functions. STOC Niv Buchbinder, Moran Feldman
2024	A*	`conf`	Deterministic Algorithm and Faster Algorithm for Submodular Maximization Subject to a Matroid Constraint. FOCS Niv Buchbinder, Moran Feldman
2024	J	`jnl`	Deterministic Algorithm and Faster Algorithm for Submodular Maximization subject to a Matroid Constraint. CoRR Niv Buchbinder, Moran Feldman
2024	J	`jnl`	Extending the Extension: Deterministic Algorithm for Non-monotone Submodular Maximization. CoRR Niv Buchbinder, Moran Feldman
2024	A*	`conf`	Maintaining Matroid Intersections Online. SODA Niv Buchbinder, Anupam Gupta, Daniel Hathcock, Anna R. Karlin, Sherry Sarkar
2023	A*	`conf`	Chasing Positive Bodies. FOCS Sayan Bhattacharya, Niv Buchbinder, Roie Levin, Thatchaphol Saranurak
2023	J	`jnl`	Chasing Positive Bodies. CoRR Sayan Bhattacharya, Niv Buchbinder, Roie Levin, Thatchaphol Saranurak
2023	J	`jnl`	Constrained Submodular Maximization via New Bounds for DR-Submodular Functions. CoRR Niv Buchbinder, Moran Feldman
2023	J	`jnl`	Deterministic (1/2 + ε)-Approximation for Submodular Maximization over a Matroid. SIAM J. Comput. Niv Buchbinder, Moran Feldman, Mohit Garg
2023	A*	`conf`	Lossless Online Rounding for Online Bipartite Matching (Despite its Impossibility). SODA Niv Buchbinder, Joseph (Seffi) Naor, David Wajc
2023	J	`jnl`	Maintaining Matroid Intersections Online. CoRR Niv Buchbinder, Anupam Gupta, Daniel Hathcock, Anna R. Karlin, Sherry Sarkar
2023	J	`jnl`	Online k-taxi via Double Coverage and time-reverse primal-dual. Math. Program. Niv Buchbinder, Christian Coester, Joseph Naor
2022	A*	`ed.`	Proceedings of the 2022 ACM-SIAM Symposium on Discrete Algorithms, SODA 2022, Virtual Conference / Alexandria, VA, USA, January 9 - 12, 2022 SODA Joseph (Seffi) Naor, Niv Buchbinder
2021	J	`jnl`	A Randomness Threshold for Online Bipartite Matching, via Lossless Online Rounding. CoRR Niv Buchbinder, Joseph Naor, David Wajc
2021	J	`jnl`	Fair Coin Flipping: Tighter Analysis and the Many-Party Case. CoRR Niv Buchbinder, Iftach Haitner, Nissan Levi, Eliad Tsfadia
2021	A	`conf`	Metrical Service Systems with Transformations. ITCS Sébastien Bubeck, Niv Buchbinder, Christian Coester, Mark Sellke
2021	—	`conf`	Online Virtual Machine Allocation with Lifetime and Load Predictions. SIGMETRICS (Abstracts) Niv Buchbinder, Yaron Fairstein, Konstantina Mellou, Ishai Menache, Joseph (Seffi) Naor
2021	B	`conf`	Online k-Taxi via Double Coverage and Time-Reverse Primal-Dual. IPCO Niv Buchbinder, Christian Coester, Joseph (Seffi) Naor
2021	J	`jnl`	Simplex Transformations and the Multiway Cut Problem. Math. Oper. Res. Niv Buchbinder, Roy Schwartz, Baruch Weizman
2020	J	`jnl`	Metrical Service Systems with Transformations. CoRR Sébastien Bubeck, Niv Buchbinder, Christian Coester, Mark Sellke
2020	J	`jnl`	Online Virtual Machine Allocation with Predictions. CoRR Niv Buchbinder, Yaron Fairstein, Konstantina Mellou, Ishai Menache, Joseph Naor
2020	J	`jnl`	Online k-Taxi via Double Coverage and Time-Reverse Primal-Dual. CoRR Niv Buchbinder, Christian Coester, Joseph Naor
2020	J	`jnl`	Online submodular maximization: beating 1/2 made simple. Math. Program. Niv Buchbinder, Moran Feldman, Yuval Filmus, Mohit Garg
2019	J	`jnl`	A simple algorithm for the multiway cut problem. Oper. Res. Lett. Niv Buchbinder, Roy Schwartz, Baruch Weizman
2019	J	`jnl`	Constrained Submodular Maximization via a Nonsymmetric Technique. Math. Oper. Res. Niv Buchbinder, Moran Feldman
2019	A*	`conf`	Deterministic (½ + ε)-Approximation for Submodular Maximization over a Matroid. SODA Niv Buchbinder, Moran Feldman, Mohit Garg
2019	J	`jnl`	Online Algorithms for Maximum Cardinality Matching with Edge Arrivals. Algorithmica Niv Buchbinder, Danny Segev, Yevgeny Tkach
2019	J	`jnl`	Online Submodular Maximization with Preemption. ACM Trans. Algorithms Niv Buchbinder, Moran Feldman, Roy Schwartz
2019	B	`conf`	Online Submodular Maximization: Beating 1/2 Made Simple. IPCO Niv Buchbinder, Moran Feldman, Yuval Filmus, Mohit Garg
2019	A*	`conf`	k-Servers with a Smile: Online Algorithms via Projections. SODA Niv Buchbinder, Anupam Gupta, Marco Molinaro, Joseph (Seffi) Naor
2018	J	`jnl`	Deterministic (1/2 + ε)-Approximation for Submodular Maximization over a Matroid. CoRR Niv Buchbinder, Moran Feldman, Mohit Garg
2018	J	`jnl`	Deterministic Algorithms for Submodular Maximization Problems. ACM Trans. Algorithms Niv Buchbinder, Moran Feldman
2018	J	`jnl`	Online Submodular Maximization: Beating 1/2 Made Simple. CoRR Niv Buchbinder, Moran Feldman, Mohit Garg
2018	J	`jnl`	Simplex Partitioning via Exponential Clocks and the Multiway-Cut Problem. SIAM J. Comput. Niv Buchbinder, Joseph (Seffi) Naor, Roy Schwartz
2018	—	`ch.`	Submodular Functions Maximization Problems. Handbook of Approximation Algorithms and Metaheuristics (1) Niv Buchbinder, Moran Feldman
2018	J	`jnl`	k-Servers with a Smile: Online Algorithms via Projections. CoRR Niv Buchbinder, Anupam Gupta, Marco Molinaro, Joseph Naor
2017	J	`jnl`	Algorithms and Optimization under Uncertainty (NII Shonan Meeting 2017-5). NII Shonan Meet. Rep. Niv Buchbinder, Nikhil R. Devanur, Debmalya Panigrahi
2017	J	`jnl`	Comparing Apples and Oranges: Query Trade-off in Submodular Maximization. Math. Oper. Res. Niv Buchbinder, Moran Feldman, Roy Schwartz
2017	A*	`conf`	Fair Coin Flipping: Tighter Analysis and the Many-Party Case. SODA Niv Buchbinder, Iftach Haitner, Nissan Levi, Eliad Tsfadia
2017	J	`jnl`	O(depth)-Competitive Algorithm for Online Multi-level Aggregation. CoRR Niv Buchbinder, Moran Feldman, Joseph Naor, Ohad Talmon
2017	A	`conf`	Online Algorithms for Maximum Cardinality Matching with Edge Arrivals. ESA Niv Buchbinder, Danny Segev, Yevgeny Tkach
2017	A*	`conf`	Simplex Transformations and the Multiway Cut Problem. SODA Niv Buchbinder, Roy Schwartz, Baruch Weizman
2016	J	`jnl`	Constrained Submodular Maximization via a Non-symmetric Technique. CoRR Niv Buchbinder, Moran Feldman
2016	A*	`conf`	Deterministic Algorithms for Submodular Maximization Problems. SODA Niv Buchbinder, Moran Feldman
2016	J	`jnl`	How to Allocate Goods in an Online Market? Algorithmica Yossi Azar, Niv Buchbinder, Kamal Jain
2016	A*	`conf`	Online Algorithms for Covering and Packing Problems with Convex Objectives. FOCS 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
2016	J	`jnl`	Unified Algorithms for Online Learning and Competitive Analysis. Math. Oper. Res. Niv Buchbinder, Shahar Chen, Joseph Naor, Ohad Shamir
2015	J	`jnl`	A Polylogarithmic-Competitive Algorithm for the J. ACM Nikhil Bansal, Niv Buchbinder, Aleksander Madry, Joseph Naor
2015	J	`jnl`	A Tight Linear Time (1/2)-Approximation for Unconstrained Submodular Maximization. SIAM J. Comput. Niv Buchbinder, Moran Feldman, Joseph Naor, Roy Schwartz
2015	A*	`conf`	Comparing Apples and Oranges: Query Tradeoff in Submodular Maximization. SODA Niv Buchbinder, Moran Feldman, Roy Schwartz
2015	J	`jnl`	Deterministic Algorithms for Submodular Maximization Problems. CoRR Niv Buchbinder, Moran Feldman
2015	J	`jnl`	Incentive Compatible Mulit-Unit Combinatorial Auctions: A Primal Dual Approach. Algorithmica Niv Buchbinder, Rica Gonen
2015	A*	`conf`	Online Submodular Maximization with Preemption. SODA Niv Buchbinder, Moran Feldman, Roy Schwartz
2015	J	`jnl`	Online Submodular Maximization with Preemption. CoRR Niv Buchbinder, Moran Feldman, Roy Schwartz
2014	J	`jnl`	A Randomized O(log2 k)-Competitive Algorithm for Metric Bipartite Matching. Algorithmica Nikhil Bansal, Niv Buchbinder, Anupam Gupta, Joseph Naor
2014	J	`jnl`	Comparing Apples and Oranges: Query Tradeoff in Submodular Maximization. CoRR Niv Buchbinder, Moran Feldman, Roy Schwartz
2014	A	`conf`	Competitive Algorithms for Restricted Caching and Matroid Caching. ESA Niv Buchbinder, Shahar Chen, Joseph Naor
2014	A*	`conf`	Competitive Analysis via Regularization. SODA Niv Buchbinder, Shahar Chen, Joseph Naor
2014	J	`jnl`	Frequency capping in online advertising. J. Sched. Niv Buchbinder, Moran Feldman, Arpita Ghosh, Joseph Naor
2014	J	`jnl`	Online Packing and Covering Framework with Convex Objectives. CoRR Niv Buchbinder, Shahar Chen, Anupam Gupta, Viswanath Nagarajan, Joseph Naor
2014	J	`jnl`	Secretary Problems via Linear Programming. Math. Oper. Res. Niv Buchbinder, Kamal Jain, Mohit Singh
2014	A*	`conf`	Submodular Maximization with Cardinality Constraints. SODA Niv Buchbinder, Moran Feldman, Joseph Naor, Roy Schwartz
2013	J	`jnl`	Fair online load balancing. J. Sched. Niv Buchbinder, Joseph Naor
2013	J	`jnl`	Online Make-to-Order Joint Replenishment Model: Primal-Dual Competitive Algorithms. Oper. Res. Niv Buchbinder, Tracy Kimbrel, Retsef Levi, Konstantin Makarychev, Maxim Sviridenko
2013	A*	`conf`	Simplex partitioning via exponential clocks and the multiway cut problem. STOC Niv Buchbinder, Joseph Naor, Roy Schwartz
2012	J	`jnl`	A Primal-Dual Randomized Algorithm for Weighted Paging. J. ACM Nikhil Bansal, Niv Buchbinder, Joseph Naor
2012	A*	`conf`	A Tight Linear Time (1/2)-Approximation for Unconstrained Submodular Maximization. FOCS Niv Buchbinder, Moran Feldman, Joseph Naor, Roy Schwartz
2012	J	`jnl`	Approximation Algorithms for Online Weighted Rank Function Maximization under Matroid Constraints CoRR Niv Buchbinder, Joseph Naor, R. Ravi, Mohit Singh
2012	—	`conf`	Approximation Algorithms for Online Weighted Rank Function Maximization under Matroid Constraints. ICALP (1) Niv Buchbinder, Joseph Naor, R. Ravi, Mohit Singh
2012	J	`jnl`	Dynamic Power Allocation Under Arbitrary Varying Channels - An Online Approach. IEEE/ACM Trans. Netw. Niv Buchbinder, Liane Lewin-Eytan, Ishai Menache, Joseph Naor, Ariel Orda
2012	J	`jnl`	Randomized Competitive Algorithms for Generalized Caching. SIAM J. Comput. Nikhil Bansal, Niv Buchbinder, Joseph Naor
2012	A*	`conf`	Unified Algorithms for Online Learning and Competitive Analysis. COLT Niv Buchbinder, Shahar Chen, Joseph Naor, Ohad Shamir
2011	J	`jnl`	A Polylogarithmic-Competitive Algorithm for the k-Server Problem CoRR Nikhil Bansal, Niv Buchbinder, Aleksander Madry, Joseph Naor
2011	A*	`conf`	A Polylogarithmic-Competitive Algorithm for the k-Server Problem. FOCS Nikhil Bansal, Niv Buchbinder, Aleksander Madry, Joseph Naor
2011	B	`conf`	Frequency Capping in Online Advertising. WADS Niv Buchbinder, Moran Feldman, Arpita Ghosh, Joseph Naor
2011	B	`conf`	Online Job-Migration for Reducing the Electricity Bill in the Cloud. Networking (1) Niv Buchbinder, Navendu Jain, Ishai Menache
2010	B	`conf`	A Regularization Approach to Metrical Task Systems. ALT Jacob D. Abernethy, Peter L. Bartlett, Niv Buchbinder, Isabelle Stanton
2010	A*	`conf`	Dynamic Power Allocation Under Arbitrary Varying Channels - The Multi-User Case. INFOCOM Niv Buchbinder, Liane Lewin-Eytan, Ishai Menache, Joseph Naor, Ariel Orda
2010	—	`conf`	How to Allocate Goods in an Online Market? ESA (2) Yossi Azar, Niv Buchbinder, Kamal Jain
2010	—	`conf`	Incentives in Online Auctions via Linear Programming. WINE Niv Buchbinder, Kamal Jain, Mohit Singh
2010	—	`conf`	Metrical Task Systems and the ICALP (1) Nikhil Bansal, Niv Buchbinder, Joseph Naor
2010	J	`jnl`	Non-Cooperative Cost Sharing Games via Subsidies. Theory Comput. Syst. Niv Buchbinder, Liane Lewin-Eytan, Joseph Naor, Ariel Orda
2010	B	`conf`	Secretary Problems via Linear Programming. IPCO Niv Buchbinder, Kamal Jain, Mohit Singh
2010	A*	`conf`	Towards the Randomized k-Server Conjecture: A Primal-Dual Approach. SODA Nikhil Bansal, Niv Buchbinder, Joseph Naor
2009	A*	`conf`	Dynamic Power Allocation Under Arbitrary Varying Channels - An Online Approach. INFOCOM Niv Buchbinder, Liane Lewin-Eytan, Ishai Menache, Joseph Naor, Ariel Orda
2009	J	`jnl`	Online Primal-Dual Algorithms for Covering and Packing. Math. Oper. Res. Niv Buchbinder, Joseph Naor
2009	J	`jnl`	Secretary problems and incentives via linear programming. SIGecom Exch. Niv Buchbinder, Kamal Jain, Mohit Singh
2009	J	`jnl`	The Design of Competitive Online Algorithms via a Primal-Dual Approach. Found. Trends Theor. Comput. Sci. Niv Buchbinder, Joseph Naor
2009	J	`jnl`	The Online Set Cover Problem. SIAM J. Comput. Noga Alon, Baruch Awerbuch, Yossi Azar, Niv Buchbinder, Joseph Naor
2008	—	`—`	Designing competitive online algorithms via a primal-dual approach. Niv Buchbinder
2008	B	`conf`	Non-cooperative Cost Sharing Games Via Subsidies. SAGT Niv Buchbinder, Liane Lewin-Eytan, Joseph Naor, Ariel Orda
2008	A*	`conf`	Online make-to-order joint replenishment model: primal dual competitive algorithms. SODA Niv Buchbinder, Tracy Kimbrel, Retsef Levi, Konstantin Makarychev, Maxim Sviridenko
2008	A*	`conf`	Randomized competitive algorithms for generalized caching. STOC Nikhil Bansal, Niv Buchbinder, Joseph Naor
2007	A*	`conf`	A Primal-Dual Randomized Algorithm for Weighted Paging. FOCS Nikhil Bansal, Niv Buchbinder, Joseph Naor
2007	A	`conf`	An ESA Nikhil Bansal, Niv Buchbinder, Anupam Gupta, Joseph Naor
2007	A	`conf`	Online Primal-Dual Algorithms for Maximizing Ad-Auctions Revenue. ESA Niv Buchbinder, Kamal Jain, Joseph Naor
2006	J	`jnl`	A general approach to online network optimization problems. ACM Trans. Algorithms Noga Alon, Baruch Awerbuch, Yossi Azar, Niv Buchbinder, Joseph Naor
2006	B	`conf`	Fair online load balancing. SPAA Niv Buchbinder, Joseph Naor
2006	A*	`conf`	Improved Bounds for Online Routing and Packing Via a Primal-Dual Approach. FOCS Niv Buchbinder, Joseph Naor
2006	J	`jnl`	Lower and upper bounds on obtaining history independence. Inf. Comput. Niv Buchbinder, Erez Petrank
2005	A	`conf`	Online Primal-Dual Algorithms for Covering and Packing Problems. ESA Niv Buchbinder, Joseph Naor
2004	A*	`conf`	A general approach to online network optimization problems. SODA Noga Alon, Baruch Awerbuch, Yossi Azar, Niv Buchbinder, Joseph Naor
2003	A*	`conf`	Lower and Upper Bounds on Obtaining History Independence. CRYPTO Niv Buchbinder, Erez Petrank
2003	A*	`conf`	The online set cover problem. STOC Noga Alon, Baruch Awerbuch, Yossi Azar, Niv Buchbinder, Joseph Naor
2001	—	`conf`	Mostly Accurate Stack Scanning. Java Virtual Machine Research and Technology Symposium Katherine Barabash, Niv Buchbinder, Tamar Domani, Elliot K. Kolodner, Yoav Ossia, Shlomit S. Pinter, Janice C. Shepherd, Ron Sivan, Victor Umansky