Vijay Vazirani

Vijay Vazirani
Vijay Vazirani in 2010 visiting the University of California, Berkeley.
Born	1957
Nationality	Indian American
Alma mater	MIT (Bachelor's degree) University of California, Berkeley (PhD)
Occupation	Professor of Computer Science at Georgia Tech.
Notes
He is the brother of Umesh Vazirani

Vijay Virkumar Vazirani (Hindi: विजय वीरकुमार वज़ीरानी; b. 1957) is an Indian American Professor of Computer Science at Georgia Tech.

He received his Bachelor's degree from MIT in 1979 and his Ph.D. from the University of California, Berkeley in 1983. During the early to mid nineties, he was a Professor of Computer Science at the Indian Institute of Technology, Delhi. Vijay Vazirani was also a McKay Visiting Professor at the University of California, Berkeley, and a Distinguished SISL Visitor at the Social and Information Sciences Laboratory at the California Institute of Technology.

His research career has been centered around the design of algorithms, together with work on computational complexity theory, cryptography, and algorithmic game theory.

During the 1980s, he made seminal contributions to the classical maximum matching problem, and some key contributions to computational complexity theory, e.g., the isolation lemma and the Valiant-Vazirani theorem. During the 1990s 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 what is widely regarded as the definitive book on approximation algorithms (Springer-Verlag, Berlin). Since 2002, he has been at the forefront of the effort to understand the computability of market equilibria, with an extensive body of work on the topic.