20012022

Research activity per year

If you made any changes in Pure these will be visible here soon.
Filter
Conference contribution

Search results

  • 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.). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 21. (Leibniz International Proceedings in Informatics, LIPIcs; vol. 185).

    Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-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).

    Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-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. Association for Computing Machinery, Inc, p. 9-10 2 p. (SIGMETRICS 2021 - Abstract Proceedings of the 2021 ACM SIGMETRICS / International Conference on Measurement and Modeling of Computer Systems).

    Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-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.). Springer Verlag, 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).

    Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

  • 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.). Association for Computing Machinery, p. 2580-2600 21 p. (Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms; vol. 0).

    Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-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.). Association for Computing Machinery, p. 1235-1244 10 p. (Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms; vol. 0).

    Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-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., Sohler, C. & Pruhs, K. (eds.). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 22. (Leibniz International Proceedings in Informatics, LIPIcs; vol. 87).

    Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-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.). Association for Computing Machinery, p. 2400-2410 11 p. (Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms; vol. 0).

    Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-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.). Association for Computing Machinery, p. 392-403 12 p. (Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms; vol. 1).

    Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-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).

    Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-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. Association for Computing Machinery, p. 1149-1168 20 p. (Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms; vol. 2015-January, no. January).

    Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

  • 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. Association for Computing Machinery, p. 1202-1216 15 p. (Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms; vol. 2015-January, no. January).

    Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-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. Springer Verlag, 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).

    Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-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. Association for Computing Machinery, p. 436-444 9 p. (Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms).

    Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-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. Association for Computing Machinery, p. 1433-1452 20 p. (Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms).

    Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-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).

    Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-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).

    Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-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).

    Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

  • 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).

    Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

  • 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 proceedingConference contributionpeer-review

  • 2010

    A regularization approach to metrical task systems

    Abernethy, J., Bartlett, P. L., Buchbinder, N. & Stanton, I., 2010, Algorithmic Learning Theory - 21st International Conference, ALT 2010, Proceedings. p. 270-284 15 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 6331 LNAI).

    Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

  • Dynamic power allocation under arbitrary varying channels - The multi-user case

    Buchbinder, N., Lewin-Eytan, L., Menache, I., Naor, J. & Orda, A., 2010, 2010 Proceedings IEEE INFOCOM. 5462067. (Proceedings - IEEE INFOCOM).

    Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

  • How to allocate goods in an online market?

    Azar, Y., Buchbinder, N. & Jain, K., 2010, Algorithms, ESA 2010 - 18th Annual European Symposium, Proceedings. PART 2 ed. p. 51-62 12 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 6347 LNCS, no. PART 2).

    Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

  • Incentives in online auctions via linear programming

    Buchbinder, N., Jain, K. & Singh, M., 2010, Internet and Network Economics - 6th International Workshop, WINE 2010, Proceedings. p. 106-117 12 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 6484 LNCS).

    Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

  • Metrical task systems and the k-server problem on HSTs

    Bansal, N., Buchbinder, N. & Naor, J. S., 2010, Automata, Languages and Programming - 37th International Colloquium, ICALP 2010, Proceedings. PART 1 ed. p. 287-298 12 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 6198 LNCS, no. PART 1).

    Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

  • Secretary problems via linear programming

    Buchbinder, N., Jain, K. & Singh, M., 2010, Integer Programming and Combinatorial Optimization - 14th International Conference, IPCO 2010, Proceedings. p. 163-176 14 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 6080 LNCS).

    Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

  • Towards the randomized k-server conjecture: A primal-dual approach

    Bansal, N., Buchbinder, N. & Naor, J., 2010, Proceedings of the 21st Annual ACM-SIAM Symposium on Discrete Algorithms. p. 40-55 16 p. (Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms).

    Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

  • 2009

    Dynamic power allocation under arbitrary varying channels - An online approach

    Buchbinder, N., Lewin-Eytan, L., Naor, J., Menache, I. & Orda, A., 2009, IEEE INFOCOM 2009 - The 28th Conference on Computer Communications. p. 145-153 9 p. 5061916. (Proceedings - IEEE INFOCOM).

    Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

  • 2008

    Non-cooperative cost sharing games via subsidies

    Buchbinder, N., Lewin-Eytan, L., Naor, J. & Orda, A., 2008, Algorithmic Game Theory - First International Symposium, SAGT 2008, Proceedings. p. 337-349 13 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 4997 LNCS).

    Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

  • Online make-to-order joint replenishment model: Primal dual competitive algorithms

    Buchbinder, N., Kimbrel, T., Levi, R., Makarychev, K. & Sviridenko, M., 2008, Proceedings of the 19th Annual ACM-SIAM Symposium on Discrete Algorithms. p. 952-961 10 p. (Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms).

    Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

  • Randomized competitive algorithms for generalized caching

    Bansal, N., Buchbinder, N. & Naor, J., 2008, STOC'08: Proceedings of the 2008 ACM Symposium on Theory of Computing. Association for Computing Machinery, p. 235-244 10 p. (Proceedings of the Annual ACM Symposium on Theory of Computing).

    Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

  • 2007

    An O(log2 k)-competitive algorithm for metric bipartite matching

    Bansal, N., Buchbinder, N., Gupta, A. & Naor, J., 2007, Algorithms - ESA 2007 - 15th Annual European Symposium, Proceedings. Springer Verlag, p. 522-533 12 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 4698 LNCS).

    Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

  • A primal-dual randomized algorithm for weighted paging

    Bansal, N., Buchbinder, N. & Naor, J., 2007, Proceedings of the 48th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2007. p. 507-517 11 p. 4389520. (Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS).

    Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

  • Online primal-dual algorithms for maximizing ad-auctions revenue

    Buchbinder, N., Jain, K. & Naor, J., 2007, Algorithms - ESA 2007 - 15th Annual European Symposium, Proceedings. Springer Verlag, p. 253-264 12 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 4698 LNCS).

    Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

  • 2006

    Fair online load balancing

    Buchbinder, N. & Naor, J., 2006, SPAA 2006: 18th Annual ACM Symposium on Parallelism in Algorithms and Architectures. Association for Computing Machinery, p. 291-298 8 p. (Annual ACM Symposium on Parallelism in Algorithms and Architectures; vol. 2006).

    Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

  • Improved bounds for online routing and packing via a primal-dual approach

    Buchbinder, N. & Naor, J., 2006, 47th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2006. p. 293-302 10 p. 4031365. (Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS).

    Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

  • 2001

    Mostly accurate stack scanning

    Barabash, K., Kolodner, E. K., Shepherd, J., Buchbinder, N., Ossia, Y., Sivan, R., Domani, T., Pinter, S. S. & Umansky, V., 2001, Proceedings of the 1st Java Virtual Machine Research and Technology Symposium, JVM 2001. USENIX Association, (Proceedings of the 1st Java Virtual Machine Research and Technology Symposium, JVM 2001).

    Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review