Niv Buchbinder – Research output — Israeli Research Community Portal

View Scopus Profile

Research activity per year

24 Article
23 Conference contribution
3 Paper
2 Conference article
More
- 1 Chapter

23 results

Filter

2024
Constrained Submodular Maximization via New Bounds for DR-Submodular Functions
Buchbinder, N. & Feldman, M., 10 Jun 2024, STOC 2024 - Proceedings of the 56th Annual ACM Symposium on Theory of Computing. Mohar, B., Shinkar, I. & O�Donnell, R. (eds.). p. 1820-1831 12 p. (Proceedings of the Annual ACM Symposium on Theory of Computing).
Tel Aviv University, University of Haifa
Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

Open Access
2023
Chasing Positive Bodies
Bhattacharya, S., Buchbinder, N., Levin, R. & Saranurak, T., 2023, Proceedings - 2023 IEEE 64th Annual Symposium on Foundations of Computer Science, FOCS 2023. IEEE Computer Society, p. 1694-1714 21 p. (Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS).
Tel Aviv University
Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review
Lossless Online Rounding for Online Bipartite Matching (Despite its Impossibility)
Buchbinder, N., Naor, J. & Wajc, D., 2023, 34th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2023. p. 2030-2068 39 p. (Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms; vol. 2023-January).
Tel Aviv University, Technion - Israel Institute of Technology
Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

Open Access
2021
Metrical service systems with transformations
Bubeck, S., Buchbinder, N., Coester, C. & Sellke, M., 1 Feb 2021, 12th Innovations in Theoretical Computer Science Conference, ITCS 2021. Lee, J. R. (ed.). 21. (Leibniz International Proceedings in Informatics, LIPIcs; vol. 185).
Tel Aviv University
Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review
Online k-Taxi via Double Coverage and Time-Reverse Primal-Dual
Buchbinder, N., Coester, C. & Naor, J., 2021, Integer Programming and Combinatorial Optimization - 22nd International Conference, IPCO 2021, Proceedings. Singh, M. & Williamson, D. P. (eds.). Springer Science and Business Media Deutschland GmbH, p. 15-29 15 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 12707 LNCS).
Tel Aviv University, Technion - Israel Institute of Technology
Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review
Online Virtual Machine Allocation with Lifetime and Load Predictions
Buchbinder, N., Fairstein, Y., Mellou, K., Menache, I. & Naor, J. S., 31 May 2021, SIGMETRICS 2021 - Abstract Proceedings of the 2021 ACM SIGMETRICS / International Conference on Measurement and Modeling of Computer Systems. p. 9-10 2 p. (SIGMETRICS 2021 - Abstract Proceedings of the 2021 ACM SIGMETRICS / International Conference on Measurement and Modeling of Computer Systems).
Tel Aviv University, Technion - Israel Institute of Technology
Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review
2019
Online Submodular Maximization: Beating 1/2 Made Simple
Buchbinder, N., Feldman, M., Filmus, Y. & Garg, M., 2019, Integer Programming and Combinatorial Optimization - 20th International Conference, IPCO 2019, Proceedings. Lodi, A. & Nagarajan, V. (eds.). Vol. 11480. p. 101-114 14 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 11480 LNCS).
Tel Aviv University, Open University of Israel, Technion - Israel Institute of Technology
Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

Open Access
2017
Fair coin flipping: Tighter analysis and the many-party case
Buchbinder, N., Haitner, I., Levi, N. & Tsfadia, E., 2017, 28th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2017. Klein, P. N. (ed.). p. 2580-2600 21 p. (Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms; vol. 0).
Tel Aviv University
Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

Open Access
O(depth)-Competitive algorithm for online multi-level aggregation
Buchbinder, N., Feldman, M., Naor, J. & Talmon, O., 2017, 28th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2017. Klein, P. N. (ed.). p. 1235-1244 10 p. (Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms; vol. 0).
Tel Aviv University, Open University of Israel, Technion - Israel Institute of Technology
Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

Open Access
Online algorithms for maximum cardinality matching with edge arrivals
Buchbinder, N., Segev, D. & Tkach, Y., 1 Sep 2017, 25th European Symposium on Algorithms, ESA 2017. Sohler, C. & Pruhs, K. (eds.). 22. (Leibniz International Proceedings in Informatics, LIPIcs; vol. 87).
Tel Aviv University, University of Haifa
Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review
Simplex transformations and the multiway cut problem
Buchbinder, N., Schwartz, R. & Weizman, B., 2017, 28th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2017. Klein, P. N. (ed.). p. 2400-2410 11 p. (Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms; vol. 0).
Tel Aviv University, Technion - Israel Institute of Technology
Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

Open Access
2016
Deterministic algorithms for submodular maximization problems
Buchbinder, N. & Feldman, M., 2016, 27th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2016. Krauthgamer, R. (ed.). p. 392-403 12 p. (Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms; vol. 1).
Tel Aviv University
Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

Open Access
Online Algorithms for Covering and Packing Problems with Convex Objectives
Azar, Y., Buchbinder, N., Chan, T. H. H., Chen, S., Cohen, I. R., Gupta, A., Huang, Z., Kang, N., Nagarajan, V., Naor, J. & Panigrahi, D., 14 Dec 2016, Proceedings - 57th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2016. IEEE Computer Society, p. 148-157 10 p. 7782927. (Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS; vol. 2016-December).
Tel Aviv University, Technion - Israel Institute of Technology
Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review
2015
Comparing apples and oranges: Query tradeoff in submodular maximization
Buchbinder, N., Feldman, M. & Schwartz, R., 2015, Proceedings of the 26th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2015. January ed. p. 1149-1168 20 p. (Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms; vol. 2015-January, no. January).
Tel Aviv University
Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

Open Access
Online submodular maximization with preemption
Buchbinder, N., Feldman, M. & Schwartz, R., 2015, Proceedings of the 26th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2015. January ed. p. 1202-1216 15 p. (Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms; vol. 2015-January, no. January).
Tel Aviv University
Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

Open Access
2014
Competitive algorithms for restricted caching and matroid caching
Buchbinder, N., Chen, S. & Naor, J., 2014, Algorithms, ESA 2014 - 22nd Annual European Symposium, Proceedings. p. 209-221 13 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 8737 LNCS).
Tel Aviv University, Technion - Israel Institute of Technology
Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review
Competitive analysis via regularization
Buchbinder, N., Chen, S. & Naor, J., 2014, Proceedings of the 25th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2014. p. 436-444 9 p. (Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms).
Tel Aviv University, Technion - Israel Institute of Technology
Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review
Submodular maximization with cardinality constraints
Buchbinder, N., Feldman, M., Naor, J. & Schwartz, R., 2014, Proceedings of the 25th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2014. p. 1433-1452 20 p. (Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms).
Tel Aviv University, Technion - Israel Institute of Technology
Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review
2013
Simplex partitioning via exponential clocks and the multiway cut problem
Buchbinder, N., Naor, J. & Schwartz, R., 2013, STOC 2013 - Proceedings of the 2013 ACM Symposium on Theory of Computing. p. 535-544 10 p. (Proceedings of the Annual ACM Symposium on Theory of Computing).
Tel Aviv University, Technion - Israel Institute of Technology
Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review
2012
Approximation algorithms for online weighted rank function maximization under matroid constraints
Buchbinder, N., Naor, J., Ravi, R. & Singh, M., 2012, Automata, Languages, and Programming - 39th International Colloquium, ICALP 2012, Proceedings. PART 1 ed. p. 145-156 12 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 7391 LNCS, no. PART 1).
Open University of Israel, Technion - Israel Institute of Technology
Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review
2011
A polylogarithmic-competitive algorithm for the k-server problem
Bansal, N., Buchbinder, N., Ma̧dry, A. & Naor, J., 2011, Proceedings - 2011 IEEE 52nd Annual Symposium on Foundations of Computer Science, FOCS 2011. p. 267-276 10 p. 6108181. (Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS).
Open University of Israel, Technion - Israel Institute of Technology
Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

Open Access
Frequency capping in online advertising (extended abstract)
Buchbinder, N., Feldman, M., Ghosh, A. & Naor, J., 2011, Algorithms and Data Structures - 12th International Symposium, WADS 2011, Proceedings. p. 147-158 12 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 6844 LNCS).
Open University of Israel, Technion - Israel Institute of Technology
Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

Open Access
Online job-migration for reducing the electricity bill in the cloud
Buchbinder, N., Jain, N. & Menache, I., 2011, NETWORKING 2011 - 10th International IFIP TC 6 Networking Conference, Proceedings. PART 1 ed. p. 172-185 14 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 6640 LNCS, no. PART 1).
Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review