Ran Libeskind-Hadas

Algorithms, Complexity theory, Computational biology, Computer science, Network routing, Optical networks

Ran Libeskind-Hadas, PhD, R. Michael Shanahan Professor of Computer Science, researches design and analysis of algorithms.

His current research is primarily in the area of algorithms for computational biology. In particular, he has been studying the cophylogeny reconstruction problem. In this problem, there are two evolutionary trees (e.g., a host and parasite tree, a species tree and a gene tree, etc.) and the mapping between their leaves. The objective is to find the least cost mapping of one tree onto the other.

Libeskind-Hadas’ earlier research addressed the problem of designing efficient communication algorithms in optical networks employing wavelength-division multiplexting (WDM).

Media Contact

Judy Augsburger


Media Appearances

Further Resources