- Home
- Best Scientists - Computer Science
- Yuval Rabani

Discipline name
D-index
D-index (Discipline H-index) only includes papers and citation values for an examined
discipline in contrast to General H-index which accounts for publications across all
disciplines.
Citations
Publications
World Ranking
National Ranking

Computer Science
D-index
42
Citations
8,095
112
World Ranking
5239
National Ranking
96

- Algorithm
- Combinatorics
- Computer network

Yuval Rabani mostly deals with Combinatorics, Approximation algorithm, Algorithm, Mathematical optimization and Discrete mathematics. His Combinatorics study combines topics in areas such as Search algorithm and k-nearest neighbors algorithm. He has researched Approximation algorithm in several fields, including Flow control, Optimization problem and Knapsack problem.

His work deals with themes such as Nearest neighbor search and Competitive analysis, which intersect with Algorithm. His research in Mathematical optimization intersects with topics in Probabilistic logic, Load balancing and Directed graph. Many of his studies on Discrete mathematics apply to Linear programming relaxation as well.

- Efficient search for approximate nearest neighbor in high dimensional spaces (258 citations)
- An O (log k ) Approximate Min-Cut Max-Flow Theorem and Approximation Algorithm (240 citations)
- The Effectiveness of Lloyd-Type Methods for the k-Means Problem (236 citations)

His main research concerns Combinatorics, Discrete mathematics, Approximation algorithm, Upper and lower bounds and Metric space. His Combinatorics research is multidisciplinary, relying on both Norm and Competitive analysis. His Competitive analysis research incorporates themes from Algorithm, Randomized algorithm and Distributed computing.

His work carried out in the field of Discrete mathematics brings together such families of science as Embedding, Edit distance and Metric. His Approximation algorithm study is related to the wider topic of Mathematical optimization. His Mathematical optimization research integrates issues from Probabilistic logic and Load balancing.

- Combinatorics (46.76%)
- Discrete mathematics (35.97%)
- Approximation algorithm (23.02%)

- Combinatorics (46.76%)
- Discrete mathematics (35.97%)
- Metric space (16.55%)

Yuval Rabani mainly investigates Combinatorics, Discrete mathematics, Metric space, Competitive analysis and Time complexity. His Combinatorics study incorporates themes from Embedding and Norm. His biological study spans a wide range of topics, including Theory of computation and Finite set.

His research integrates issues of Cluster analysis and Conjecture in his study of Metric space. His work is dedicated to discovering how Cluster analysis, Approximation algorithm are connected with Temporal database and other disciplines. The study incorporates disciplines such as Mathematical optimization and Online algorithm in addition to Competitive analysis.

- On Lipschitz extension from finite subsets (11 citations)
- Matrix balancing in Lp norms: bounding the convergence rate of osborne's iteration (10 citations)
- Learning Arbitrary Statistical Mixtures of Discrete Distributions (9 citations)

- Algorithm
- Computer network
- Combinatorics

His primary scientific interests are in Combinatorics, Buffer, Competitive analysis, Mathematical optimization and Time complexity. Yuval Rabani is involved in the study of Combinatorics that focuses on Conjecture in particular. His studies in Competitive analysis integrate themes in fields like Dual and Linear programming relaxation.

The Mathematical optimization study combines topics in areas such as Mathematical economics, Game theory, Solution concept and Demand curve. His Time complexity research is multidisciplinary, incorporating elements of Upper and lower bounds, Norm, Lp space and Balanced matrix. His Discrete mathematics study combines topics from a wide range of disciplines, such as Function, Mixture model and Numerical linear algebra.

This overview was generated by a machine learning system which analysed the scientist’s body of work. If you have any feedback, you can contact us here.

Efficient Search for Approximate Nearest Neighbor in High Dimensional Spaces

Eyal Kushilevitz;Rafail Ostrovsky;Yuval Rabani.

SIAM Journal on Computing **(2000)**

1404 Citations

Efficient Search for Approximate Nearest Neighbor in High Dimensional Spaces

Eyal Kushilevitz;Rafail Ostrovsky;Yuval Rabani.

SIAM Journal on Computing **(2000)**

1404 Citations

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

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

Journal of the ACM **(2013)**

899 Citations

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

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

Journal of the ACM **(2013)**

899 Citations

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

Yonatan Aumann;Yuval Rabani.

SIAM Journal on Computing **(1998)**

327 Citations

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

Yonatan Aumann;Yuval Rabani.

SIAM Journal on Computing **(1998)**

327 Citations

ON THE HARDNESS OF APPROXIMATING MULTICUT AND SPARSEST-CUT

Shuchi Chawla;Robert Krauthgamer;Ravi Kumar;Yuval Rabani.

Computational Complexity **(2006)**

324 Citations

ON THE HARDNESS OF APPROXIMATING MULTICUT AND SPARSEST-CUT

Shuchi Chawla;Robert Krauthgamer;Ravi Kumar;Yuval Rabani.

Computational Complexity **(2006)**

324 Citations

Competitive algorithms for distributed data management

Yair Bartal;Amos Fiat;Yuval Rabani.

symposium on the theory of computing **(1995)**

289 Citations

Competitive algorithms for distributed data management

Yair Bartal;Amos Fiat;Yuval Rabani.

symposium on the theory of computing **(1995)**

289 Citations

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

Contact us

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:

University of California, Los Angeles

Amazon (United States)

California Institute of Technology

University of California, Berkeley

Tel Aviv University

University of Toronto

Weizmann Institute of Science

Tel Aviv University

Cornell University

Courant Institute of Mathematical Sciences

Université Catholique de Louvain

Tsinghua University

University of Turin

Virginia Tech

University of Queensland

University of Southern Denmark

Sun Pharma (India)

Space Science Institute

Institut de Physique du Globe de Paris

Pennsylvania State University

University of British Columbia

RWTH Aachen University

University of California, Los Angeles

University of California, Los Angeles

Northwestern University

Monash University

Something went wrong. Please try again later.