default search action
Niv Buchbinder
Person information
- affiliation: Tel Aviv University, Israel
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
- [c50]Niv Buchbinder, Moran Feldman:
Deterministic Algorithm and Faster Algorithm for Submodular Maximization Subject to a Matroid Constraint. FOCS 2024: 700-712 - [c49]Niv Buchbinder, Anupam Gupta, Daniel Hathcock, Anna R. Karlin, Sherry Sarkar:
Maintaining Matroid Intersections Online. SODA 2024: 4283-4304 - [c48]Niv Buchbinder
, Moran Feldman
Constrained Submodular Maximization via New Bounds for DR-Submodular Functions. STOC 2024: 1820-1831 - [i22]Niv Buchbinder, Moran Feldman:
Deterministic Algorithm and Faster Algorithm for Submodular Maximization subject to a Matroid Constraint. CoRR abs/2408.03583 (2024) - [i21]Niv Buchbinder, Moran Feldman:
Extending the Extension: Deterministic Algorithm for Non-monotone Submodular Maximization. CoRR abs/2409.14325 (2024) - 2023
- [j31]Niv Buchbinder, Christian Coester
Online k-taxi via Double Coverage and time-reverse primal-dual. Math. Program. 197(2): 499-527 (2023) - [j30]Niv Buchbinder
Deterministic (1/2 + ε)-Approximation for Submodular Maximization over a Matroid. SIAM J. Comput. 52(4): 945-967 (2023) - [c47]Sayan Bhattacharya, Niv Buchbinder, Roie Levin, Thatchaphol Saranurak
Chasing Positive Bodies. FOCS 2023: 1694-1714 - [c46]Niv Buchbinder, Joseph (Seffi) Naor, David Wajc:
Lossless Online Rounding for Online Bipartite Matching (Despite its Impossibility). SODA 2023: 2030-2068 - [i20]Sayan Bhattacharya, Niv Buchbinder, Roie Levin, Thatchaphol Saranurak
Chasing Positive Bodies. CoRR abs/2304.01889 (2023) - [i19]Niv Buchbinder, Anupam Gupta, Daniel Hathcock, Anna R. Karlin, Sherry Sarkar:
Maintaining Matroid Intersections Online. CoRR abs/2309.10214 (2023) - [i18]Niv Buchbinder, Moran Feldman:
Constrained Submodular Maximization via New Bounds for DR-Submodular Functions. CoRR abs/2311.01129 (2023) - 2022
- [e1]Joseph (Seffi) Naor, Niv Buchbinder:
Proceedings of the 2022 ACM-SIAM Symposium on Discrete Algorithms, SODA 2022, Virtual Conference / Alexandria, VA, USA, January 9 - 12, 2022. SIAM 2022, ISBN 978-1-61197-707-3 [contents] - 2021
- [j29]Niv Buchbinder
Simplex Transformations and the Multiway Cut Problem. Math. Oper. Res. 46(2): 757-771 (2021) - [c45]Sébastien Bubeck, Niv Buchbinder, Christian Coester
Metrical Service Systems with Transformations. ITCS 2021: 21:1-21:20 - [c44]Niv Buchbinder, Christian Coester
Online k-Taxi via Double Coverage and Time-Reverse Primal-Dual. IPCO 2021: 15-29 - [c43]Niv Buchbinder, Yaron Fairstein, Konstantina Mellou, Ishai Menache, Joseph (Seffi) Naor:
Online Virtual Machine Allocation with Lifetime and Load Predictions. SIGMETRICS (Abstracts) 2021: 9-10 - [i17]Niv Buchbinder, Iftach Haitner, Nissan Levi, Eliad Tsfadia:
Fair Coin Flipping: Tighter Analysis and the Many-Party Case. CoRR abs/2104.08820 (2021) - [i16]Niv Buchbinder, Joseph Naor, David Wajc:
A Randomness Threshold for Online Bipartite Matching, via Lossless Online Rounding. CoRR abs/2106.04863 (2021) - 2020
- [j28]Niv Buchbinder
Online submodular maximization: beating 1/2 made simple. Math. Program. 183(1): 149-169 (2020) - [i15]Sébastien Bubeck, Niv Buchbinder, Christian Coester, Mark Sellke:
Metrical Service Systems with Transformations. CoRR abs/2009.08266 (2020) - [i14]Niv Buchbinder, Yaron Fairstein, Konstantina Mellou, Ishai Menache, Joseph Naor:
Online Virtual Machine Allocation with Predictions. CoRR abs/2011.06250 (2020) - [i13]Niv Buchbinder, Christian Coester, Joseph Naor:
Online k-Taxi via Double Coverage and Time-Reverse Primal-Dual. CoRR abs/2012.02226 (2020)
2010 – 2019
- 2019
- [j27]Niv Buchbinder, Danny Segev
Online Algorithms for Maximum Cardinality Matching with Edge Arrivals. Algorithmica 81(5): 1781-1799 (2019) - [j26]Niv Buchbinder
Constrained Submodular Maximization via a Nonsymmetric Technique. Math. Oper. Res. 44(3): 988-1005 (2019) - [j25]Niv Buchbinder, Roy Schwartz, Baruch Weizman:
A simple algorithm for the multiway cut problem. Oper. Res. Lett. 47(6): 587-593 (2019) - [j24]Niv Buchbinder, Moran Feldman
Online Submodular Maximization with Preemption. ACM Trans. Algorithms 15(3): 30:1-30:31 (2019) - [c42]Niv Buchbinder, Moran Feldman, Yuval Filmus, Mohit Garg:
Online Submodular Maximization: Beating 1/2 Made Simple. IPCO 2019: 101-114 - [c41]Niv Buchbinder, Anupam Gupta, Marco Molinaro, Joseph (Seffi) Naor:
k-Servers with a Smile: Online Algorithms via Projections. SODA 2019: 98-116 - [c40]Niv Buchbinder, Moran Feldman, Mohit Garg:
Deterministic (½ + ε)-Approximation for Submodular Maximization over a Matroid. SODA 2019: 241-254 - 2018
- [j23]Niv Buchbinder
Simplex Partitioning via Exponential Clocks and the Multiway-Cut Problem. SIAM J. Comput. 47(4): 1463-1482 (2018) - [j22]Niv Buchbinder, Moran Feldman
Deterministic Algorithms for Submodular Maximization Problems. ACM Trans. Algorithms 14(3): 32:1-32:20 (2018) - [p1]Niv Buchbinder, Moran Feldman:
Submodular Functions Maximization Problems. Handbook of Approximation Algorithms and Metaheuristics (1) 2018: 753-788 - [i12]Niv Buchbinder, Moran Feldman, Mohit Garg:
Online Submodular Maximization: Beating 1/2 Made Simple. CoRR abs/1807.05529 (2018) - [i11]Niv Buchbinder, Moran Feldman, Mohit Garg:
Deterministic (1/2 + ε)-Approximation for Submodular Maximization over a Matroid. CoRR abs/1807.05532 (2018) - [i10]Niv Buchbinder, Anupam Gupta, Marco Molinaro, Joseph Naor:
k-Servers with a Smile: Online Algorithms via Projections. CoRR abs/1810.07508 (2018) - 2017
- [j21]Niv Buchbinder
Comparing Apples and Oranges: Query Trade-off in Submodular Maximization. Math. Oper. Res. 42(2): 308-329 (2017) - [c39]Niv Buchbinder
Online Algorithms for Maximum Cardinality Matching with Edge Arrivals. ESA 2017: 22:1-22:14 - [c38]Niv Buchbinder
O(depth)-Competitive Algorithm for Online Multi-level Aggregation. SODA 2017: 1235-1244 - [c37]Niv Buchbinder
Simplex Transformations and the Multiway Cut Problem. SODA 2017: 2400-2410 - [c36]Niv Buchbinder
Fair Coin Flipping: Tighter Analysis and the Many-Party Case. SODA 2017: 2580-2600 - [i9]Niv Buchbinder
O(depth)-Competitive Algorithm for Online Multi-level Aggregation. CoRR abs/1701.01936 (2017) - [i8]Niv Buchbinder, Nikhil R. Devanur, Debmalya Panigrahi:
Algorithms and Optimization under Uncertainty (NII Shonan Meeting 2017-5). NII Shonan Meet. Rep. 2017 (2017) - 2016
- [j20]Yossi Azar, Niv Buchbinder
How to Allocate Goods in an Online Market? Algorithmica 74(2): 589-601 (2016) - [j19]Niv Buchbinder
Unified Algorithms for Online Learning and Competitive Analysis. Math. Oper. Res. 41(2): 612-625 (2016) - [c35]Yossi Azar, Niv Buchbinder
Online Algorithms for Covering and Packing Problems with Convex Objectives. FOCS 2016: 148-157 - [c34]Niv Buchbinder
Deterministic Algorithms for Submodular Maximization Problems. SODA 2016: 392-403 - [i7]Niv Buchbinder
Constrained Submodular Maximization via a Non-symmetric Technique. CoRR abs/1611.03253 (2016) - 2015
- [j18]Niv Buchbinder
Incentive Compatible Mulit-Unit Combinatorial Auctions: A Primal Dual Approach. Algorithmica 72(1): 167-190 (2015) - [j17]Nikhil Bansal, Niv Buchbinder
A Polylogarithmic-Competitive Algorithm for the k-Server Problem. J. ACM 62(5): 40:1-40:49 (2015) - [j16]Niv Buchbinder
A Tight Linear Time (1/2)-Approximation for Unconstrained Submodular Maximization. SIAM J. Comput. 44(5): 1384-1402 (2015) - [c33]Niv Buchbinder
Comparing Apples and Oranges: Query Tradeoff in Submodular Maximization. SODA 2015: 1149-1168 - [c32]Niv Buchbinder
Online Submodular Maximization with Preemption. SODA 2015: 1202-1216 - [i6]Niv Buchbinder
Online Submodular Maximization with Preemption. CoRR abs/1501.05801 (2015) - [i5]Niv Buchbinder
Deterministic Algorithms for Submodular Maximization Problems. CoRR abs/1508.02157 (2015) - 2014
- [j15]Nikhil Bansal, Niv Buchbinder
A Randomized O(log2 k)-Competitive Algorithm for Metric Bipartite Matching. Algorithmica 68(2): 390-403 (2014) - [j14]Niv Buchbinder
Secretary Problems via Linear Programming. Math. Oper. Res. 39(1): 190-206 (2014) - [j13]Niv Buchbinder
Frequency capping in online advertising. J. Sched. 17(4): 385-398 (2014) - [c31]Niv Buchbinder
Competitive Algorithms for Restricted Caching and Matroid Caching. ESA 2014: 209-221 - [c30]Niv Buchbinder
Competitive Analysis via Regularization. SODA 2014: 436-444 - [c29]Niv Buchbinder
Submodular Maximization with Cardinality Constraints. SODA 2014: 1433-1452 - [i4]Niv Buchbinder
Comparing Apples and Oranges: Query Tradeoff in Submodular Maximization. CoRR abs/1410.0773 (2014) - [i3]Niv Buchbinder
Online Packing and Covering Framework with Convex Objectives. CoRR abs/1412.8347 (2014) - 2013
- [j12]Niv Buchbinder
Online Make-to-Order Joint Replenishment Model: Primal-Dual Competitive Algorithms. Oper. Res. 61(4): 1014-1029 (2013) - [j11]Niv Buchbinder
Fair online load balancing. J. Sched. 16(1): 117-127 (2013) - [c28]Niv Buchbinder
Simplex partitioning via exponential clocks and the multiway cut problem. STOC 2013: 535-544 - 2012
- [j10]Nikhil Bansal, Niv Buchbinder
A Primal-Dual Randomized Algorithm for Weighted Paging. J. ACM 59(4): 19:1-19:24 (2012) - [j9]Nikhil Bansal, Niv Buchbinder
Randomized Competitive Algorithms for Generalized Caching. SIAM J. Comput. 41(2): 391-414 (2012) - [j8]Niv Buchbinder
Dynamic Power Allocation Under Arbitrary Varying Channels - An Online Approach. IEEE/ACM Trans. Netw. 20(2): 477-487 (2012) - [c27]Niv Buchbinder
A Tight Linear Time (1/2)-Approximation for Unconstrained Submodular Maximization. FOCS 2012: 649-658 - [c26]Niv Buchbinder
Approximation Algorithms for Online Weighted Rank Function Maximization under Matroid Constraints. ICALP (1) 2012: 145-156 - [c25]Niv Buchbinder, Shahar Chen, Joseph Naor, Ohad Shamir:
Unified Algorithms for Online Learning and Competitive Analysis. COLT 2012: 5.1-5.18 - [i2]Niv Buchbinder
Approximation Algorithms for Online Weighted Rank Function Maximization under Matroid Constraints. CoRR abs/1205.1477 (2012) - 2011
- [c24]Nikhil Bansal, Niv Buchbinder
A Polylogarithmic-Competitive Algorithm for the k-Server Problem. FOCS 2011: 267-276 - [c23]Niv Buchbinder
Online Job-Migration for Reducing the Electricity Bill in the Cloud. Networking (1) 2011: 172-185 - [c22]Niv Buchbinder
Frequency Capping in Online Advertising. WADS 2011: 147-158 - [i1]Nikhil Bansal, Niv Buchbinder
A Polylogarithmic-Competitive Algorithm for the k-Server Problem. CoRR abs/1110.1580 (2011) - 2010
- [j7]Niv Buchbinder
Non-Cooperative Cost Sharing Games via Subsidies. Theory Comput. Syst. 47(1): 15-37 (2010) - [c21]Jacob D. Abernethy, Peter L. Bartlett
A Regularization Approach to Metrical Task Systems. ALT 2010: 270-284 - [c20]Yossi Azar, Niv Buchbinder
How to Allocate Goods in an Online Market? ESA (2) 2010: 51-62 - [c19]Nikhil Bansal, Niv Buchbinder
Metrical Task Systems and the k-Server Problem on HSTs. ICALP (1) 2010: 287-298 - [c18]Niv Buchbinder
Dynamic Power Allocation Under Arbitrary Varying Channels - The Multi-User Case. INFOCOM 2010: 2402-2410 - [c17]Niv Buchbinder
Secretary Problems via Linear Programming. IPCO 2010: 163-176 - [c16]Nikhil Bansal, Niv Buchbinder
Towards the Randomized k-Server Conjecture: A Primal-Dual Approach. SODA 2010: 40-55 - [c15]Niv Buchbinder
Incentives in Online Auctions via Linear Programming. WINE 2010: 106-117
2000 – 2009
- 2009
- [j6]Niv Buchbinder
The Design of Competitive Online Algorithms via a Primal-Dual Approach. Found. Trends Theor. Comput. Sci. 3(2-3): 93-263 (2009) - [j5]Niv Buchbinder
Online Primal-Dual Algorithms for Covering and Packing. Math. Oper. Res. 34(2): 270-286 (2009) - [j4]Noga Alon, Baruch Awerbuch, Yossi Azar, Niv Buchbinder
The Online Set Cover Problem. SIAM J. Comput. 39(2): 361-370 (2009) - [j3]Niv Buchbinder
Secretary problems and incentives via linear programming. SIGecom Exch. 8(2): 6 (2009) - [c14]Niv Buchbinder
Dynamic Power Allocation Under Arbitrary Varying Channels - An Online Approach. INFOCOM 2009: 145-153 - 2008
- [b1]Niv Buchbinder:
Designing competitive online algorithms via a primal-dual approach. Technion - Israel Institute of Technology, Israel, 2008 - [c13]Niv Buchbinder
Non-cooperative Cost Sharing Games Via Subsidies. SAGT 2008: 337-349 - [c12]Niv Buchbinder, Tracy Kimbrel, Retsef Levi, Konstantin Makarychev, Maxim Sviridenko:
Online make-to-order joint replenishment model: primal dual competitive algorithms. SODA 2008: 952-961 - [c11]Nikhil Bansal, Niv Buchbinder
Randomized competitive algorithms for generalized caching. STOC 2008: 235-244 - 2007
- [c10]Niv Buchbinder
Online Primal-Dual Algorithms for Maximizing Ad-Auctions Revenue. ESA 2007: 253-264 - [c9]Nikhil Bansal, Niv Buchbinder
An O (log2 k )-Competitive Algorithm for Metric Bipartite Matching. ESA 2007: 522-533 - [c8]Nikhil Bansal, Niv Buchbinder, Joseph Naor:
A Primal-Dual Randomized Algorithm for Weighted Paging. FOCS 2007: 507-517 - 2006
- [j2]Niv Buchbinder, Erez Petrank:
Lower and upper bounds on obtaining history independence. Inf. Comput. 204(2): 291-337 (2006) - [j1]Noga Alon, Baruch Awerbuch, Yossi Azar, Niv Buchbinder
A general approach to online network optimization problems. ACM Trans. Algorithms 2(4): 640-660 (2006) - [c7]Niv Buchbinder
Improved Bounds for Online Routing and Packing Via a Primal-Dual Approach. FOCS 2006: 293-304 - [c6]Niv Buchbinder, Joseph Naor:
Fair online load balancing. SPAA 2006: 291-298 - 2005
- [c5]Niv Buchbinder
Online Primal-Dual Algorithms for Covering and Packing Problems. ESA 2005: 689-701 - 2004
- [c4]Noga Alon, Baruch Awerbuch, Yossi Azar, Niv Buchbinder, Joseph Naor:
A general approach to online network optimization problems. SODA 2004: 577-586 - 2003
- [c3]Niv Buchbinder, Erez Petrank:
Lower and Upper Bounds on Obtaining History Independence. CRYPTO 2003: 445-462 - [c2]Noga Alon, Baruch Awerbuch, Yossi Azar, Niv Buchbinder, Joseph Naor:
The online set cover problem. STOC 2003: 100-105 - 2001
- [c1]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
Coauthor Index
Joseph Naor
aka: Joseph (Seffi) Naor
aka: Joseph (Seffi) Naor
[j31] [c46] [e1] [c44] [c43] [i16] [i14] [i13] [c41] [j23] [i10] [c38] [i9] [j19] [c35] [j17] [j16] [j15] [j13] [c31] [c30] [c29] [i3] [j11] [c28] [j10] [j9] [j8] [c27] [c26] [c25] [i2] [c24] [c22] [i1] [j7] [c19] [c18] [c16] [j6] [j5] [j4] [c14] [c13] [c11] [c10] [c9] [c8] [j1] [c7] [c6] [c5] [c4] [c2]
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-12-10 21:45 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: