No photo of Yuval Rabani

View Scopus Profile

Yuval Rabani

 https://orcid.org/0000-0001-7772-2544
    Calculated based on number of publications stored in Pure and citations from Scopus
    1990 …2023

    Research activity per year

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

    Search results

    • 2023

      Generalized Unrelated Machine Scheduling Problem

      Deng, S., Li, J. & Rabani, Y., 2023, 34th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2023. Association for Computing Machinery, p. 2898-2916 19 p. (Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms; vol. 2023-January).

      Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

      2 Scopus citations

    • The Randomized-Server Conjecture Is False!

      Bubeck, S., Coester, C. & Rabani, Y., 2 Jun 2023, STOC 2023 - Proceedings of the 55th Annual ACM Symposium on Theory of Computing. Saha, B. & Servedio, R. A. (eds.). Association for Computing Machinery, p. 581-594 14 p. (Proceedings of the Annual ACM Symposium on Theory of Computing).

      Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

      Open Access
      1 Scopus citations
    • 2022

      Shortest Paths without a Map, but with an Entropic Regularizer

      Bubeck, S., Coester, C. & Rabani, Y., 2022, Proceedings - 2022 IEEE 63rd Annual Symposium on Foundations of Computer Science, FOCS 2022. IEEE Computer Society, p. 1102-1113 12 p. (Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS; vol. 2022-October).

      Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

      2 Scopus citations
    • 2021

      Min-sum clustering (with outliers)

      Banerjee, S., Ostrovsky, R. & Rabani, Y., 1 Sep 2021, Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2021. Wootters, M. & Sanita, L. (eds.). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 16. (Leibniz International Proceedings in Informatics, LIPIcs; vol. 207).

      Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

      1 Scopus citations

    • Online multiserver convex chasing and optimization

      Bubeck, S., Rabani, Y. & Sellke, M., 2021, ACM-SIAM Symposium on Discrete Algorithms, SODA 2021. Marx, D. (ed.). Association for Computing Machinery, p. 2093-2104 12 p. (Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms).

      Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

      2 Scopus citations
    • 2020

      Approximation algorithms for clustering with dynamic points

      Deng, S., Li, J. & Rabani, Y., 1 Aug 2020, 28th Annual European Symposium on Algorithms, ESA 2020. Grandoni, F., Herman, G. & Sanders, P. (eds.). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 37. (Leibniz International Proceedings in Informatics, LIPIcs; vol. 173).

      Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

      1 Scopus citations

    • Parametrized metrical task systems

      Bubeck, S. & Rabani, Y., 1 Aug 2020, Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2020. Byrka, J. & Meka, R. (eds.). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, APPROX54. (Leibniz International Proceedings in Informatics, LIPIcs; vol. 176).

      Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

      2 Scopus citations
    • 2018

      Strictly balancing matrices in polynomial time using osborne's iteration

      Ostrovsky, R., Rabani, Y. & Yousefi, A., 1 Jul 2018, 45th International Colloquium on Automata, Languages, and Programming, ICALP 2018. Kaklamanis, C., Marx, D., Chatzigiannakis, I. & Sannella, D. (eds.). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 93. (Leibniz International Proceedings in Informatics, LIPIcs; vol. 107).

      Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

      1 Scopus citations
    • 2017

      Approximating sparsest cut in low rank graphs via embeddings from approximately low dimensional spaces

      Rabani, Y. & Venkat, R., 1 Aug 2017, Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques - 20th International Workshop, APPROX 2017 and 21st International Workshop, RANDOM 2017. Rolim, J. D. P., Jansen, K., Williamson, D. P. & Vempala, S. S. (eds.). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 21. (Leibniz International Proceedings in Informatics, LIPIcs; vol. 81).

      Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

    • Convergence of incentive-driven dynamics in fisher markets

      Dvijotham, K., Rabani, Y. & Schulman, L. J., 2017, 28th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2017. Klein, P. N. (ed.). Association for Computing Machinery, p. 554-567 14 p. (Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms; vol. 0).

      Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

      Open Access
      2 Scopus citations

    • Matrix balancing in Lp norms: Bounding the convergence rate of osborne's iteration

      Ostrovsky, R., Rabani, Y. & Youse, A., 2017, 28th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2017. Klein, P. N. (ed.). Association for Computing Machinery, p. 154-169 16 p. (Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms; vol. 0).

      Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

      Open Access
      11 Scopus citations
    • 2015

      Learning arbitrary statistical mixtures of discrete distributions

      Li, J., Rabani, Y., Schulman, L. J. & Swamy, C., 14 Jun 2015, STOC 2015 - Proceedings of the 2015 ACM Symposium on Theory of Computing. Association for Computing Machinery, p. 743-752 10 p. (Proceedings of the Annual ACM Symposium on Theory of Computing; vol. 14-17-June-2015).

      Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

      8 Scopus citations

    • On the randomized competitive ratio of reordering buffer management with non-uniform costs

      Avigdor-Elgrabli, N., Im, S., Moseley, B. & Rabani, Y., 2015, Automata, Languages, and Programming - 42nd International Colloquium, ICALP 2015, Proceedings. Halldorsson, M. M., Kobayashi, N., Speckmann, B. & Iwama, K. (eds.). Springer Verlag, p. 78-90 13 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 9134).

      Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

      8 Scopus citations
    • 2014

      Learning mixtures of arbitrary distributions over large discrete domains

      Rabani, Y., Schulman, L. J. & Swamy, C., 2014, ITCS 2014 - Proceedings of the 2014 Conference on Innovations in Theoretical Computer Science. Association for Computing Machinery, p. 207-223 17 p. (ITCS 2014 - Proceedings of the 2014 Conference on Innovations in Theoretical Computer Science).

      Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

      16 Scopus citations
    • 2013

      A constant factor approximation algorithm for reordering buffer management

      Avigdor-Elgrabli, N. & Rabani, Y., 2013, Proceedings of the 24th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2013. Association for Computing Machinery, p. 973-984 12 p. (Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms).

      Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

      12 Scopus citations

    • An optimal randomized online algorithm for reordering buffer management

      Avigdor-Elgrabli, N. & Rabani, Y., 2013, Proceedings - 2013 IEEE 54th Annual Symposium on Foundations of Computer Science, FOCS 2013. p. 1-10 10 p. 6686135. (Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS).

      Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

      17 Scopus citations
    • 2012

      Unconditionally-secure robust secret sharing with compact shares

      Cevallos, A., Fehr, S., Ostrovsky, R. & Rabani, Y., 2012, Advances in Cryptology, EUROCRYPT 2012 - 31st Annual International Conference on the Theory and Applications of Cryptographic Techniques, Proceedings. p. 195-208 14 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 7237 LNCS).

      Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

      Open Access
      37 Scopus citations
    • 2011

      Explicit dimension reduction and its applications

      Karnin, Z. S., Rabani, Y. & Shpilka, A., 2011, Proceedings - 26th Annual IEEE Conference on Computational Complexity, CCC 2011. p. 262-272 11 p. 5959815. (Proceedings of the Annual IEEE Conference on Computational Complexity).

      Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

      2 Scopus citations

    • On parsimonious explanations for 2-D tree- and linearly-ordered data

      Karloff, H., Korn, F., Makarychev, K. & Rabani, Y., 2011, 28th International Symposium on Theoretical Aspects of Computer Science, STACS 2011. p. 332-343 12 p. (Leibniz International Proceedings in Informatics, LIPIcs; vol. 9).

      Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

      5 Scopus citations
    • 2010

      An improved competitive algorithm for reordering buffer management

      Avigdor-Elgrabli, N. & Rabani, Y., 2010, Proceedings of the 21st Annual ACM-SIAM Symposium on Discrete Algorithms. Association for Computing Machinery (ACM), p. 13-21 9 p. (Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms).

      Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

      19 Scopus citations

    • Monotonicity in bargaining networks

      Azar, Y., Devanur, N. R., Jain, K. & Rabani, Y., 2010, Proceedings of the 21st Annual ACM-SIAM Symposium on Discrete Algorithms. p. 817-826 10 p. (Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms).

      Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

      5 Scopus citations
    • 2009

      Explicit construction of a small epsilon-net for linear threshold functions

      Rabani, Y. & Shpilka, A., 2009, STOC'09 - Proceedings of the 2009 ACM International Symposium on Theory of Computing. p. 649-658 10 p. (Proceedings of the Annual ACM Symposium on Theory of Computing).

      Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

      14 Scopus citations
    • 2008

      Approximation algorithms for labeling hierarchical taxonomies

      Rabani, Y., Schulman, L. J. & Swamy, C., 2008, Proceedings of the 19th Annual ACM-SIAM Symposium on Discrete Algorithms. p. 671-680 10 p. (Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms).

      Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

      1 Scopus citations

    • Bicriteria approximation tradeoff for the node-cost budget problem

      Rabani, Y. & Scalosub, G., 2008, Algorithm Theory - SWAT 2008 - 11th Scandinavian Workshop on Algorithm Theory, Proceedings. p. 90-101 12 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 5124 LNCS).

      Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

      2 Scopus citations
    • 2006

      Approximation algorithms for graph homomorphism problems

      Langberg, M., Rabani, Y. & Swamy, C., 2006, Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques - 9th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 2006 a. Springer Verlag, p. 176-187 12 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 4110 LNCS).

      Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

      21 Scopus citations

    • On earthmover distance, metric labeling, and 0-extension

      Karloff, H., Khot, S., Mehta, A. & Rabani, Y., 2006, STOC'06: Proceedings of the 38th Annual ACM Symposium on Theory of Computing. Association for Computing Machinery, p. 547-556 10 p. (Proceedings of the Annual ACM Symposium on Theory of Computing; vol. 2006).

      Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

      4 Scopus citations

    • The effectiveness of Lloyd-type methods for the k-means problem

      Ostrovsky, R., Rabani, Y., Schulman, L. J. & Swamy, C., 2006, 47th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2006. p. 165-174 10 p. 4031353. (Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS).

      Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

      205 Scopus citations
    • 2005

      Error-correcting codes for automatic control

      Ostrovsky, R., Rabanit, Y. & Schulman, L. J., 2005, Proceedings - 46th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2005. IEEE Computer Society, p. 309-316 8 p. 1530723. (Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS; vol. 2005).

      Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

      9 Scopus citations

    • On the hardness of approximating multicut and sparsest-cut

      Chawla, S., Krauthgamer, R., Kumar, R., Rabani, Y. & Sivakumar, D., 2005, Proceedings of the 20th Annual IEEE Conference on Computational Complexity. p. 144-153 10 p. (Proceedings of the Annual IEEE Conference on Computational Complexity).

      Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

      54 Scopus citations
    • 2002

      Improved approximation algorithms for resource allocation

      Calinescu, G., Chakrabarti, A., Karloff, H. & Rabani, Y., 2002, Integer Programming and Combinatorial Optimization - 9th International IPCO 2002 Conference, Proceedings. Cook, W. J. & Schulz, A. S. (eds.). Springer Verlag, p. 401-414 14 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 2337 LNCS).

      Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

      62 Scopus citations

    • Search and classification of high dimensional data

      Rabani, Y., 2002, Approximation Algorithms for Combinatorial Optimization - 5th International Workshop, APPROX 2002, Proceedings. Jansen, K., Leonardi, S. & Vazirani, V. (eds.). Springer Verlag, p. 1-2 2 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 2462).

      Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

    • 2001

      Approximation algorithms for the 0-extension problem

      Calinescu, G., Karloff, H. & Rabani, Y., 2001, Proceedings of the 12th Annual ACM-SIAM Symposium on Discrete Algorithms. p. 8-16 9 p. (Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms).

      Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

      62 Scopus citations

    • Stability preserving transformations: Packet routing networks with edge capacities and speeds

      Borodin, A., Ostrovsky, R. & Rabani, Y., 2001, Proceedings of the 12th Annual ACM-SIAM Symposium on Discrete Algorithms. p. 601-610 10 p. (Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms).

      Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

      18 Scopus citations

    • Tree packing and approximating k-cuts

      Joseph, N. & Rabani, Y., 2001, Proceedings of the 12th Annual ACM-SIAM Symposium on Discrete Algorithms. p. 26-27 2 p. (Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms).

      Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

      30 Scopus citations
    • 2000

      Tighter bounds for nearest neighbor search and related problems in the cell probe model

      Barkol, O. & Rabani, Y., 2000, Proceedings of the 32nd Annual ACM Symposium on Theory of Computing, STOC 2000. p. 388-396 9 p. (Proceedings of the Annual ACM Symposium on Theory of Computing).

      Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

      Open Access
      25 Scopus citations
    • 1996

      Biased random walks, lyapunov functions, and stochastic analysis of best fit bin packing (Preliminary Version)

      Kenyon, C., Rabani, Y. & Sinclair, A., 28 Jan 1996, Proceedings of the 7th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 1996. Association for Computing Machinery, p. 351-358 8 p. (Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms; vol. Part F129447).

      Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

      10 Scopus citations

    • Distributed packet switching in arbitrary networks

      Rabani, Y. & Tardos, É., 1 Jul 1996, Proceedings of the 28th Annual ACM Symposium on Theory of Computing, STOC 1996. Association for Computing Machinery, p. 366-375 10 p. (Proceedings of the Annual ACM Symposium on Theory of Computing; vol. Part F129452).

      Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

      47 Scopus citations
    • 1995

      Fairness in scheduling

      Ajtai, M., Aspnes, J., Naor, M., Rabani, Y., Schulman, L. J. & Waarts, O., 22 Jan 1995, Proceedings of the 6th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 1995. Association for Computing Machinery, p. 477-485 9 p. (Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms).

      Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

      4 Scopus citations
    • 1994

      Simulating quadratic dynamical systems is PSPACE-complete (preliminary version)

      Arora, S., Rabani, Y. & Vazirani, U., 23 May 1994, Proceedings of the 26th Annual ACM Symposium on Theory of Computing, STOC 1994. Association for Computing Machinery, p. 459-467 9 p. (Proceedings of the Annual ACM Symposium on Theory of Computing; vol. Part F129502).

      Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

      18 Scopus citations
    • 1993

      On the value of information in coordination games

      Irani, S. & Rabani, Y., 1993, Annual Symposium on Foundatons of Computer Science (Proceedings). Anon (ed.). Publ by IEEE, p. 12-21 10 p. (Annual Symposium on Foundatons of Computer Science (Proceedings)).

      Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

      9 Scopus citations
    • 1992

      A decomposition theorem and bounds for randomized server problems

      Blum, A., Karloff, H., Rabani, Y. & Saks, M., 1992, Proceedings - 33rd Annual Symposium on Foundations of Computer Science, FOCS 1992. IEEE Computer Society, p. 197-207 11 p. 267772. (Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS; vol. 1992-October).

      Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

      26 Scopus citations

    • Competitive algorithms for distributed data management

      Bartal, Y., Fiat, A. & Rabani, Y., 1 Jul 1992, Proceedings of the 24th Annual ACM Symposium on Theory of Computing, STOC 1992. Association for Computing Machinery, p. 39-50 12 p. (Proceedings of the Annual ACM Symposium on Theory of Computing; vol. Part F129722).

      Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

      82 Scopus citations
    • 1991

      Competitive algorithms for layered graph traversal

      Fiat, A., Foster, D. P., Karloff, H., Rabani, Y., Ravid, Y. & Viswanathan, S., Dec 1991, Annual Symposium on Foundations of Computer Science (Proceedings). Publ by IEEE, p. 288-297 10 p. (Annual Symposium on Foundations of Computer Science (Proceedings)).

      Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

      27 Scopus citations
    Your message has successfully been sent.
    Your message was not sent due to an error.