Yuval RabaniProfessor

Broadly speaking, I’m a computation theorist. More narrowly, I’m mainly interested in the theory of combinatorial algorithms and discrete optimization. I’m fascinated by the design and analysis of algorithms for several reasons: it’s an attempt to explore the limits of efficient computation, it’s a means to study the intrinsic properties of fundamental combinatorial problems, and there’s always some hope to find efficient solutions that might be useful in practice.

Some of my past, current, and future research interests include (in random order):

On-line computing: k-server, file allocation, reordering buffer, randomized algorithms.

Network optimization: packet and circuit routing, admission control, flow control.

Cutting and labeling graphs: sparsest cut, multiway cut, and their relatives.

Resource allocation problems: scheduling, load balancing, bin packing, bandwidth allocation.

Sketching high dimensional data, applications to nearest neighbor search and clustering.

Metric Ramsey phenomena and their applications.

Graph decompositions, Lipschitz maps of finite metrics, and approximation algorithms.

Properties, applications of transportation metrics, discrete Lipschitz extension and selection.

Local vs. global properties of metric spaces.

Pseudorandom generators that fool geometric tests, explicit geometric constructions.

Bargaining networks.

Computational aspects of discrete dynamical processes.