BibTeX records: Niv Buchbinder

download as .bib file

@article{DBLP:journals/mp/BuchbinderCN23,
  author       = {Niv Buchbinder and
                  Christian Coester and
                  Joseph Naor},
  title        = {Online k-taxi via Double Coverage and time-reverse primal-dual},
  journal      = {Math. Program.},
  volume       = {197},
  number       = {2},
  pages        = {499--527},
  year         = {2023},
  url          = {https://doi.org/10.1007/s10107-022-01815-6},
  doi          = {10.1007/S10107-022-01815-6},
  timestamp    = {Tue, 28 Feb 2023 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/mp/BuchbinderCN23.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/BuchbinderFG23,
  author       = {Niv Buchbinder and
                  Moran Feldman and
                  Mohit Garg},
  title        = {Deterministic {\textbackslash}({\textbackslash}boldsymbol\{({\textbackslash}unicode\{x00BD\}+{\textbackslash}varepsilon)\}{\textbackslash})
                  -Approximation for Submodular Maximization over a Matroid},
  journal      = {{SIAM} J. Comput.},
  volume       = {52},
  number       = {4},
  pages        = {945--967},
  year         = {2023},
  url          = {https://doi.org/10.1137/19m125515x},
  doi          = {10.1137/19M125515X},
  timestamp    = {Thu, 31 Aug 2023 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/siamcomp/BuchbinderFG23.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/BhattacharyaBLS23,
  author       = {Sayan Bhattacharya and
                  Niv Buchbinder and
                  Roie Levin and
                  Thatchaphol Saranurak},
  title        = {Chasing Positive Bodies},
  booktitle    = {64th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
                  2023, Santa Cruz, CA, USA, November 6-9, 2023},
  pages        = {1694--1714},
  publisher    = {{IEEE}},
  year         = {2023},
  url          = {https://doi.org/10.1109/FOCS57990.2023.00103},
  doi          = {10.1109/FOCS57990.2023.00103},
  timestamp    = {Mon, 05 Feb 2024 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/focs/BhattacharyaBLS23.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/BuchbinderNW23,
  author       = {Niv Buchbinder and
                  Joseph (Seffi) Naor and
                  David Wajc},
  editor       = {Nikhil Bansal and
                  Viswanath Nagarajan},
  title        = {Lossless Online Rounding for Online Bipartite Matching (Despite its
                  Impossibility)},
  booktitle    = {Proceedings of the 2023 {ACM-SIAM} Symposium on Discrete Algorithms,
                  {SODA} 2023, Florence, Italy, January 22-25, 2023},
  pages        = {2030--2068},
  publisher    = {{SIAM}},
  year         = {2023},
  url          = {https://doi.org/10.1137/1.9781611977554.ch78},
  doi          = {10.1137/1.9781611977554.CH78},
  timestamp    = {Fri, 17 Feb 2023 09:28:57 +0100},
  biburl       = {https://dblp.org/rec/conf/soda/BuchbinderNW23.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2304-01889,
  author       = {Sayan Bhattacharya and
                  Niv Buchbinder and
                  Roie Levin and
                  Thatchaphol Saranurak},
  title        = {Chasing Positive Bodies},
  journal      = {CoRR},
  volume       = {abs/2304.01889},
  year         = {2023},
  url          = {https://doi.org/10.48550/arXiv.2304.01889},
  doi          = {10.48550/ARXIV.2304.01889},
  eprinttype    = {arXiv},
  eprint       = {2304.01889},
  timestamp    = {Sun, 12 Nov 2023 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/corr/abs-2304-01889.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2309-10214,
  author       = {Niv Buchbinder and
                  Anupam Gupta and
                  Daniel Hathcock and
                  Anna R. Karlin and
                  Sherry Sarkar},
  title        = {Maintaining Matroid Intersections Online},
  journal      = {CoRR},
  volume       = {abs/2309.10214},
  year         = {2023},
  url          = {https://doi.org/10.48550/arXiv.2309.10214},
  doi          = {10.48550/ARXIV.2309.10214},
  eprinttype    = {arXiv},
  eprint       = {2309.10214},
  timestamp    = {Mon, 25 Sep 2023 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/abs-2309-10214.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2311-01129,
  author       = {Niv Buchbinder and
                  Moran Feldman},
  title        = {Constrained Submodular Maximization via New Bounds for DR-Submodular
                  Functions},
  journal      = {CoRR},
  volume       = {abs/2311.01129},
  year         = {2023},
  url          = {https://doi.org/10.48550/arXiv.2311.01129},
  doi          = {10.48550/ARXIV.2311.01129},
  eprinttype    = {arXiv},
  eprint       = {2311.01129},
  timestamp    = {Tue, 07 Nov 2023 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/corr/abs-2311-01129.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/soda/2022,
  editor       = {Joseph (Seffi) Naor and
                  Niv Buchbinder},
  title        = {Proceedings of the 2022 {ACM-SIAM} Symposium on Discrete Algorithms,
                  {SODA} 2022, Virtual Conference / Alexandria, VA, USA, January 9 -
                  12, 2022},
  publisher    = {{SIAM}},
  year         = {2022},
  url          = {https://doi.org/10.1137/1.9781611977073},
  doi          = {10.1137/1.9781611977073},
  isbn         = {978-1-61197-707-3},
  timestamp    = {Tue, 12 Apr 2022 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/soda/2022.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mor/BuchbinderSW21,
  author       = {Niv Buchbinder and
                  Roy Schwartz and
                  Baruch Weizman},
  title        = {Simplex Transformations and the Multiway Cut Problem},
  journal      = {Math. Oper. Res.},
  volume       = {46},
  number       = {2},
  pages        = {757--771},
  year         = {2021},
  url          = {https://doi.org/10.1287/moor.2020.1073},
  doi          = {10.1287/MOOR.2020.1073},
  timestamp    = {Thu, 16 Sep 2021 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/mor/BuchbinderSW21.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/innovations/BubeckBCS21,
  author       = {S{\'{e}}bastien Bubeck and
                  Niv Buchbinder and
                  Christian Coester and
                  Mark Sellke},
  editor       = {James R. Lee},
  title        = {Metrical Service Systems with Transformations},
  booktitle    = {12th Innovations in Theoretical Computer Science Conference, {ITCS}
                  2021, January 6-8, 2021, Virtual Conference},
  series       = {LIPIcs},
  volume       = {185},
  pages        = {21:1--21:20},
  publisher    = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
  year         = {2021},
  url          = {https://doi.org/10.4230/LIPIcs.ITCS.2021.21},
  doi          = {10.4230/LIPICS.ITCS.2021.21},
  timestamp    = {Sat, 30 Sep 2023 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/innovations/BubeckBCS21.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ipco/BuchbinderCN21,
  author       = {Niv Buchbinder and
                  Christian Coester and
                  Joseph (Seffi) Naor},
  editor       = {Mohit Singh and
                  David P. Williamson},
  title        = {Online k-Taxi via Double Coverage and Time-Reverse Primal-Dual},
  booktitle    = {Integer Programming and Combinatorial Optimization - 22nd International
                  Conference, {IPCO} 2021, Atlanta, GA, USA, May 19-21, 2021, Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {12707},
  pages        = {15--29},
  publisher    = {Springer},
  year         = {2021},
  url          = {https://doi.org/10.1007/978-3-030-73879-2\_2},
  doi          = {10.1007/978-3-030-73879-2\_2},
  timestamp    = {Mon, 26 Jun 2023 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/ipco/BuchbinderCN21.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sigmetrics/BuchbinderFMMN21,
  author       = {Niv Buchbinder and
                  Yaron Fairstein and
                  Konstantina Mellou and
                  Ishai Menache and
                  Joseph (Seffi) Naor},
  editor       = {Longbo Huang and
                  Anshul Gandhi and
                  Negar Kiyavash and
                  Jia Wang},
  title        = {Online Virtual Machine Allocation with Lifetime and Load Predictions},
  booktitle    = {{SIGMETRICS} '21: {ACM} {SIGMETRICS} / International Conference on
                  Measurement and Modeling of Computer Systems, Virtual Event, China,
                  June 14-18, 2021},
  pages        = {9--10},
  publisher    = {{ACM}},
  year         = {2021},
  url          = {https://doi.org/10.1145/3410220.3456278},
  doi          = {10.1145/3410220.3456278},
  timestamp    = {Mon, 07 Jun 2021 12:10:45 +0200},
  biburl       = {https://dblp.org/rec/conf/sigmetrics/BuchbinderFMMN21.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2104-08820,
  author       = {Niv Buchbinder and
                  Iftach Haitner and
                  Nissan Levi and
                  Eliad Tsfadia},
  title        = {Fair Coin Flipping: Tighter Analysis and the Many-Party Case},
  journal      = {CoRR},
  volume       = {abs/2104.08820},
  year         = {2021},
  url          = {https://arxiv.org/abs/2104.08820},
  eprinttype    = {arXiv},
  eprint       = {2104.08820},
  timestamp    = {Mon, 26 Apr 2021 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/abs-2104-08820.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2106-04863,
  author       = {Niv Buchbinder and
                  Joseph Naor and
                  David Wajc},
  title        = {A Randomness Threshold for Online Bipartite Matching, via Lossless
                  Online Rounding},
  journal      = {CoRR},
  volume       = {abs/2106.04863},
  year         = {2021},
  url          = {https://arxiv.org/abs/2106.04863},
  eprinttype    = {arXiv},
  eprint       = {2106.04863},
  timestamp    = {Tue, 15 Jun 2021 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/abs-2106-04863.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mp/BuchbinderFFG20,
  author       = {Niv Buchbinder and
                  Moran Feldman and
                  Yuval Filmus and
                  Mohit Garg},
  title        = {Online submodular maximization: beating 1/2 made simple},
  journal      = {Math. Program.},
  volume       = {183},
  number       = {1},
  pages        = {149--169},
  year         = {2020},
  url          = {https://doi.org/10.1007/s10107-019-01459-z},
  doi          = {10.1007/S10107-019-01459-Z},
  timestamp    = {Thu, 25 Mar 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/mp/BuchbinderFFG20.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2009-08266,
  author       = {S{\'{e}}bastien Bubeck and
                  Niv Buchbinder and
                  Christian Coester and
                  Mark Sellke},
  title        = {Metrical Service Systems with Transformations},
  journal      = {CoRR},
  volume       = {abs/2009.08266},
  year         = {2020},
  url          = {https://arxiv.org/abs/2009.08266},
  eprinttype    = {arXiv},
  eprint       = {2009.08266},
  timestamp    = {Wed, 23 Sep 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/abs-2009-08266.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2011-06250,
  author       = {Niv Buchbinder and
                  Yaron Fairstein and
                  Konstantina Mellou and
                  Ishai Menache and
                  Joseph Naor},
  title        = {Online Virtual Machine Allocation with Predictions},
  journal      = {CoRR},
  volume       = {abs/2011.06250},
  year         = {2020},
  url          = {https://arxiv.org/abs/2011.06250},
  eprinttype    = {arXiv},
  eprint       = {2011.06250},
  timestamp    = {Wed, 18 Nov 2020 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/corr/abs-2011-06250.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2012-02226,
  author       = {Niv Buchbinder and
                  Christian Coester and
                  Joseph Naor},
  title        = {Online k-Taxi via Double Coverage and Time-Reverse Primal-Dual},
  journal      = {CoRR},
  volume       = {abs/2012.02226},
  year         = {2020},
  url          = {https://arxiv.org/abs/2012.02226},
  eprinttype    = {arXiv},
  eprint       = {2012.02226},
  timestamp    = {Wed, 09 Dec 2020 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/corr/abs-2012-02226.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/BuchbinderST19,
  author       = {Niv Buchbinder and
                  Danny Segev and
                  Yevgeny Tkach},
  title        = {Online Algorithms for Maximum Cardinality Matching with Edge Arrivals},
  journal      = {Algorithmica},
  volume       = {81},
  number       = {5},
  pages        = {1781--1799},
  year         = {2019},
  url          = {https://doi.org/10.1007/s00453-018-0505-7},
  doi          = {10.1007/S00453-018-0505-7},
  timestamp    = {Fri, 31 May 2019 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/algorithmica/BuchbinderST19.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mor/BuchbinderF19,
  author       = {Niv Buchbinder and
                  Moran Feldman},
  title        = {Constrained Submodular Maximization via a Nonsymmetric Technique},
  journal      = {Math. Oper. Res.},
  volume       = {44},
  number       = {3},
  pages        = {988--1005},
  year         = {2019},
  url          = {https://doi.org/10.1287/moor.2018.0955},
  doi          = {10.1287/MOOR.2018.0955},
  timestamp    = {Thu, 05 Sep 2019 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/mor/BuchbinderF19.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/orl/BuchbinderSW19,
  author       = {Niv Buchbinder and
                  Roy Schwartz and
                  Baruch Weizman},
  title        = {A simple algorithm for the multiway cut problem},
  journal      = {Oper. Res. Lett.},
  volume       = {47},
  number       = {6},
  pages        = {587--593},
  year         = {2019},
  url          = {https://doi.org/10.1016/j.orl.2019.09.012},
  doi          = {10.1016/J.ORL.2019.09.012},
  timestamp    = {Wed, 23 Dec 2020 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/orl/BuchbinderSW19.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/BuchbinderFS19,
  author       = {Niv Buchbinder and
                  Moran Feldman and
                  Roy Schwartz},
  title        = {Online Submodular Maximization with Preemption},
  journal      = {{ACM} Trans. Algorithms},
  volume       = {15},
  number       = {3},
  pages        = {30:1--30:31},
  year         = {2019},
  url          = {https://doi.org/10.1145/3309764},
  doi          = {10.1145/3309764},
  timestamp    = {Sat, 08 Jan 2022 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/talg/BuchbinderFS19.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ipco/BuchbinderFF019,
  author       = {Niv Buchbinder and
                  Moran Feldman and
                  Yuval Filmus and
                  Mohit Garg},
  editor       = {Andrea Lodi and
                  Viswanath Nagarajan},
  title        = {Online Submodular Maximization: Beating 1/2 Made Simple},
  booktitle    = {Integer Programming and Combinatorial Optimization - 20th International
                  Conference, {IPCO} 2019, Ann Arbor, MI, USA, May 22-24, 2019, Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {11480},
  pages        = {101--114},
  publisher    = {Springer},
  year         = {2019},
  url          = {https://doi.org/10.1007/978-3-030-17953-3\_8},
  doi          = {10.1007/978-3-030-17953-3\_8},
  timestamp    = {Thu, 25 Mar 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/ipco/BuchbinderFF019.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/BuchbinderGMN19,
  author       = {Niv Buchbinder and
                  Anupam Gupta and
                  Marco Molinaro and
                  Joseph (Seffi) Naor},
  editor       = {Timothy M. Chan},
  title        = {k-Servers with a Smile: Online Algorithms via Projections},
  booktitle    = {Proceedings of the Thirtieth Annual {ACM-SIAM} Symposium on Discrete
                  Algorithms, {SODA} 2019, San Diego, California, USA, January 6-9,
                  2019},
  pages        = {98--116},
  publisher    = {{SIAM}},
  year         = {2019},
  url          = {https://doi.org/10.1137/1.9781611975482.7},
  doi          = {10.1137/1.9781611975482.7},
  timestamp    = {Sat, 05 Mar 2022 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/soda/BuchbinderGMN19.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/BuchbinderF019,
  author       = {Niv Buchbinder and
                  Moran Feldman and
                  Mohit Garg},
  editor       = {Timothy M. Chan},
  title        = {Deterministic ({\textonehalf} + {\(\epsilon\)})-Approximation for
                  Submodular Maximization over a Matroid},
  booktitle    = {Proceedings of the Thirtieth Annual {ACM-SIAM} Symposium on Discrete
                  Algorithms, {SODA} 2019, San Diego, California, USA, January 6-9,
                  2019},
  pages        = {241--254},
  publisher    = {{SIAM}},
  year         = {2019},
  url          = {https://doi.org/10.1137/1.9781611975482.16},
  doi          = {10.1137/1.9781611975482.16},
  timestamp    = {Thu, 15 Jul 2021 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/soda/BuchbinderF019.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/BuchbinderNS18,
  author       = {Niv Buchbinder and
                  Joseph (Seffi) Naor and
                  Roy Schwartz},
  title        = {Simplex Partitioning via Exponential Clocks and the Multiway-Cut Problem},
  journal      = {{SIAM} J. Comput.},
  volume       = {47},
  number       = {4},
  pages        = {1463--1482},
  year         = {2018},
  url          = {https://doi.org/10.1137/15M1045521},
  doi          = {10.1137/15M1045521},
  timestamp    = {Mon, 28 Aug 2023 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/siamcomp/BuchbinderNS18.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/BuchbinderF18,
  author       = {Niv Buchbinder and
                  Moran Feldman},
  title        = {Deterministic Algorithms for Submodular Maximization Problems},
  journal      = {{ACM} Trans. Algorithms},
  volume       = {14},
  number       = {3},
  pages        = {32:1--32:20},
  year         = {2018},
  url          = {https://doi.org/10.1145/3184990},
  doi          = {10.1145/3184990},
  timestamp    = {Wed, 25 Sep 2019 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/talg/BuchbinderF18.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@incollection{DBLP:books/tf/18/BuchbinderF18,
  author       = {Niv Buchbinder and
                  Moran Feldman},
  editor       = {Teofilo F. Gonzalez},
  title        = {Submodular Functions Maximization Problems},
  booktitle    = {Handbook of Approximation Algorithms and Metaheuristics, Second Edition,
                  Volume 1: Methologies and Traditional Applications},
  pages        = {753--788},
  publisher    = {Chapman and Hall/CRC},
  year         = {2018},
  url          = {https://doi.org/10.1201/9781351236423-42},
  doi          = {10.1201/9781351236423-42},
  timestamp    = {Mon, 28 Oct 2019 16:49:19 +0100},
  biburl       = {https://dblp.org/rec/books/tf/18/BuchbinderF18.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1807-05529,
  author       = {Niv Buchbinder and
                  Moran Feldman and
                  Mohit Garg},
  title        = {Online Submodular Maximization: Beating 1/2 Made Simple},
  journal      = {CoRR},
  volume       = {abs/1807.05529},
  year         = {2018},
  url          = {http://arxiv.org/abs/1807.05529},
  eprinttype    = {arXiv},
  eprint       = {1807.05529},
  timestamp    = {Thu, 25 Mar 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/corr/abs-1807-05529.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1807-05532,
  author       = {Niv Buchbinder and
                  Moran Feldman and
                  Mohit Garg},
  title        = {Deterministic {(1/2} + {\(\epsilon\)})-Approximation for Submodular
                  Maximization over a Matroid},
  journal      = {CoRR},
  volume       = {abs/1807.05532},
  year         = {2018},
  url          = {http://arxiv.org/abs/1807.05532},
  eprinttype    = {arXiv},
  eprint       = {1807.05532},
  timestamp    = {Thu, 25 Mar 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/corr/abs-1807-05532.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1810-07508,
  author       = {Niv Buchbinder and
                  Anupam Gupta and
                  Marco Molinaro and
                  Joseph Naor},
  title        = {k-Servers with a Smile: Online Algorithms via Projections},
  journal      = {CoRR},
  volume       = {abs/1810.07508},
  year         = {2018},
  url          = {http://arxiv.org/abs/1810.07508},
  eprinttype    = {arXiv},
  eprint       = {1810.07508},
  timestamp    = {Sat, 05 Mar 2022 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/corr/abs-1810-07508.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mor/BuchbinderFS17,
  author       = {Niv Buchbinder and
                  Moran Feldman and
                  Roy Schwartz},
  title        = {Comparing Apples and Oranges: Query Trade-off in Submodular Maximization},
  journal      = {Math. Oper. Res.},
  volume       = {42},
  number       = {2},
  pages        = {308--329},
  year         = {2017},
  url          = {https://doi.org/10.1287/moor.2016.0809},
  doi          = {10.1287/MOOR.2016.0809},
  timestamp    = {Wed, 23 Dec 2020 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/mor/BuchbinderFS17.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/esa/BuchbinderST17,
  author       = {Niv Buchbinder and
                  Danny Segev and
                  Yevgeny Tkach},
  editor       = {Kirk Pruhs and
                  Christian Sohler},
  title        = {Online Algorithms for Maximum Cardinality Matching with Edge Arrivals},
  booktitle    = {25th Annual European Symposium on Algorithms, {ESA} 2017, September
                  4-6, 2017, Vienna, Austria},
  series       = {LIPIcs},
  volume       = {87},
  pages        = {22:1--22:14},
  publisher    = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
  year         = {2017},
  url          = {https://doi.org/10.4230/LIPIcs.ESA.2017.22},
  doi          = {10.4230/LIPICS.ESA.2017.22},
  timestamp    = {Tue, 11 Feb 2020 15:52:14 +0100},
  biburl       = {https://dblp.org/rec/conf/esa/BuchbinderST17.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/BuchbinderFNT17,
  author       = {Niv Buchbinder and
                  Moran Feldman and
                  Joseph (Seffi) Naor and
                  Ohad Talmon},
  editor       = {Philip N. Klein},
  title        = {\emph{O}(depth)-Competitive Algorithm for Online Multi-level Aggregation},
  booktitle    = {Proceedings of the Twenty-Eighth Annual {ACM-SIAM} Symposium on Discrete
                  Algorithms, {SODA} 2017, Barcelona, Spain, Hotel Porta Fira, January
                  16-19},
  pages        = {1235--1244},
  publisher    = {{SIAM}},
  year         = {2017},
  url          = {https://doi.org/10.1137/1.9781611974782.80},
  doi          = {10.1137/1.9781611974782.80},
  timestamp    = {Tue, 02 Feb 2021 17:07:33 +0100},
  biburl       = {https://dblp.org/rec/conf/soda/BuchbinderFNT17.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/BuchbinderSW17,
  author       = {Niv Buchbinder and
                  Roy Schwartz and
                  Baruch Weizman},
  editor       = {Philip N. Klein},
  title        = {Simplex Transformations and the Multiway Cut Problem},
  booktitle    = {Proceedings of the Twenty-Eighth Annual {ACM-SIAM} Symposium on Discrete
                  Algorithms, {SODA} 2017, Barcelona, Spain, Hotel Porta Fira, January
                  16-19},
  pages        = {2400--2410},
  publisher    = {{SIAM}},
  year         = {2017},
  url          = {https://doi.org/10.1137/1.9781611974782.158},
  doi          = {10.1137/1.9781611974782.158},
  timestamp    = {Tue, 02 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/soda/BuchbinderSW17.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/BuchbinderHLT17,
  author       = {Niv Buchbinder and
                  Iftach Haitner and
                  Nissan Levi and
                  Eliad Tsfadia},
  editor       = {Philip N. Klein},
  title        = {Fair Coin Flipping: Tighter Analysis and the Many-Party Case},
  booktitle    = {Proceedings of the Twenty-Eighth Annual {ACM-SIAM} Symposium on Discrete
                  Algorithms, {SODA} 2017, Barcelona, Spain, Hotel Porta Fira, January
                  16-19},
  pages        = {2580--2600},
  publisher    = {{SIAM}},
  year         = {2017},
  url          = {https://doi.org/10.1137/1.9781611974782.170},
  doi          = {10.1137/1.9781611974782.170},
  timestamp    = {Tue, 02 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/soda/BuchbinderHLT17.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/BuchbinderFNT17,
  author       = {Niv Buchbinder and
                  Moran Feldman and
                  Joseph Naor and
                  Ohad Talmon},
  title        = {O(depth)-Competitive Algorithm for Online Multi-level Aggregation},
  journal      = {CoRR},
  volume       = {abs/1701.01936},
  year         = {2017},
  url          = {http://arxiv.org/abs/1701.01936},
  eprinttype    = {arXiv},
  eprint       = {1701.01936},
  timestamp    = {Tue, 17 Sep 2019 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/BuchbinderFNT17.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/shonan-reports/BuchbinderDP17,
  author       = {Niv Buchbinder and
                  Nikhil R. Devanur and
                  Debmalya Panigrahi},
  title        = {Algorithms and Optimization under Uncertainty {(NII} Shonan Meeting
                  2017-5)},
  journal      = {{NII} Shonan Meet. Rep.},
  volume       = {2017},
  year         = {2017},
  url          = {https://shonan.nii.ac.jp/seminars/094/},
  timestamp    = {Thu, 04 Mar 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/shonan-reports/BuchbinderDP17.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/AzarBJ16,
  author       = {Yossi Azar and
                  Niv Buchbinder and
                  Kamal Jain},
  title        = {How to Allocate Goods in an Online Market?},
  journal      = {Algorithmica},
  volume       = {74},
  number       = {2},
  pages        = {589--601},
  year         = {2016},
  url          = {https://doi.org/10.1007/s00453-014-9964-7},
  doi          = {10.1007/S00453-014-9964-7},
  timestamp    = {Fri, 30 Nov 2018 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/algorithmica/AzarBJ16.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mor/BuchbinderCNS16,
  author       = {Niv Buchbinder and
                  Shahar Chen and
                  Joseph Naor and
                  Ohad Shamir},
  title        = {Unified Algorithms for Online Learning and Competitive Analysis},
  journal      = {Math. Oper. Res.},
  volume       = {41},
  number       = {2},
  pages        = {612--625},
  year         = {2016},
  url          = {https://doi.org/10.1287/moor.2015.0742},
  doi          = {10.1287/MOOR.2015.0742},
  timestamp    = {Fri, 30 Nov 2018 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/mor/BuchbinderCNS16.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/AzarBCCCG0KNNP16,
  author       = {Yossi Azar and
                  Niv Buchbinder and
                  T.{-}H. Hubert Chan and
                  Shahar Chen and
                  Ilan Reuven Cohen and
                  Anupam Gupta and
                  Zhiyi Huang and
                  Ning Kang and
                  Viswanath Nagarajan and
                  Joseph Naor and
                  Debmalya Panigrahi},
  editor       = {Irit Dinur},
  title        = {Online Algorithms for Covering and Packing Problems with Convex Objectives},
  booktitle    = {{IEEE} 57th Annual Symposium on Foundations of Computer Science, {FOCS}
                  2016, 9-11 October 2016, Hyatt Regency, New Brunswick, New Jersey,
                  {USA}},
  pages        = {148--157},
  publisher    = {{IEEE} Computer Society},
  year         = {2016},
  url          = {https://doi.org/10.1109/FOCS.2016.24},
  doi          = {10.1109/FOCS.2016.24},
  timestamp    = {Thu, 23 Mar 2023 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/focs/AzarBCCCG0KNNP16.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/BuchbinderF16,
  author       = {Niv Buchbinder and
                  Moran Feldman},
  editor       = {Robert Krauthgamer},
  title        = {Deterministic Algorithms for Submodular Maximization Problems},
  booktitle    = {Proceedings of the Twenty-Seventh Annual {ACM-SIAM} Symposium on Discrete
                  Algorithms, {SODA} 2016, Arlington, VA, USA, January 10-12, 2016},
  pages        = {392--403},
  publisher    = {{SIAM}},
  year         = {2016},
  url          = {https://doi.org/10.1137/1.9781611974331.ch29},
  doi          = {10.1137/1.9781611974331.CH29},
  timestamp    = {Tue, 02 Feb 2021 17:07:56 +0100},
  biburl       = {https://dblp.org/rec/conf/soda/BuchbinderF16.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/BuchbinderF16,
  author       = {Niv Buchbinder and
                  Moran Feldman},
  title        = {Constrained Submodular Maximization via a Non-symmetric Technique},
  journal      = {CoRR},
  volume       = {abs/1611.03253},
  year         = {2016},
  url          = {http://arxiv.org/abs/1611.03253},
  eprinttype    = {arXiv},
  eprint       = {1611.03253},
  timestamp    = {Tue, 17 Sep 2019 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/BuchbinderF16.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/BuchbinderG15,
  author       = {Niv Buchbinder and
                  Rica Gonen},
  title        = {Incentive Compatible Mulit-Unit Combinatorial Auctions: {A} Primal
                  Dual Approach},
  journal      = {Algorithmica},
  volume       = {72},
  number       = {1},
  pages        = {167--190},
  year         = {2015},
  url          = {https://doi.org/10.1007/s00453-013-9854-4},
  doi          = {10.1007/S00453-013-9854-4},
  timestamp    = {Fri, 30 Nov 2018 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/algorithmica/BuchbinderG15.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/BansalBMN15,
  author       = {Nikhil Bansal and
                  Niv Buchbinder and
                  Aleksander Madry and
                  Joseph Naor},
  title        = {A Polylogarithmic-Competitive Algorithm for the \emph{k}-Server Problem},
  journal      = {J. {ACM}},
  volume       = {62},
  number       = {5},
  pages        = {40:1--40:49},
  year         = {2015},
  url          = {https://doi.org/10.1145/2783434},
  doi          = {10.1145/2783434},
  timestamp    = {Tue, 15 Feb 2022 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/jacm/BansalBMN15.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/BuchbinderFNS15,
  author       = {Niv Buchbinder and
                  Moran Feldman and
                  Joseph Naor and
                  Roy Schwartz},
  title        = {A Tight Linear Time (1/2)-Approximation for Unconstrained Submodular
                  Maximization},
  journal      = {{SIAM} J. Comput.},
  volume       = {44},
  number       = {5},
  pages        = {1384--1402},
  year         = {2015},
  url          = {https://doi.org/10.1137/130929205},
  doi          = {10.1137/130929205},
  timestamp    = {Wed, 23 Dec 2020 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/siamcomp/BuchbinderFNS15.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/BuchbinderFS15,
  author       = {Niv Buchbinder and
                  Moran Feldman and
                  Roy Schwartz},
  editor       = {Piotr Indyk},
  title        = {Comparing Apples and Oranges: Query Tradeoff in Submodular Maximization},
  booktitle    = {Proceedings of the Twenty-Sixth Annual {ACM-SIAM} Symposium on Discrete
                  Algorithms, {SODA} 2015, San Diego, CA, USA, January 4-6, 2015},
  pages        = {1149--1168},
  publisher    = {{SIAM}},
  year         = {2015},
  url          = {https://doi.org/10.1137/1.9781611973730.77},
  doi          = {10.1137/1.9781611973730.77},
  timestamp    = {Tue, 02 Feb 2021 17:07:30 +0100},
  biburl       = {https://dblp.org/rec/conf/soda/BuchbinderFS15.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/BuchbinderFS15a,
  author       = {Niv Buchbinder and
                  Moran Feldman and
                  Roy Schwartz},
  editor       = {Piotr Indyk},
  title        = {Online Submodular Maximization with Preemption},
  booktitle    = {Proceedings of the Twenty-Sixth Annual {ACM-SIAM} Symposium on Discrete
                  Algorithms, {SODA} 2015, San Diego, CA, USA, January 4-6, 2015},
  pages        = {1202--1216},
  publisher    = {{SIAM}},
  year         = {2015},
  url          = {https://doi.org/10.1137/1.9781611973730.80},
  doi          = {10.1137/1.9781611973730.80},
  timestamp    = {Tue, 02 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/soda/BuchbinderFS15a.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/BuchbinderFS15,
  author       = {Niv Buchbinder and
                  Moran Feldman and
                  Roy Schwartz},
  title        = {Online Submodular Maximization with Preemption},
  journal      = {CoRR},
  volume       = {abs/1501.05801},
  year         = {2015},
  url          = {http://arxiv.org/abs/1501.05801},
  eprinttype    = {arXiv},
  eprint       = {1501.05801},
  timestamp    = {Wed, 23 Dec 2020 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/corr/BuchbinderFS15.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/BuchbinderF15,
  author       = {Niv Buchbinder and
                  Moran Feldman},
  title        = {Deterministic Algorithms for Submodular Maximization Problems},
  journal      = {CoRR},
  volume       = {abs/1508.02157},
  year         = {2015},
  url          = {http://arxiv.org/abs/1508.02157},
  eprinttype    = {arXiv},
  eprint       = {1508.02157},
  timestamp    = {Tue, 17 Sep 2019 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/BuchbinderF15.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/BansalBGN14,
  author       = {Nikhil Bansal and
                  Niv Buchbinder and
                  Anupam Gupta and
                  Joseph Naor},
  title        = {A Randomized O(log2 k)-Competitive Algorithm for Metric Bipartite
                  Matching},
  journal      = {Algorithmica},
  volume       = {68},
  number       = {2},
  pages        = {390--403},
  year         = {2014},
  url          = {https://doi.org/10.1007/s00453-012-9676-9},
  doi          = {10.1007/S00453-012-9676-9},
  timestamp    = {Tue, 15 Feb 2022 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/algorithmica/BansalBGN14.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mor/BuchbinderJS14,
  author       = {Niv Buchbinder and
                  Kamal Jain and
                  Mohit Singh},
  title        = {Secretary Problems via Linear Programming},
  journal      = {Math. Oper. Res.},
  volume       = {39},
  number       = {1},
  pages        = {190--206},
  year         = {2014},
  url          = {https://doi.org/10.1287/moor.2013.0604},
  doi          = {10.1287/MOOR.2013.0604},
  timestamp    = {Fri, 30 Nov 2018 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/mor/BuchbinderJS14.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/scheduling/BuchbinderFGN14,
  author       = {Niv Buchbinder and
                  Moran Feldman and
                  Arpita Ghosh and
                  Joseph Naor},
  title        = {Frequency capping in online advertising},
  journal      = {J. Sched.},
  volume       = {17},
  number       = {4},
  pages        = {385--398},
  year         = {2014},
  url          = {https://doi.org/10.1007/s10951-014-0367-z},
  doi          = {10.1007/S10951-014-0367-Z},
  timestamp    = {Wed, 01 Apr 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/scheduling/BuchbinderFGN14.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/esa/BuchbinderCN14,
  author       = {Niv Buchbinder and
                  Shahar Chen and
                  Joseph Naor},
  editor       = {Andreas S. Schulz and
                  Dorothea Wagner},
  title        = {Competitive Algorithms for Restricted Caching and Matroid Caching},
  booktitle    = {Algorithms - {ESA} 2014 - 22th Annual European Symposium, Wroclaw,
                  Poland, September 8-10, 2014. Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {8737},
  pages        = {209--221},
  publisher    = {Springer},
  year         = {2014},
  url          = {https://doi.org/10.1007/978-3-662-44777-2\_18},
  doi          = {10.1007/978-3-662-44777-2\_18},
  timestamp    = {Tue, 14 May 2019 10:00:54 +0200},
  biburl       = {https://dblp.org/rec/conf/esa/BuchbinderCN14.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/BuchbinderCN14,
  author       = {Niv Buchbinder and
                  Shahar Chen and
                  Joseph Naor},
  editor       = {Chandra Chekuri},
  title        = {Competitive Analysis via Regularization},
  booktitle    = {Proceedings of the Twenty-Fifth Annual {ACM-SIAM} Symposium on Discrete
                  Algorithms, {SODA} 2014, Portland, Oregon, USA, January 5-7, 2014},
  pages        = {436--444},
  publisher    = {{SIAM}},
  year         = {2014},
  url          = {https://doi.org/10.1137/1.9781611973402.32},
  doi          = {10.1137/1.9781611973402.32},
  timestamp    = {Tue, 02 Feb 2021 17:07:40 +0100},
  biburl       = {https://dblp.org/rec/conf/soda/BuchbinderCN14.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/BuchbinderFNS14,
  author       = {Niv Buchbinder and
                  Moran Feldman and
                  Joseph Naor and
                  Roy Schwartz},
  editor       = {Chandra Chekuri},
  title        = {Submodular Maximization with Cardinality Constraints},
  booktitle    = {Proceedings of the Twenty-Fifth Annual {ACM-SIAM} Symposium on Discrete
                  Algorithms, {SODA} 2014, Portland, Oregon, USA, January 5-7, 2014},
  pages        = {1433--1452},
  publisher    = {{SIAM}},
  year         = {2014},
  url          = {https://doi.org/10.1137/1.9781611973402.106},
  doi          = {10.1137/1.9781611973402.106},
  timestamp    = {Tue, 02 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/soda/BuchbinderFNS14.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/BuchbinderFS14,
  author       = {Niv Buchbinder and
                  Moran Feldman and
                  Roy Schwartz},
  title        = {Comparing Apples and Oranges: Query Tradeoff in Submodular Maximization},
  journal      = {CoRR},
  volume       = {abs/1410.0773},
  year         = {2014},
  url          = {http://arxiv.org/abs/1410.0773},
  eprinttype    = {arXiv},
  eprint       = {1410.0773},
  timestamp    = {Wed, 23 Dec 2020 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/corr/BuchbinderFS14.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/BuchbinderCGNN14,
  author       = {Niv Buchbinder and
                  Shahar Chen and
                  Anupam Gupta and
                  Viswanath Nagarajan and
                  Joseph Naor},
  title        = {Online Packing and Covering Framework with Convex Objectives},
  journal      = {CoRR},
  volume       = {abs/1412.8347},
  year         = {2014},
  url          = {http://arxiv.org/abs/1412.8347},
  eprinttype    = {arXiv},
  eprint       = {1412.8347},
  timestamp    = {Wed, 18 Aug 2021 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/BuchbinderCGNN14.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ior/BuchbinderKLMS13,
  author       = {Niv Buchbinder and
                  Tracy Kimbrel and
                  Retsef Levi and
                  Konstantin Makarychev and
                  Maxim Sviridenko},
  title        = {Online Make-to-Order Joint Replenishment Model: Primal-Dual Competitive
                  Algorithms},
  journal      = {Oper. Res.},
  volume       = {61},
  number       = {4},
  pages        = {1014--1029},
  year         = {2013},
  url          = {https://doi.org/10.1287/opre.2013.1188},
  doi          = {10.1287/OPRE.2013.1188},
  timestamp    = {Tue, 31 Mar 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/ior/BuchbinderKLMS13.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/scheduling/BuchbinderN13,
  author       = {Niv Buchbinder and
                  Joseph Naor},
  title        = {Fair online load balancing},
  journal      = {J. Sched.},
  volume       = {16},
  number       = {1},
  pages        = {117--127},
  year         = {2013},
  url          = {https://doi.org/10.1007/s10951-011-0226-0},
  doi          = {10.1007/S10951-011-0226-0},
  timestamp    = {Wed, 01 Apr 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/scheduling/BuchbinderN13.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/BuchbinderNS13,
  author       = {Niv Buchbinder and
                  Joseph Naor and
                  Roy Schwartz},
  editor       = {Dan Boneh and
                  Tim Roughgarden and
                  Joan Feigenbaum},
  title        = {Simplex partitioning via exponential clocks and the multiway cut problem},
  booktitle    = {Symposium on Theory of Computing Conference, STOC'13, Palo Alto, CA,
                  USA, June 1-4, 2013},
  pages        = {535--544},
  publisher    = {{ACM}},
  year         = {2013},
  url          = {https://doi.org/10.1145/2488608.2488675},
  doi          = {10.1145/2488608.2488675},
  timestamp    = {Wed, 23 Dec 2020 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/stoc/BuchbinderNS13.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/BansalBN12,
  author       = {Nikhil Bansal and
                  Niv Buchbinder and
                  Joseph Naor},
  title        = {A Primal-Dual Randomized Algorithm for Weighted Paging},
  journal      = {J. {ACM}},
  volume       = {59},
  number       = {4},
  pages        = {19:1--19:24},
  year         = {2012},
  url          = {https://doi.org/10.1145/2339123.2339126},
  doi          = {10.1145/2339123.2339126},
  timestamp    = {Tue, 15 Feb 2022 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/jacm/BansalBN12.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/BansalBN12,
  author       = {Nikhil Bansal and
                  Niv Buchbinder and
                  Joseph Naor},
  title        = {Randomized Competitive Algorithms for Generalized Caching},
  journal      = {{SIAM} J. Comput.},
  volume       = {41},
  number       = {2},
  pages        = {391--414},
  year         = {2012},
  url          = {https://doi.org/10.1137/090779000},
  doi          = {10.1137/090779000},
  timestamp    = {Tue, 15 Feb 2022 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/siamcomp/BansalBN12.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ton/BuchbinderLMNO12,
  author       = {Niv Buchbinder and
                  Liane Lewin{-}Eytan and
                  Ishai Menache and
                  Joseph Naor and
                  Ariel Orda},
  title        = {Dynamic Power Allocation Under Arbitrary Varying Channels - An Online
                  Approach},
  journal      = {{IEEE/ACM} Trans. Netw.},
  volume       = {20},
  number       = {2},
  pages        = {477--487},
  year         = {2012},
  url          = {https://doi.org/10.1109/TNET.2011.2170092},
  doi          = {10.1109/TNET.2011.2170092},
  timestamp    = {Fri, 02 Nov 2018 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/ton/BuchbinderLMNO12.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/BuchbinderFNS12,
  author       = {Niv Buchbinder and
                  Moran Feldman and
                  Joseph Naor and
                  Roy Schwartz},
  title        = {A Tight Linear Time (1/2)-Approximation for Unconstrained Submodular
                  Maximization},
  booktitle    = {53rd Annual {IEEE} Symposium on Foundations of Computer Science, {FOCS}
                  2012, New Brunswick, NJ, USA, October 20-23, 2012},
  pages        = {649--658},
  publisher    = {{IEEE} Computer Society},
  year         = {2012},
  url          = {https://doi.org/10.1109/FOCS.2012.73},
  doi          = {10.1109/FOCS.2012.73},
  timestamp    = {Thu, 23 Mar 2023 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/focs/BuchbinderFNS12.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/BuchbinderNRS12,
  author       = {Niv Buchbinder and
                  Joseph Naor and
                  R. Ravi and
                  Mohit Singh},
  editor       = {Artur Czumaj and
                  Kurt Mehlhorn and
                  Andrew M. Pitts and
                  Roger Wattenhofer},
  title        = {Approximation Algorithms for Online Weighted Rank Function Maximization
                  under Matroid Constraints},
  booktitle    = {Automata, Languages, and Programming - 39th International Colloquium,
                  {ICALP} 2012, Warwick, UK, July 9-13, 2012, Proceedings, Part {I}},
  series       = {Lecture Notes in Computer Science},
  volume       = {7391},
  pages        = {145--156},
  publisher    = {Springer},
  year         = {2012},
  url          = {https://doi.org/10.1007/978-3-642-31594-7\_13},
  doi          = {10.1007/978-3-642-31594-7\_13},
  timestamp    = {Tue, 14 May 2019 10:00:44 +0200},
  biburl       = {https://dblp.org/rec/conf/icalp/BuchbinderNRS12.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:journals/jmlr/BuchbinderCNS12,
  author       = {Niv Buchbinder and
                  Shahar Chen and
                  Joseph Naor and
                  Ohad Shamir},
  editor       = {Shie Mannor and
                  Nathan Srebro and
                  Robert C. Williamson},
  title        = {Unified Algorithms for Online Learning and Competitive Analysis},
  booktitle    = {{COLT} 2012 - The 25th Annual Conference on Learning Theory, June
                  25-27, 2012, Edinburgh, Scotland},
  series       = {{JMLR} Proceedings},
  volume       = {23},
  pages        = {5.1--5.18},
  publisher    = {JMLR.org},
  year         = {2012},
  url          = {http://proceedings.mlr.press/v23/buchbinder12/buchbinder12.pdf},
  timestamp    = {Wed, 29 May 2019 08:41:46 +0200},
  biburl       = {https://dblp.org/rec/journals/jmlr/BuchbinderCNS12.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1205-1477,
  author       = {Niv Buchbinder and
                  Joseph Naor and
                  R. Ravi and
                  Mohit Singh},
  title        = {Approximation Algorithms for Online Weighted Rank Function Maximization
                  under Matroid Constraints},
  journal      = {CoRR},
  volume       = {abs/1205.1477},
  year         = {2012},
  url          = {http://arxiv.org/abs/1205.1477},
  eprinttype    = {arXiv},
  eprint       = {1205.1477},
  timestamp    = {Tue, 17 Sep 2019 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/abs-1205-1477.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/BansalBMN11,
  author       = {Nikhil Bansal and
                  Niv Buchbinder and
                  Aleksander Madry and
                  Joseph Naor},
  editor       = {Rafail Ostrovsky},
  title        = {A Polylogarithmic-Competitive Algorithm for the k-Server Problem},
  booktitle    = {{IEEE} 52nd Annual Symposium on Foundations of Computer Science, {FOCS}
                  2011, Palm Springs, CA, USA, October 22-25, 2011},
  pages        = {267--276},
  publisher    = {{IEEE} Computer Society},
  year         = {2011},
  url          = {https://doi.org/10.1109/FOCS.2011.63},
  doi          = {10.1109/FOCS.2011.63},
  timestamp    = {Thu, 23 Mar 2023 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/focs/BansalBMN11.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/networking/BuchbinderJM11,
  author       = {Niv Buchbinder and
                  Navendu Jain and
                  Ishai Menache},
  editor       = {Jordi Domingo{-}Pascual and
                  Pietro Manzoni and
                  Sergio Palazzo and
                  Ana Pont and
                  Caterina M. Scoglio},
  title        = {Online Job-Migration for Reducing the Electricity Bill in the Cloud},
  booktitle    = {{NETWORKING} 2011 - 10th International {IFIP} {TC} 6 Networking Conference,
                  Valencia, Spain, May 9-13, 2011, Proceedings, Part {I}},
  series       = {Lecture Notes in Computer Science},
  volume       = {6640},
  pages        = {172--185},
  publisher    = {Springer},
  year         = {2011},
  url          = {https://doi.org/10.1007/978-3-642-20757-0\_14},
  doi          = {10.1007/978-3-642-20757-0\_14},
  timestamp    = {Fri, 09 Apr 2021 18:42:27 +0200},
  biburl       = {https://dblp.org/rec/conf/networking/BuchbinderJM11.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wads/BuchbinderFGN11,
  author       = {Niv Buchbinder and
                  Moran Feldman and
                  Arpita Ghosh and
                  Joseph Naor},
  editor       = {Frank Dehne and
                  John Iacono and
                  J{\"{o}}rg{-}R{\"{u}}diger Sack},
  title        = {Frequency Capping in Online Advertising},
  booktitle    = {Algorithms and Data Structures - 12th International Symposium, {WADS}
                  2011, New York, NY, USA, August 15-17, 2011. Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {6844},
  pages        = {147--158},
  publisher    = {Springer},
  year         = {2011},
  url          = {https://doi.org/10.1007/978-3-642-22300-6\_13},
  doi          = {10.1007/978-3-642-22300-6\_13},
  timestamp    = {Tue, 14 May 2019 10:00:50 +0200},
  biburl       = {https://dblp.org/rec/conf/wads/BuchbinderFGN11.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1110-1580,
  author       = {Nikhil Bansal and
                  Niv Buchbinder and
                  Aleksander Madry and
                  Joseph Naor},
  title        = {A Polylogarithmic-Competitive Algorithm for the k-Server Problem},
  journal      = {CoRR},
  volume       = {abs/1110.1580},
  year         = {2011},
  url          = {http://arxiv.org/abs/1110.1580},
  eprinttype    = {arXiv},
  eprint       = {1110.1580},
  timestamp    = {Tue, 15 Feb 2022 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/corr/abs-1110-1580.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/BuchbinderLNO10,
  author       = {Niv Buchbinder and
                  Liane Lewin{-}Eytan and
                  Joseph Naor and
                  Ariel Orda},
  title        = {Non-Cooperative Cost Sharing Games via Subsidies},
  journal      = {Theory Comput. Syst.},
  volume       = {47},
  number       = {1},
  pages        = {15--37},
  year         = {2010},
  url          = {https://doi.org/10.1007/s00224-009-9197-3},
  doi          = {10.1007/S00224-009-9197-3},
  timestamp    = {Fri, 30 Nov 2018 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/mst/BuchbinderLNO10.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/alt/AbernethyBBS10,
  author       = {Jacob D. Abernethy and
                  Peter L. Bartlett and
                  Niv Buchbinder and
                  Isabelle Stanton},
  editor       = {Marcus Hutter and
                  Frank Stephan and
                  Vladimir Vovk and
                  Thomas Zeugmann},
  title        = {A Regularization Approach to Metrical Task Systems},
  booktitle    = {Algorithmic Learning Theory, 21st International Conference, {ALT}
                  2010, Canberra, Australia, October 6-8, 2010. Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {6331},
  pages        = {270--284},
  publisher    = {Springer},
  year         = {2010},
  url          = {https://doi.org/10.1007/978-3-642-16108-7\_23},
  doi          = {10.1007/978-3-642-16108-7\_23},
  timestamp    = {Tue, 14 May 2019 10:00:51 +0200},
  biburl       = {https://dblp.org/rec/conf/alt/AbernethyBBS10.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/esa/AzarBJ10,
  author       = {Yossi Azar and
                  Niv Buchbinder and
                  Kamal Jain},
  editor       = {Mark de Berg and
                  Ulrich Meyer},
  title        = {How to Allocate Goods in an Online Market?},
  booktitle    = {Algorithms - {ESA} 2010, 18th Annual European Symposium, Liverpool,
                  UK, September 6-8, 2010. Proceedings, Part {II}},
  series       = {Lecture Notes in Computer Science},
  volume       = {6347},
  pages        = {51--62},
  publisher    = {Springer},
  year         = {2010},
  url          = {https://doi.org/10.1007/978-3-642-15781-3\_5},
  doi          = {10.1007/978-3-642-15781-3\_5},
  timestamp    = {Tue, 14 May 2019 10:00:54 +0200},
  biburl       = {https://dblp.org/rec/conf/esa/AzarBJ10.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/BansalBN10,
  author       = {Nikhil Bansal and
                  Niv Buchbinder and
                  Joseph Naor},
  editor       = {Samson Abramsky and
                  Cyril Gavoille and
                  Claude Kirchner and
                  Friedhelm Meyer auf der Heide and
                  Paul G. Spirakis},
  title        = {Metrical Task Systems and the \emph{k}-Server Problem on HSTs},
  booktitle    = {Automata, Languages and Programming, 37th International Colloquium,
                  {ICALP} 2010, Bordeaux, France, July 6-10, 2010, Proceedings, Part
                  {I}},
  series       = {Lecture Notes in Computer Science},
  volume       = {6198},
  pages        = {287--298},
  publisher    = {Springer},
  year         = {2010},
  url          = {https://doi.org/10.1007/978-3-642-14165-2\_25},
  doi          = {10.1007/978-3-642-14165-2\_25},
  timestamp    = {Tue, 15 Feb 2022 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/icalp/BansalBN10.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/infocom/BuchbinderLMNO10,
  author       = {Niv Buchbinder and
                  Liane Lewin{-}Eytan and
                  Ishai Menache and
                  Joseph Naor and
                  Ariel Orda},
  title        = {Dynamic Power Allocation Under Arbitrary Varying Channels - The Multi-User
                  Case},
  booktitle    = {{INFOCOM} 2010. 29th {IEEE} International Conference on Computer Communications,
                  Joint Conference of the {IEEE} Computer and Communications Societies,
                  15-19 March 2010, San Diego, CA, {USA}},
  pages        = {2402--2410},
  publisher    = {{IEEE}},
  year         = {2010},
  url          = {https://doi.org/10.1109/INFCOM.2010.5462067},
  doi          = {10.1109/INFCOM.2010.5462067},
  timestamp    = {Wed, 16 Oct 2019 14:14:51 +0200},
  biburl       = {https://dblp.org/rec/conf/infocom/BuchbinderLMNO10.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ipco/BuchbinderJS10,
  author       = {Niv Buchbinder and
                  Kamal Jain and
                  Mohit Singh},
  editor       = {Friedrich Eisenbrand and
                  F. Bruce Shepherd},
  title        = {Secretary Problems via Linear Programming},
  booktitle    = {Integer Programming and Combinatorial Optimization, 14th International
                  Conference, {IPCO} 2010, Lausanne, Switzerland, June 9-11, 2010. Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {6080},
  pages        = {163--176},
  publisher    = {Springer},
  year         = {2010},
  url          = {https://doi.org/10.1007/978-3-642-13036-6\_13},
  doi          = {10.1007/978-3-642-13036-6\_13},
  timestamp    = {Tue, 14 May 2019 10:00:50 +0200},
  biburl       = {https://dblp.org/rec/conf/ipco/BuchbinderJS10.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/BansalBN10,
  author       = {Nikhil Bansal and
                  Niv Buchbinder and
                  Joseph Naor},
  editor       = {Moses Charikar},
  title        = {Towards the Randomized k-Server Conjecture: {A} Primal-Dual Approach},
  booktitle    = {Proceedings of the Twenty-First Annual {ACM-SIAM} Symposium on Discrete
                  Algorithms, {SODA} 2010, Austin, Texas, USA, January 17-19, 2010},
  pages        = {40--55},
  publisher    = {{SIAM}},
  year         = {2010},
  url          = {https://doi.org/10.1137/1.9781611973075.5},
  doi          = {10.1137/1.9781611973075.5},
  timestamp    = {Tue, 15 Feb 2022 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/soda/BansalBN10.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wine/BuchbinderJS10,
  author       = {Niv Buchbinder and
                  Kamal Jain and
                  Mohit Singh},
  editor       = {Amin Saberi},
  title        = {Incentives in Online Auctions via Linear Programming},
  booktitle    = {Internet and Network Economics - 6th International Workshop, {WINE}
                  2010, Stanford, CA, USA, December 13-17, 2010. Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {6484},
  pages        = {106--117},
  publisher    = {Springer},
  year         = {2010},
  url          = {https://doi.org/10.1007/978-3-642-17572-5\_9},
  doi          = {10.1007/978-3-642-17572-5\_9},
  timestamp    = {Tue, 14 May 2019 10:00:37 +0200},
  biburl       = {https://dblp.org/rec/conf/wine/BuchbinderJS10.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/fttcs/BuchbinderN09,
  author       = {Niv Buchbinder and
                  Joseph Naor},
  title        = {The Design of Competitive Online Algorithms via a Primal-Dual Approach},
  journal      = {Found. Trends Theor. Comput. Sci.},
  volume       = {3},
  number       = {2-3},
  pages        = {93--263},
  year         = {2009},
  url          = {https://doi.org/10.1561/0400000024},
  doi          = {10.1561/0400000024},
  timestamp    = {Thu, 20 Aug 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/fttcs/BuchbinderN09.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mor/BuchbinderN09,
  author       = {Niv Buchbinder and
                  Joseph Naor},
  title        = {Online Primal-Dual Algorithms for Covering and Packing},
  journal      = {Math. Oper. Res.},
  volume       = {34},
  number       = {2},
  pages        = {270--286},
  year         = {2009},
  url          = {https://doi.org/10.1287/moor.1080.0363},
  doi          = {10.1287/MOOR.1080.0363},
  timestamp    = {Fri, 30 Nov 2018 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/mor/BuchbinderN09.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/AlonAABN09,
  author       = {Noga Alon and
                  Baruch Awerbuch and
                  Yossi Azar and
                  Niv Buchbinder and
                  Joseph Naor},
  title        = {The Online Set Cover Problem},
  journal      = {{SIAM} J. Comput.},
  volume       = {39},
  number       = {2},
  pages        = {361--370},
  year         = {2009},
  url          = {https://doi.org/10.1137/060661946},
  doi          = {10.1137/060661946},
  timestamp    = {Fri, 02 Nov 2018 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/siamcomp/AlonAABN09.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/sigecom/BuchbinderJS09,
  author       = {Niv Buchbinder and
                  Kamal Jain and
                  Mohit Singh},
  title        = {Secretary problems and incentives via linear programming},
  journal      = {SIGecom Exch.},
  volume       = {8},
  number       = {2},
  pages        = {6},
  year         = {2009},
  url          = {https://doi.org/10.1145/1980522.1980528},
  doi          = {10.1145/1980522.1980528},
  timestamp    = {Thu, 04 Jun 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/sigecom/BuchbinderJS09.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/infocom/BuchbinderLMNO09,
  author       = {Niv Buchbinder and
                  Liane Lewin{-}Eytan and
                  Ishai Menache and
                  Joseph Naor and
                  Ariel Orda},
  title        = {Dynamic Power Allocation Under Arbitrary Varying Channels - An Online
                  Approach},
  booktitle    = {{INFOCOM} 2009. 28th {IEEE} International Conference on Computer Communications,
                  Joint Conference of the {IEEE} Computer and Communications Societies,
                  19-25 April 2009, Rio de Janeiro, Brazil},
  pages        = {145--153},
  publisher    = {{IEEE}},
  year         = {2009},
  url          = {https://doi.org/10.1109/INFCOM.2009.5061916},
  doi          = {10.1109/INFCOM.2009.5061916},
  timestamp    = {Wed, 16 Oct 2019 14:14:51 +0200},
  biburl       = {https://dblp.org/rec/conf/infocom/BuchbinderLMNO09.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@phdthesis{DBLP:phd/il/Buchbinder08,
  author       = {Niv Buchbinder},
  title        = {Designing competitive online algorithms via a primal-dual approach},
  school       = {Technion - Israel Institute of Technology, Israel},
  year         = {2008},
  url          = {https://technion.primo.exlibrisgroup.com/permalink/972TEC\_INST/q1jq5o/alma990022986660203971},
  timestamp    = {Thu, 01 Dec 2022 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/phd/il/Buchbinder08.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sagt/BuchbinderLNO08,
  author       = {Niv Buchbinder and
                  Liane Lewin{-}Eytan and
                  Joseph Naor and
                  Ariel Orda},
  editor       = {Burkhard Monien and
                  Ulf{-}Peter Schroeder},
  title        = {Non-cooperative Cost Sharing Games Via Subsidies},
  booktitle    = {Algorithmic Game Theory, First International Symposium, {SAGT} 2008,
                  Paderborn, Germany, April 30-May 2, 2008. Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {4997},
  pages        = {337--349},
  publisher    = {Springer},
  year         = {2008},
  url          = {https://doi.org/10.1007/978-3-540-79309-0\_30},
  doi          = {10.1007/978-3-540-79309-0\_30},
  timestamp    = {Tue, 14 May 2019 10:00:42 +0200},
  biburl       = {https://dblp.org/rec/conf/sagt/BuchbinderLNO08.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/BuchbinderKLMS08,
  author       = {Niv Buchbinder and
                  Tracy Kimbrel and
                  Retsef Levi and
                  Konstantin Makarychev and
                  Maxim Sviridenko},
  editor       = {Shang{-}Hua Teng},
  title        = {Online make-to-order joint replenishment model: primal dual competitive
                  algorithms},
  booktitle    = {Proceedings of the Nineteenth Annual {ACM-SIAM} Symposium on Discrete
                  Algorithms, {SODA} 2008, San Francisco, California, USA, January 20-22,
                  2008},
  pages        = {952--961},
  publisher    = {{SIAM}},
  year         = {2008},
  url          = {http://dl.acm.org/citation.cfm?id=1347082.1347186},
  timestamp    = {Fri, 07 Dec 2012 17:02:08 +0100},
  biburl       = {https://dblp.org/rec/conf/soda/BuchbinderKLMS08.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/BansalBN08,
  author       = {Nikhil Bansal and
                  Niv Buchbinder and
                  Joseph Naor},
  editor       = {Cynthia Dwork},
  title        = {Randomized competitive algorithms for generalized caching},
  booktitle    = {Proceedings of the 40th Annual {ACM} Symposium on Theory of Computing,
                  Victoria, British Columbia, Canada, May 17-20, 2008},
  pages        = {235--244},
  publisher    = {{ACM}},
  year         = {2008},
  url          = {https://doi.org/10.1145/1374376.1374412},
  doi          = {10.1145/1374376.1374412},
  timestamp    = {Tue, 15 Feb 2022 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/stoc/BansalBN08.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/esa/BuchbinderJN07,
  author       = {Niv Buchbinder and
                  Kamal Jain and
                  Joseph Naor},
  editor       = {Lars Arge and
                  Michael Hoffmann and
                  Emo Welzl},
  title        = {Online Primal-Dual Algorithms for Maximizing Ad-Auctions Revenue},
  booktitle    = {Algorithms - {ESA} 2007, 15th Annual European Symposium, Eilat, Israel,
                  October 8-10, 2007, Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {4698},
  pages        = {253--264},
  publisher    = {Springer},
  year         = {2007},
  url          = {https://doi.org/10.1007/978-3-540-75520-3\_24},
  doi          = {10.1007/978-3-540-75520-3\_24},
  timestamp    = {Tue, 14 May 2019 10:00:54 +0200},
  biburl       = {https://dblp.org/rec/conf/esa/BuchbinderJN07.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/esa/BansalBGN07,
  author       = {Nikhil Bansal and
                  Niv Buchbinder and
                  Anupam Gupta and
                  Joseph Naor},
  editor       = {Lars Arge and
                  Michael Hoffmann and
                  Emo Welzl},
  title        = {An \emph{O} (log\({}^{\mbox{2}}\) \emph{k} )-Competitive Algorithm
                  for Metric Bipartite Matching},
  booktitle    = {Algorithms - {ESA} 2007, 15th Annual European Symposium, Eilat, Israel,
                  October 8-10, 2007, Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {4698},
  pages        = {522--533},
  publisher    = {Springer},
  year         = {2007},
  url          = {https://doi.org/10.1007/978-3-540-75520-3\_47},
  doi          = {10.1007/978-3-540-75520-3\_47},
  timestamp    = {Tue, 15 Feb 2022 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/esa/BansalBGN07.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/BansalBN07,
  author       = {Nikhil Bansal and
                  Niv Buchbinder and
                  Joseph Naor},
  title        = {A Primal-Dual Randomized Algorithm for Weighted Paging},
  booktitle    = {48th Annual {IEEE} Symposium on Foundations of Computer Science {(FOCS}
                  2007), October 20-23, 2007, Providence, RI, USA, Proceedings},
  pages        = {507--517},
  publisher    = {{IEEE} Computer Society},
  year         = {2007},
  url          = {https://doi.org/10.1109/FOCS.2007.7},
  doi          = {10.1109/FOCS.2007.7},
  timestamp    = {Thu, 23 Mar 2023 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/focs/BansalBN07.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/iandc/BuchbinderP06,
  author       = {Niv Buchbinder and
                  Erez Petrank},
  title        = {Lower and upper bounds on obtaining history independence},
  journal      = {Inf. Comput.},
  volume       = {204},
  number       = {2},
  pages        = {291--337},
  year         = {2006},
  url          = {https://doi.org/10.1016/j.ic.2005.11.001},
  doi          = {10.1016/J.IC.2005.11.001},
  timestamp    = {Fri, 12 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/iandc/BuchbinderP06.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/AlonAABN06,
  author       = {Noga Alon and
                  Baruch Awerbuch and
                  Yossi Azar and
                  Niv Buchbinder and
                  Joseph Naor},
  title        = {A general approach to online network optimization problems},
  journal      = {{ACM} Trans. Algorithms},
  volume       = {2},
  number       = {4},
  pages        = {640--660},
  year         = {2006},
  url          = {https://doi.org/10.1145/1198513.1198522},
  doi          = {10.1145/1198513.1198522},
  timestamp    = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/talg/AlonAABN06.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/BuchbinderN06,
  author       = {Niv Buchbinder and
                  Joseph Naor},
  title        = {Improved Bounds for Online Routing and Packing Via a Primal-Dual Approach},
  booktitle    = {47th Annual {IEEE} Symposium on Foundations of Computer Science {(FOCS}
                  2006), 21-24 October 2006, Berkeley, California, USA, Proceedings},
  pages        = {293--304},
  publisher    = {{IEEE} Computer Society},
  year         = {2006},
  url          = {https://doi.org/10.1109/FOCS.2006.39},
  doi          = {10.1109/FOCS.2006.39},
  timestamp    = {Thu, 23 Mar 2023 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/focs/BuchbinderN06.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/spaa/BuchbinderN06,
  author       = {Niv Buchbinder and
                  Joseph Naor},
  editor       = {Phillip B. Gibbons and
                  Uzi Vishkin},
  title        = {Fair online load balancing},
  booktitle    = {{SPAA} 2006: Proceedings of the 18th Annual {ACM} Symposium on Parallelism
                  in Algorithms and Architectures, Cambridge, Massachusetts, USA, July
                  30 - August 2, 2006},
  pages        = {291--298},
  publisher    = {{ACM}},
  year         = {2006},
  url          = {https://doi.org/10.1145/1148109.1148159},
  doi          = {10.1145/1148109.1148159},
  timestamp    = {Wed, 21 Nov 2018 11:13:10 +0100},
  biburl       = {https://dblp.org/rec/conf/spaa/BuchbinderN06.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/esa/BuchbinderN05,
  author       = {Niv Buchbinder and
                  Joseph Naor},
  editor       = {Gerth St{\o}lting Brodal and
                  Stefano Leonardi},
  title        = {Online Primal-Dual Algorithms for Covering and Packing Problems},
  booktitle    = {Algorithms - {ESA} 2005, 13th Annual European Symposium, Palma de
                  Mallorca, Spain, October 3-6, 2005, Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {3669},
  pages        = {689--701},
  publisher    = {Springer},
  year         = {2005},
  url          = {https://doi.org/10.1007/11561071\_61},
  doi          = {10.1007/11561071\_61},
  timestamp    = {Tue, 27 Dec 2022 09:06:31 +0100},
  biburl       = {https://dblp.org/rec/conf/esa/BuchbinderN05.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/AlonAABN04,
  author       = {Noga Alon and
                  Baruch Awerbuch and
                  Yossi Azar and
                  Niv Buchbinder and
                  Joseph Naor},
  editor       = {J. Ian Munro},
  title        = {A general approach to online network optimization problems},
  booktitle    = {Proceedings of the Fifteenth Annual {ACM-SIAM} Symposium on Discrete
                  Algorithms, {SODA} 2004, New Orleans, Louisiana, USA, January 11-14,
                  2004},
  pages        = {577--586},
  publisher    = {{SIAM}},
  year         = {2004},
  url          = {http://dl.acm.org/citation.cfm?id=982792.982879},
  timestamp    = {Fri, 07 Dec 2012 17:02:08 +0100},
  biburl       = {https://dblp.org/rec/conf/soda/AlonAABN04.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/crypto/BuchbinderP03,
  author       = {Niv Buchbinder and
                  Erez Petrank},
  editor       = {Dan Boneh},
  title        = {Lower and Upper Bounds on Obtaining History Independence},
  booktitle    = {Advances in Cryptology - {CRYPTO} 2003, 23rd Annual International
                  Cryptology Conference, Santa Barbara, California, USA, August 17-21,
                  2003, Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {2729},
  pages        = {445--462},
  publisher    = {Springer},
  year         = {2003},
  url          = {https://doi.org/10.1007/978-3-540-45146-4\_26},
  doi          = {10.1007/978-3-540-45146-4\_26},
  timestamp    = {Tue, 14 May 2019 10:00:48 +0200},
  biburl       = {https://dblp.org/rec/conf/crypto/BuchbinderP03.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/AlonAA03,
  author       = {Noga Alon and
                  Baruch Awerbuch and
                  Yossi Azar and
                  Niv Buchbinder and
                  Joseph Naor},
  editor       = {Lawrence L. Larmore and
                  Michel X. Goemans},
  title        = {The online set cover problem},
  booktitle    = {Proceedings of the 35th Annual {ACM} Symposium on Theory of Computing,
                  June 9-11, 2003, San Diego, CA, {USA}},
  pages        = {100--105},
  publisher    = {{ACM}},
  year         = {2003},
  url          = {https://doi.org/10.1145/780542.780558},
  doi          = {10.1145/780542.780558},
  timestamp    = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/stoc/AlonAA03.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/jvm/BarabashBDKOPSSU01,
  author       = {Katherine Barabash and
                  Niv Buchbinder and
                  Tamar Domani and
                  Elliot K. Kolodner and
                  Yoav Ossia and
                  Shlomit S. Pinter and
                  Janice C. Shepherd and
                  Ron Sivan and
                  Victor Umansky},
  editor       = {Saul Wold},
  title        = {Mostly Accurate Stack Scanning},
  booktitle    = {Proceedings of the 1st Java Virtual Machine Research and Technology
                  Symposium, April 23-24, 2001, Monterey, CA, {USA}},
  publisher    = {{USENIX}},
  year         = {2001},
  url          = {http://www.usenix.org/publications/library/proceedings/jvm01/barabash.html},
  timestamp    = {Tue, 02 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/jvm/BarabashBDKOPSSU01.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
a service of  Schloss Dagstuhl - Leibniz Center for Informatics