World's Best Scientists 2026 revealed!

D-Index & Metrics

Computer Science

D-Index
47
Citations
9425
World Ranking
6466
National Ranking
101

Overview

Yuval Rabani is affiliated with the Hebrew University of Jerusalem in Israel. Their research primarily spans the field of Computer Science, with a focused contribution to several subfields including Artificial Intelligence, Computer Networks and Communications, Computational Theory and Mathematics, Management Science and Operations Research, and Industrial and Manufacturing Engineering.

The research topics explored by Yuval Rabani cover a range of areas within computational and operational frameworks. These include:

  • Optimization and Search Problems
  • Complexity and Algorithms in Graphs
  • Machine Learning and Algorithms
  • Advanced Bandit Algorithms Research
  • Facility Location and Emergency Management
  • Scheduling and Optimization Algorithms
  • Advanced Manufacturing and Logistics Optimization

Rabani has authored several papers published in notable venues. Some recent publications are:

  • "Shortest Paths without a Map, but with an Entropic Regularizer," 2022, 2022 IEEE 63rd Annual Symposium on Foundations of Computer Science (FOCS)
  • "The invisible hand of Laplace: The role of market structure in price convergence and oscillation," 2021, Journal of Mathematical Economics
  • "Convergence of incentive-driven dynamics in Fisher markets," 2020, Games and Economic Behavior
  • "The Randomized $k$-Server Conjecture is False!," 2022, arXiv (Cornell University)
  • "Parametrized Metrical Task Systems," 2020, Leibniz-Zentrum für Informatik (Schloss Dagstuhl)

The publication venues where Rabani frequently contributes reflect an engagement with preeminent platforms for computer science research:

  • arXiv (Cornell University)
  • Leibniz-Zentrum für Informatik (Schloss Dagstuhl)
  • SIAM Journal on Computing
  • 2022 IEEE 63rd Annual Symposium on Foundations of Computer Science (FOCS)
  • Journal of Mathematical Economics

Throughout their career, Rabani has collaborated with several co-authors. Frequent collaborators include:

  • Leonard J. Schulman
  • Sébastien Bubeck
  • Spencer Gordon
  • Bijan Mazaheri
  • Christian Coester

Best Publications

  • Efficient Search for Approximate Nearest Neighbor in High Dimensional Spaces

    Eyal Kushilevitz;Rafail Ostrovsky;Yuval Rabani

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

    Rafail Ostrovsky;Yuval Rabani;Leonard J. Schulman;Chaitanya Swamy

  • Fairness in Routing and Load Balancing

    Jon Kleinberg;Yuval Rabani;Éva Tardos

  • ON THE HARDNESS OF APPROXIMATING MULTICUT AND SPARSEST-CUT

    Shuchi Chawla;Robert Krauthgamer;Ravi Kumar;Yuval Rabani

  • An O (log k ) Approximate Min-Cut Max-Flow Theorem and Approximation Algorithm

    Yonatan Aumann;Yuval Rabani

  • Allocating Bandwidth for Bursty Connections

    Jon Kleinberg;Yuval Rabani;Éva Tardos

  • Competitive algorithms for distributed data management

    Yair Bartal;Amos Fiat;Yuval Rabani

  • An improved approximation algorithm for multiway cut

    Gruia Călinescu;Howard Karloff;Yuval Rabani

  • Approximation schemes for clustering problems

    W. Fernandez de la Vega;Marek Karpinski;Claire Kenyon;Yuval Rabani

  • Competitive k-server algorithms

    A. Fiat;Y. Rabani;Y. Ravid

  • Approximation Algorithms for the 0-Extension Problem

    Gruia Calinescu;Howard Karloff;Yuval Rabani

  • Local divergence of Markov chains and the analysis of iterative load-balancing schemes

    Y. Rabani;A. Sinclair;R. Wanka

  • Improved bounds for all optical routing

    Yonatan Aumann;Yuval Rabani

  • Low distortion embeddings for edit distance

    Rafail Ostrovsky;Yuval Rabani

  • Lower bounds for high dimensional nearest neighbor search and related problems

    Allan Borodin;Rafail Ostrovsky;Yuval Rabani

  • On-line admission control and circuit routing for high performance computing and communication

    B. Awerbuch;R. Gawlick;T. Leighton;Y. Rabani

  • Approximation Algorithms for the Job Interval Selection Problem and Related Scheduling Problems

    Julia Chuzhoy;Rafail Ostrovsky;Yuval Rabani

  • Low Distortion Maps Between Point Sets

    Claire Kenyon;Yuval Rabani;Alistair Sinclair

  • Approximation algorithms for the 0-extension problem

    Gruia Calinescu;Howard Karloff;Yuval Rabani

  • A computational view of population genetics

    Yuval Rabini;Yuri Rabinovich;Alistair Sinclair

Frequent Co-Authors

Rafail Ostrovsky
Rafail Ostrovsky University of California, Los Angeles
Howard Karloff
Howard Karloff Amazon (United States)
Leonard J. Schulman
Leonard J. Schulman California Institute of Technology
Chaitanya Swamy
Chaitanya Swamy University of Waterloo
Amos Fiat
Amos Fiat Tel Aviv University
Alistair Sinclair
Alistair Sinclair University of California, Berkeley
Allan Borodin
Allan Borodin University of Toronto
Claire Kenyon
Claire Kenyon Brown University
Robert Krauthgamer
Robert Krauthgamer Weizmann Institute of Science
Éva Tardos
Éva Tardos Cornell University

If you think any of the details on this page are incorrect, let us know.

Report an issue

We appreciate your kind effort to assist us to improve this page, it would be helpful providing us with as much detail as possible in the text box below:

Related Online Degrees & Career Pathways

Exploring online degrees can open new doors in computer science and beyond. For those interested in a strong academic foundation, an online associate degree offers a fast and flexible way to get started. These programs often take as little as six months, making them ideal for students eager to enter the workforce quickly.

If you already have a bachelor’s or master’s degree, advanced options such as cheap phd programs online provide a highly affordable pathway to academic and research careers. For those in the field of education, there are also 1 year edd programs online designed to help working professionals earn doctoral credentials in education quickly.

Computer science skills are also valued in the business world. Choosing online business degrees can equip you with management and entrepreneurial expertise for tech-driven industries. These online pathways are flexible, making it easier to balance your studies with personal and professional obligations.

Best Scientists Citing Yuval Rabani

Trending Scientists