Google
Google Scholar
MS Academic
CiteSeerX
CORE
Semantic ScholarNiv 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
2010 – today
- 2019
[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
- [j22]Niv Buchbinder, Moran Feldman:
Deterministic Algorithms for Submodular Maximization Problems. ACM Trans. Algorithms 14(3): 32:1-32:20 (2018) - [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, Moran Feldman, Roy Schwartz:
Comparing Apples and Oranges: Query Trade-off in Submodular Maximization. Math. Oper. Res. 42(2): 308-329 (2017) - [c39]Niv Buchbinder, Danny Segev, Yevgeny Tkach:
Online Algorithms for Maximum Cardinality Matching with Edge Arrivals. ESA 2017: 22:1-22:14 - [c38]Niv Buchbinder, Moran Feldman, Joseph (Seffi) Naor, Ohad Talmon:
O(depth)-Competitive Algorithm for Online Multi-level Aggregation. SODA 2017: 1235-1244 - [c37]Niv Buchbinder, Roy Schwartz, Baruch Weizman:
Simplex Transformations and the Multiway Cut Problem. SODA 2017: 2400-2410 - [c36]Niv Buchbinder, Iftach Haitner, Nissan Levi, Eliad Tsfadia:
Fair Coin Flipping: Tighter Analysis and the Many-Party Case. SODA 2017: 2580-2600 - [i9]Niv Buchbinder, Moran Feldman, Joseph Naor, Ohad Talmon:
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, Kamal Jain:
How to Allocate Goods in an Online Market? Algorithmica 74(2): 589-601 (2016) - [j19]Niv Buchbinder, Shahar Chen, Joseph Naor, Ohad Shamir:
Unified Algorithms for Online Learning and Competitive Analysis. Math. Oper. Res. 41(2): 612-625 (2016) - [c35]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: 148-157 - [c34]Niv Buchbinder, Moran Feldman:
Deterministic Algorithms for Submodular Maximization Problems. SODA 2016: 392-403 - [i7]Niv Buchbinder, Moran Feldman:
Constrained Submodular Maximization via a Non-symmetric Technique. CoRR abs/1611.03253 (2016) - 2015
- [j18]Niv Buchbinder, Rica Gonen:
Incentive Compatible Mulit-Unit Combinatorial Auctions: A Primal Dual Approach. Algorithmica 72(1): 167-190 (2015) - [j17]Nikhil Bansal, Niv Buchbinder, Aleksander Madry, Joseph Naor:
A Polylogarithmic-Competitive Algorithm for the k-Server Problem. J. ACM 62(5): 40:1-40:49 (2015) - [j16]Niv Buchbinder, Moran Feldman, Joseph Naor, Roy Schwartz:
A Tight Linear Time (1/2)-Approximation for Unconstrained Submodular Maximization. SIAM J. Comput. 44(5): 1384-1402 (2015) - [c33]Niv Buchbinder, Moran Feldman, Roy Schwartz:
Comparing Apples and Oranges: Query Tradeoff in Submodular Maximization. SODA 2015: 1149-1168 - [c32]Niv Buchbinder, Moran Feldman, Roy Schwartz:
Online Submodular Maximization with Preemption. SODA 2015: 1202-1216 - [i6]Niv Buchbinder, Moran Feldman, Roy Schwartz:
Online Submodular Maximization with Preemption. CoRR abs/1501.05801 (2015) - [i5]Niv Buchbinder, Moran Feldman:
Deterministic Algorithms for Submodular Maximization Problems. CoRR abs/1508.02157 (2015) - 2014
- [j15]Nikhil Bansal, Niv Buchbinder, Anupam Gupta, Joseph Naor:
A Randomized O(log2 k)-Competitive Algorithm for Metric Bipartite Matching. Algorithmica 68(2): 390-403 (2014) - [j14]Niv Buchbinder, Kamal Jain, Mohit Singh:
Secretary Problems via Linear Programming. Math. Oper. Res. 39(1): 190-206 (2014) - [j13]Niv Buchbinder, Moran Feldman, Arpita Ghosh, Joseph Naor:
Frequency capping in online advertising. J. Scheduling 17(4): 385-398 (2014) - [c31]Niv Buchbinder, Shahar Chen, Joseph Naor:
Competitive Algorithms for Restricted Caching and Matroid Caching. ESA 2014: 209-221 - [c30]Niv Buchbinder, Shahar Chen, Joseph Naor:
Competitive Analysis via Regularization. SODA 2014: 436-444 - [c29]Niv Buchbinder, Moran Feldman, Joseph Naor, Roy Schwartz:
Submodular Maximization with Cardinality Constraints. SODA 2014: 1433-1452 - [i4]Niv Buchbinder, Moran Feldman, Roy Schwartz:
Comparing Apples and Oranges: Query Tradeoff in Submodular Maximization. CoRR abs/1410.0773 (2014) - [i3]Niv Buchbinder, Shahar Chen, Anupam Gupta, Viswanath Nagarajan, Joseph Naor:
Online Packing and Covering Framework with Convex Objectives. CoRR abs/1412.8347 (2014) - 2013
- [j12]Niv Buchbinder, Tracy Kimbrel, Retsef Levi, Konstantin Makarychev, Maxim Sviridenko:
Online Make-to-Order Joint Replenishment Model: Primal-Dual Competitive Algorithms. Operations Research 61(4): 1014-1029 (2013) - [j11]
- [c28]Niv Buchbinder, Joseph Naor, Roy Schwartz:
Simplex partitioning via exponential clocks and the multiway cut problem. STOC 2013: 535-544 - 2012
- [j10]Nikhil Bansal, Niv Buchbinder, Joseph Naor:
A Primal-Dual Randomized Algorithm for Weighted Paging. J. ACM 59(4): 19:1-19:24 (2012) - [j9]Nikhil Bansal, Niv Buchbinder, Joseph Naor:
Randomized Competitive Algorithms for Generalized Caching. SIAM J. Comput. 41(2): 391-414 (2012) - [j8]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): 477-487 (2012) - [c27]Niv Buchbinder, Moran Feldman, Joseph Naor, Roy Schwartz:
A Tight Linear Time (1/2)-Approximation for Unconstrained Submodular Maximization. FOCS 2012: 649-658 - [c26]Niv Buchbinder, Joseph Naor, R. Ravi, Mohit Singh:
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, Joseph Naor, R. Ravi, Mohit Singh:
Approximation Algorithms for Online Weighted Rank Function Maximization under Matroid Constraints. CoRR abs/1205.1477 (2012) - 2011
- [c24]Nikhil Bansal, Niv Buchbinder, Aleksander Madry, Joseph Naor:
A Polylogarithmic-Competitive Algorithm for the k-Server Problem. FOCS 2011: 267-276 - [c23]Niv Buchbinder, Navendu Jain, Ishai Menache:
Online Job-Migration for Reducing the Electricity Bill in the Cloud. Networking (1) 2011: 172-185 - [c22]Niv Buchbinder, Moran Feldman, Arpita Ghosh, Joseph Naor:
Frequency Capping in Online Advertising. WADS 2011: 147-158 - [i1]Nikhil Bansal, Niv Buchbinder, Aleksander Madry, Joseph Naor:
A Polylogarithmic-Competitive Algorithm for the k-Server Problem. CoRR abs/1110.1580 (2011) - 2010
- [j7]Niv Buchbinder, Liane Lewin-Eytan, Joseph Naor, Ariel Orda:
Non-Cooperative Cost Sharing Games via Subsidies. Theory Comput. Syst. 47(1): 15-37 (2010) - [c21]Jacob D. Abernethy, Peter L. Bartlett, Niv Buchbinder, Isabelle Stanton:
A Regularization Approach to Metrical Task Systems. ALT 2010: 270-284 - [c20]Yossi Azar, Niv Buchbinder, Kamal Jain:
How to Allocate Goods in an Online Market? ESA (2) 2010: 51-62 - [c19]Nikhil Bansal, Niv Buchbinder, Joseph Naor:
Metrical Task Systems and the k-Server Problem on HSTs. ICALP (1) 2010: 287-298 - [c18]Niv Buchbinder, Liane Lewin-Eytan, Ishai Menache, Joseph Naor, Ariel Orda:
Dynamic Power Allocation Under Arbitrary Varying Channels - The Multi-User Case. INFOCOM 2010: 2402-2410 - [c17]Niv Buchbinder, Kamal Jain, Mohit Singh:
Secretary Problems via Linear Programming. IPCO 2010: 163-176 - [c16]Nikhil Bansal, Niv Buchbinder, Joseph Naor:
Towards the Randomized k-Server Conjecture: A Primal-Dual Approach. SODA 2010: 40-55 - [c15]Niv Buchbinder, Kamal Jain, Mohit Singh:
Incentives in Online Auctions via Linear Programming. WINE 2010: 106-117
2000 – 2009
- 2009
- [j6]Niv Buchbinder, Joseph Naor:
The Design of Competitive Online Algorithms via a Primal-Dual Approach. Foundations and Trends in Theoretical Computer Science 3(2-3): 93-263 (2009) - [j5]Niv Buchbinder, Joseph Naor:
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, Joseph Naor:
The Online Set Cover Problem. SIAM J. Comput. 39(2): 361-370 (2009) - [j3]Niv Buchbinder, Kamal Jain, Mohit Singh:
Secretary problems and incentives via linear programming. SIGecom Exchanges 8(2): 6 (2009) - [c14]Niv Buchbinder, Liane Lewin-Eytan, Ishai Menache, Joseph Naor, Ariel Orda:
Dynamic Power Allocation Under Arbitrary Varying Channels - An Online Approach. INFOCOM 2009: 145-153 - 2008
- [c13]Niv Buchbinder, Liane Lewin-Eytan, Joseph Naor, Ariel Orda:
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, Joseph Naor:
Randomized competitive algorithms for generalized caching. STOC 2008: 235-244 - 2007
- [c10]Niv Buchbinder, Kamal Jain, Joseph Naor:
Online Primal-Dual Algorithms for Maximizing Ad-Auctions Revenue. ESA 2007: 253-264 - [c9]Nikhil Bansal, Niv Buchbinder, Anupam Gupta, Joseph Naor:
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, Joseph Naor:
A general approach to online network optimization problems. ACM Trans. Algorithms 2(4): 640-660 (2006) - [c7]Niv Buchbinder, Joseph Naor:
Improved Bounds for Online Routing and Packing Via a Primal-Dual Approach. FOCS 2006: 293-304 - [c6]
- 2005
- [c5]Niv Buchbinder, Joseph Naor:
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
maintained by 
, founded at 
, founded at 
last updated on 2019-01-24 23:17 CET by the dblp team
data released under the ODC-BY 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
the dblp computer science bibliography is funded by:
