×
Compute Distance To:
Author ID: buchbinder.niv Recent zbMATH articles by "Buchbinder, Niv"
Published as: Buchbinder, Niv; Buchbinder, N.
Documents Indexed: 57 Publications since 2003
Co-Authors: 36 Co-Authors with 57 Joint Publications
1,424 Co-Co-Authors

Publications by Year

Citations contained in zbMATH Open

50 Publications have been cited 415 times in 277 Documents Cited by Year
Online primal-dual algorithms for covering and packing. Zbl 1216.68335
Buchbinder, Niv; Naor, Joseph (Seffi)
32
2009
Online primal-dual algorithms for maximizing ad-auctions revenue. Zbl 1151.68747
Buchbinder, Niv; Jain, Kamal; Naor, Joseph (Seffi)
31
2007
The design of competitive online algorithms via a primal-dual approach. Zbl 1190.68083
Buchbinder, Niv; Naor, Joseph (Seffi)
31
2007
A tight linear time (1/2)-approximation for unconstrained submodular maximization. Zbl 1330.68346
Buchbinder, Niv; Feldman, Moran; Seffi, Joseph; Schwartz, Roy
28
2015
The online set cover problem. Zbl 1200.68271
Alon, Noga; Awerbuch, Baruch; Azar, Yossi; Buchbinder, Niv; Naor, Joseph
27
2009
Submodular maximization with cardinality constraints. Zbl 1423.90212
Buchbinder, Niv; Feldman, Moran; Naor, Joseph (Seffi); Schwartz, Roy
23
2014
A general approach to online network optimization problems. Zbl 1321.68509
Alon, Noga; Awerbuch, Baruch; Azar, Yossi; Buchbinder, Niv; Naor, Joseph (Seffi)
20
2006
A primal-dual randomized algorithm for weighted paging. Zbl 1281.68238
Bansal, Nikhil; Buchbinder, Niv; Naor, Joseph (Seffi)
15
2012
Deterministic algorithms for submodular maximization problems. Zbl 1454.68170
Buchbinder, Niv; Feldman, Moran
14
2018
Online submodular maximization with preemption. Zbl 1371.68328
Buchbinder, Niv; Feldman, Moran; Schwartz, Roy
14
2015
Simplex partitioning via exponential clocks and the multiway cut problem. Zbl 1293.05286
Buchbinder, Niv; Naor, Joseph (Seffi); Schwartz, Roy
13
2013
Deterministic algorithms for submodular maximization problems. Zbl 1411.68177
Buchbinder, Niv; Feldman, Moran
11
2016
Deterministic \((\frac12 + \varepsilon)\)-approximation for submodular maximization over a matroid. Zbl 1431.90125
Buchbinder, Niv; Feldman, Moran; Garg, Mohit
11
2019
Randomized competitive algorithms for generalized caching. Zbl 1231.68278
Bansal, Nikhil; Buchbinder, Niv; Naor, Joseph (Seffi)
10
2008
Fair coin flipping: tighter analysis and the many-party case. Zbl 1414.94909
Buchbinder, Niv; Haitner, Iftach; Levi, Nissan; Tsfadia, Eliad
8
2017
A polylogarithmic-competitive algorithm for the \(k\)-server problem (extended abstract). Zbl 1292.68153
Bansal, Nikhil; Buchbinder, Niv; Mądry, Aleksander; Naor, Joseph
8
2011
Online primal-dual algorithms for covering and packing problems. Zbl 1151.68748
Buchbinder, Niv; Naor, Joseph
8
2005
A randomized \(O(\log^2k)\)-competitive algorithm for metric bipartite matching. Zbl 1318.68200
Bansal, Nikhil; Buchbinder, Niv; Gupta, Anupam; Naor, Joseph (seffi)
7
2014
A polylogarithmic-competitive algorithm for the \(k\)-server problem. Zbl 1426.68294
Bansal, Nikhil; Buchbinder, Niv; Madry, Aleksander; Naor, Joseph (Seffi)
6
2015
Secretary problems via linear programming. Zbl 1285.90012
Buchbinder, Niv; Jain, Kamal; Singh, Mohit
6
2010
Secretary problems via linear programming. Zbl 1305.90344
Buchbinder, Niv; Jain, Kamal; Singh, Mohit
6
2014
Unified algorithms for online learning and competitive analysis. Zbl 1335.68196
Buchbinder, Niv; Chen, Shahar; Naor, Joseph (Seffi); Shamir, Ohad
6
2016
Constrained submodular maximization via a nonsymmetric technique. Zbl 1434.68674
Buchbinder, Niv; Feldman, Moran
6
2019
A general approach to online network optimization problems. Zbl 1318.68199
Alon, Noga; Awerbuch, Baruch; Azar, Yossi; Buchbinder, Niv; Naor, Joseph (Seffi)
6
2004
Comparing apples and oranges: query trade-off in submodular maximization. Zbl 1364.68367
Buchbinder, Niv; Feldman, Moran; Schwartz, Roy
6
2017
Simplex transformations and the multiway cut problem. Zbl 1410.05193
Buchbinder, Niv; Schwartz, Roy; Weizman, Baruch
5
2017
Online make-to-order joint replenishment model: Primal dual competitive algorithms. Zbl 1192.90005
Buchbinder, N.; Kimbrel, T.; Levi, R.; Makarychev, K.; Sviridenko, M.
5
2008
Fair online load balancing. Zbl 1297.68040
Buchbinder, Niv; Naor, Joseph (Seffi)
5
2013
Competitive analysis via regularization. Zbl 1420.68238
Buchbinder, Niv; Chen, Shahar; Naor, Joseph (Seffi)
5
2014
Towards the randomized \(k\)-server conjecture, a primal-dual approach. Zbl 1288.68283
Bansal, Nikhil; Buchbinder, Niv; Naor, Joseph (Seffi)
4
2010
Non-cooperative cost sharing games via subsidies. Zbl 1203.91012
Buchbinder, Niv; Lewin-Eytan, Liane; Naor, Joseph (Seffi); Orda, Ariel
3
2010
Metrical task systems and the \(k\)-server problem on HSTs. Zbl 1288.68282
Bansal, Nikhil; Buchbinder, Niv; Naor, Joseph (Seffi)
3
2010
Online make-to-order joint replenishment model: primal-dual competitive algorithms. Zbl 1291.90010
Buchbinder, Niv; Kimbrel, Tracy; Levi, Retsef; Makarychev, Konstantin; Sviridenko, Maxim
3
2013
Non-cooperative cost sharing games via subsidies. Zbl 1136.91311
Buchbinder, Niv; Lewin-Eytan, Liane; Naor, Joseph (Seffi); Orda, Ariel
3
2008
An \(O(\log ^{2} k)\)-competitive algorithm for metric bipartite matching. Zbl 1151.68742
Bansal, Nikhil; Buchbinder, Niv; Gupta, Anupam; Naor, Joseph (Seffi)
3
2007
\(O(\mathrm{depth})\)-competitive algorithm for online multi-level aggregation. Zbl 1411.68201
Buchbinder, Niv; Feldman, Moran; Naor, Joseph (Seffi); Talmon, Ohad
2
2017
A regularization approach to metrical task systems. Zbl 1306.68211
Abernethy, Jacob; Bartlett, Peter L.; Buchbinder, Niv; Stanton, Isabelle
2
2010
Frequency capping in online advertising (extended abstract). Zbl 1342.68361
Buchbinder, Niv; Feldman, Moran; Ghosh, Arpita; Naor, Joseph (Seffi)
2
2011
Online algorithms for maximum cardinality matching with edge arrivals. Zbl 1442.68270
Buchbinder, Niv; Segev, Danny; Tkach, Yevgeny
2
2017
Online submodular maximization: beating 1/2 made simple. Zbl 1436.90134
Buchbinder, Niv; Feldman, Moran; Filmus, Yuval; Garg, Mohit
2
2019
\(k\)-servers with a smile: online algorithms via projections. Zbl 1431.68160
Buchbinder, Niv; Gupta, Anupam; Molinaro, Marco; Naor, Joseph (Seffi)
2
2019
Online submodular maximization with preemption. Zbl 1453.68216
Buchbinder, Niv; Feldman, Moran; Schwartz, Roy
2
2019
Incentive compatible mulit-unit combinatorial auctions: a primal dual approach. Zbl 1311.91109
Buchbinder, Niv; Gonen, Rica
2
2015
Simplex partitioning via exponential clocks and the multiway-cut problem. Zbl 1397.68220
Buchbinder, Niv; Naor, Joseph; Schwartz, Roy
1
2018
How to allocate goods in an online market? Zbl 1287.91098
Azar, Yossi; Buchbinder, Niv; Jain, Kamal
1
2010
Competitive algorithms for restricted caching and matroid caching. Zbl 1423.68146
Buchbinder, Niv; Chen, Shahar; Naor, Joseph (Seffi)
1
2014
Lower and upper bounds on obtaining history independence. Zbl 1122.68403
Buchbinder, Niv; Petrank, Erez
1
2003
Approximation algorithms for online weighted rank function maximization under matroid constraints. Zbl 1272.90066
Buchbinder, Niv; Naor, Joseph (Seffi); Ravi, R.; Singh, Mohit
1
2012
Online algorithms for maximum cardinality matching with edge arrivals. Zbl 1422.68321
Buchbinder, Niv; Segev, Danny; Tkach, Yevgeny
1
2019
Frequency capping in online advertising. Zbl 1305.90242
Buchbinder, Niv; Feldman, Moran; Ghosh, Arpita; Naor, Joseph
1
2014
Deterministic \((\frac12 + \varepsilon)\)-approximation for submodular maximization over a matroid. Zbl 1431.90125
Buchbinder, Niv; Feldman, Moran; Garg, Mohit
11
2019
Constrained submodular maximization via a nonsymmetric technique. Zbl 1434.68674
Buchbinder, Niv; Feldman, Moran
6
2019
Online submodular maximization: beating 1/2 made simple. Zbl 1436.90134
Buchbinder, Niv; Feldman, Moran; Filmus, Yuval; Garg, Mohit
2
2019
\(k\)-servers with a smile: online algorithms via projections. Zbl 1431.68160
Buchbinder, Niv; Gupta, Anupam; Molinaro, Marco; Naor, Joseph (Seffi)
2
2019
Online submodular maximization with preemption. Zbl 1453.68216
Buchbinder, Niv; Feldman, Moran; Schwartz, Roy
2
2019
Online algorithms for maximum cardinality matching with edge arrivals. Zbl 1422.68321
Buchbinder, Niv; Segev, Danny; Tkach, Yevgeny
1
2019
Deterministic algorithms for submodular maximization problems. Zbl 1454.68170
Buchbinder, Niv; Feldman, Moran
14
2018
Simplex partitioning via exponential clocks and the multiway-cut problem. Zbl 1397.68220
Buchbinder, Niv; Naor, Joseph; Schwartz, Roy
1
2018
Fair coin flipping: tighter analysis and the many-party case. Zbl 1414.94909
Buchbinder, Niv; Haitner, Iftach; Levi, Nissan; Tsfadia, Eliad
8
2017
Comparing apples and oranges: query trade-off in submodular maximization. Zbl 1364.68367
Buchbinder, Niv; Feldman, Moran; Schwartz, Roy
6
2017
Simplex transformations and the multiway cut problem. Zbl 1410.05193
Buchbinder, Niv; Schwartz, Roy; Weizman, Baruch
5
2017
\(O(\mathrm{depth})\)-competitive algorithm for online multi-level aggregation. Zbl 1411.68201
Buchbinder, Niv; Feldman, Moran; Naor, Joseph (Seffi); Talmon, Ohad
2
2017
Online algorithms for maximum cardinality matching with edge arrivals. Zbl 1442.68270
Buchbinder, Niv; Segev, Danny; Tkach, Yevgeny
2
2017
Deterministic algorithms for submodular maximization problems. Zbl 1411.68177
Buchbinder, Niv; Feldman, Moran
11
2016
Unified algorithms for online learning and competitive analysis. Zbl 1335.68196
Buchbinder, Niv; Chen, Shahar; Naor, Joseph (Seffi); Shamir, Ohad
6
2016
A tight linear time (1/2)-approximation for unconstrained submodular maximization. Zbl 1330.68346
Buchbinder, Niv; Feldman, Moran; Seffi, Joseph; Schwartz, Roy
28
2015
Online submodular maximization with preemption. Zbl 1371.68328
Buchbinder, Niv; Feldman, Moran; Schwartz, Roy
14
2015
A polylogarithmic-competitive algorithm for the \(k\)-server problem. Zbl 1426.68294
Bansal, Nikhil; Buchbinder, Niv; Madry, Aleksander; Naor, Joseph (Seffi)
6
2015
Incentive compatible mulit-unit combinatorial auctions: a primal dual approach. Zbl 1311.91109
Buchbinder, Niv; Gonen, Rica
2
2015
Submodular maximization with cardinality constraints. Zbl 1423.90212
Buchbinder, Niv; Feldman, Moran; Naor, Joseph (Seffi); Schwartz, Roy
23
2014
A randomized \(O(\log^2k)\)-competitive algorithm for metric bipartite matching. Zbl 1318.68200
Bansal, Nikhil; Buchbinder, Niv; Gupta, Anupam; Naor, Joseph (seffi)
7
2014
Secretary problems via linear programming. Zbl 1305.90344
Buchbinder, Niv; Jain, Kamal; Singh, Mohit
6
2014
Competitive analysis via regularization. Zbl 1420.68238
Buchbinder, Niv; Chen, Shahar; Naor, Joseph (Seffi)
5
2014
Competitive algorithms for restricted caching and matroid caching. Zbl 1423.68146
Buchbinder, Niv; Chen, Shahar; Naor, Joseph (Seffi)
1
2014
Frequency capping in online advertising. Zbl 1305.90242
Buchbinder, Niv; Feldman, Moran; Ghosh, Arpita; Naor, Joseph
1
2014
Simplex partitioning via exponential clocks and the multiway cut problem. Zbl 1293.05286
Buchbinder, Niv; Naor, Joseph (Seffi); Schwartz, Roy
13
2013
Fair online load balancing. Zbl 1297.68040
Buchbinder, Niv; Naor, Joseph (Seffi)
5
2013
Online make-to-order joint replenishment model: primal-dual competitive algorithms. Zbl 1291.90010
Buchbinder, Niv; Kimbrel, Tracy; Levi, Retsef; Makarychev, Konstantin; Sviridenko, Maxim
3
2013
A primal-dual randomized algorithm for weighted paging. Zbl 1281.68238
Bansal, Nikhil; Buchbinder, Niv; Naor, Joseph (Seffi)
15
2012
Approximation algorithms for online weighted rank function maximization under matroid constraints. Zbl 1272.90066
Buchbinder, Niv; Naor, Joseph (Seffi); Ravi, R.; Singh, Mohit
1
2012
A polylogarithmic-competitive algorithm for the \(k\)-server problem (extended abstract). Zbl 1292.68153
Bansal, Nikhil; Buchbinder, Niv; Mądry, Aleksander; Naor, Joseph
8
2011
Frequency capping in online advertising (extended abstract). Zbl 1342.68361
Buchbinder, Niv; Feldman, Moran; Ghosh, Arpita; Naor, Joseph (Seffi)
2
2011
Secretary problems via linear programming. Zbl 1285.90012
Buchbinder, Niv; Jain, Kamal; Singh, Mohit
6
2010
Towards the randomized \(k\)-server conjecture, a primal-dual approach. Zbl 1288.68283
Bansal, Nikhil; Buchbinder, Niv; Naor, Joseph (Seffi)
4
2010
Non-cooperative cost sharing games via subsidies. Zbl 1203.91012
Buchbinder, Niv; Lewin-Eytan, Liane; Naor, Joseph (Seffi); Orda, Ariel
3
2010
Metrical task systems and the \(k\)-server problem on HSTs. Zbl 1288.68282
Bansal, Nikhil; Buchbinder, Niv; Naor, Joseph (Seffi)
3
2010
A regularization approach to metrical task systems. Zbl 1306.68211
Abernethy, Jacob; Bartlett, Peter L.; Buchbinder, Niv; Stanton, Isabelle
2
2010
How to allocate goods in an online market? Zbl 1287.91098
Azar, Yossi; Buchbinder, Niv; Jain, Kamal
1
2010
Online primal-dual algorithms for covering and packing. Zbl 1216.68335
Buchbinder, Niv; Naor, Joseph (Seffi)
32
2009
The online set cover problem. Zbl 1200.68271
Alon, Noga; Awerbuch, Baruch; Azar, Yossi; Buchbinder, Niv; Naor, Joseph
27
2009
Randomized competitive algorithms for generalized caching. Zbl 1231.68278
Bansal, Nikhil; Buchbinder, Niv; Naor, Joseph (Seffi)
10
2008
Online make-to-order joint replenishment model: Primal dual competitive algorithms. Zbl 1192.90005
Buchbinder, N.; Kimbrel, T.; Levi, R.; Makarychev, K.; Sviridenko, M.
5
2008
Non-cooperative cost sharing games via subsidies. Zbl 1136.91311
Buchbinder, Niv; Lewin-Eytan, Liane; Naor, Joseph (Seffi); Orda, Ariel
3
2008
Online primal-dual algorithms for maximizing ad-auctions revenue. Zbl 1151.68747
Buchbinder, Niv; Jain, Kamal; Naor, Joseph (Seffi)
31
2007
The design of competitive online algorithms via a primal-dual approach. Zbl 1190.68083
Buchbinder, Niv; Naor, Joseph (Seffi)
31
2007
An \(O(\log ^{2} k)\)-competitive algorithm for metric bipartite matching. Zbl 1151.68742
Bansal, Nikhil; Buchbinder, Niv; Gupta, Anupam; Naor, Joseph (Seffi)
3
2007
A general approach to online network optimization problems. Zbl 1321.68509
Alon, Noga; Awerbuch, Baruch; Azar, Yossi; Buchbinder, Niv; Naor, Joseph (Seffi)
20
2006
Online primal-dual algorithms for covering and packing problems. Zbl 1151.68748
Buchbinder, Niv; Naor, Joseph
8
2005
A general approach to online network optimization problems. Zbl 1318.68199
Alon, Noga; Awerbuch, Baruch; Azar, Yossi; Buchbinder, Niv; Naor, Joseph (Seffi)
6
2004
Lower and upper bounds on obtaining history independence. Zbl 1122.68403
Buchbinder, Niv; Petrank, Erez
1
2003
all top 5

Cited by 581 Authors

16 Buchbinder, Niv
11 Naor, Joseph Seffi
10 Xu, Dachuan
8 Feldman, Moran
6 Even, Guy
6 Gupta, Anupam
6 Komm, Dennis
6 Segev, Danny
5 Angelopoulos, Spyros
5 Du, Donglei
5 Medina, Moti
5 Mirrokni, Vahab S.
5 Omri, Eran
5 Rawitz, Dror
5 Schwartz, Roy
5 Williamson, David P.
5 Zhang, Dongmei
4 Albers, Susanne
4 Bampis, Evripidis
4 Bienkowski, Marcin
4 Böckenhauer, Hans-Joachim
4 Chrobak, Marek
4 Dürr, Christoph
4 Epstein, Leah
4 Escoffier, Bruno
4 Guo, Longkun
4 Haitner, Iftach
4 Kawase, Yasushi
4 Makino, Kazuhisa
4 Meyer auf der Heide, Friedhelm
4 Nagarajan, Viswanath
4 Panigrahi, Debmalya
4 Racke, Harald
4 Rauch Henzinger, Monika
4 Wang, Yijing
4 Wu, Weili
4 Yang, Ruiqi
3 Azar, Yossi
3 Böhm, Martin
3 Byrka, Jarosław
3 Caragiannis, Ioannis
3 Chiplunkar, Ashish
3 Ciocan, Dragos Florin
3 Czumaj, Artur
3 Goel, Ashish
3 Gong, Suning
3 Han, Xin
3 Jaillet, Patrick
3 Jiang, Yanjun
3 Karbasi, Amin
3 Levin, Asaf
3 Markarian, Christine
3 Neiman, Ofer
3 Nong, Qingqin
3 Patt-Shamir, Boaz
3 Poloczek, Matthias
3 Pruhs, Kirk R.
3 Teiller, Alexandre
3 Umboh, Seeun William
3 Wang, Yishui
3 Xu, Yao
3 Zenklusen, Rico
2 Abraham, Ittai
2 Adamaszek, Anna
2 Ahmed, Shabbir
2 Antoniadis, Antonios Foivos
2 Bansal, Nikhil
2 Barcelo, Neal
2 Bhattacharya, Sayan
2 Borodin, Allan B.
2 Boyar, Joan F.
2 Bruggmann, Simon
2 Chang, Hong
2 Chekuri, Chandra S.
2 Chen, Ling
2 Cheung, Maurice
2 Cohen, Ran
2 Cui, Min
2 Du, Ding-Zhu
2 Dumitrescu, Adrian
2 Elmachtoub, Adam N.
2 Englert, Matthias
2 Fang, Jiazhu
2 Favrholdt, Lene Monrad
2 Feng, Yan
2 Filmus, Yuval
2 Filtser, Arnold
2 Folwarczný, Lukáš
2 Fotakis, Dimitris A.
2 Gao, Suixiang
2 Gu, Shuyang
2 Halldórsson, Magnús Mar
2 Hromkovič, Juraj
2 Im, Sungjin
2 Imreh, Csanád
2 Italiano, Giuseppe Francesco
2 Jacobson, Sheldon H.
2 Jeż, Łukasz
2 Jin, Shendan
2 Jones, Brant C.
...and 481 more Authors
all top 5

Cited in 45 Serials

35 Algorithmica
28 Theoretical Computer Science
15 SIAM Journal on Computing
14 Mathematics of Operations Research
14 Operations Research
14 Theory of Computing Systems
12 Journal of Combinatorial Optimization
11 Mathematical Programming. Series A. Series B
5 Operations Research Letters
5 European Journal of Operational Research
5 Discrete Mathematics, Algorithms and Applications
4 Journal of Computer and System Sciences
4 Computers & Operations Research
4 Journal of the Operations Research Society of China
3 Artificial Intelligence
3 Information and Computation
3 Asia-Pacific Journal of Operational Research
3 Journal of Cryptology
2 Discrete Applied Mathematics
2 Discrete Mathematics
2 SIAM Journal on Discrete Mathematics
2 Journal of Global Optimization
2 Games and Economic Behavior
2 Journal of Scheduling
2 Discrete Optimization
1 Advances in Applied Probability
1 Information Processing Letters
1 The Annals of Statistics
1 SIAM Journal on Numerical Analysis
1 Combinatorica
1 Discrete & Computational Geometry
1 Discrete Event Dynamic Systems
1 Automation and Remote Control
1 Distributed Computing
1 SIAM Journal on Optimization
1 The Journal of Artificial Intelligence Research (JAIR)
1 INFORMS Journal on Computing
1 Optimization and Engineering
1 Journal of Machine Learning Research (JMLR)
1 ACM Journal of Experimental Algorithmics
1 Nonlinear Analysis. Hybrid Systems
1 ACM Transactions on Algorithms
1 Theory of Computing
1 Stochastic Systems
1 Computer Science Review

Citations by Year