Vijay Vazirani
From Wikipedia, the free encyclopedia
Vijay Vazirani received his Bachelor's degree from MIT in 1979 and his Ph.D. from the University of California, Berkeley in 1983. He is a Professor of Computer Science at Georgia Tech, and is currently McKay Visiting Professor at the University of California, Berkeley. Prior to this he taught algorithms at the undergraduate level as a Professor of Computer Science at the Indian Institute of Technology, New Delhi during the early to mid nineties. His research career has been centered around the design of algorithms, together with work on complexity theory, cryptography, coding theory, and game theory.
During the 1980's, he made important contributions to the classical maximum matching problem. During the 1990's he worked mostly on approximation algorithms, championing the primal-dual schema, which he applied to problems arising in network design, facility location and web caching, and clustering. In July 2001 he published a book on approximation algorithms (Springer-Verlag, Berlin).
One of his significant research papers was proving, along with Leslie Valiant, UNIQUE-SAT ∈ P → NP=RP (Valiant-Vazirani Theorem).
He is the brother of UC Berkeley computer science professor Umesh Vazirani.
[edit] External links
 |
This biographical article relating to a computer specialist is a stub. You can help Wikipedia by expanding it. |
