Vijay Virkumar Vazirani (born 1957) is an Indian American theoretical computer scientist and distinguished professor of computer science at the University of California, Irvine. He studied at IIT Delhi and then at MIT, earning his bachelor's degree in 1979, and received his doctorate at Berkeley in 1983 under Manuel Blum. He held posts at Cornell, IIT Delhi and Georgia Tech before moving to Irvine in 2017. His research covers algorithm design, computational complexity, cryptography and algorithmic game theory. In the 1980s he contributed to maximum matching, including the Micali-Vazirani algorithm, and proved the isolation lemma and, with Leslie Valiant, the Valiant-Vazirani theorem. He championed the primal-dual schema for approximation algorithms, wrote a widely used book on approximation algorithms in 2001, and has studied the computability of market equilibria. He was inducted as an ACM Fellow in 2005 and received the John von Neumann Theory Prize in 2022.
Facts
Connections
In Branch
Source Vijay Vazirani (Wikipedia)
Mentored By
Source Vijay Vazirani (Wikipedia)
Principal Result
Source Vijay Vazirani (Wikipedia)
Proofs Credited
Source Valiant-Vazirani theorem, Wikipedia
In the Other Atlases
Same As
Also in Computing Atlas: the same subject.
Nationality
Also in Geography Atlas: the nationality of this subject.
Source Vijay Vazirani (Wikipedia)Lead, nationality / cultureQuote, Lead, nationality / culture
is an Indian American distinguished professor
Also in Geography Atlas: the nationality of this subject.
Source Vijay Vazirani (Wikipedia)Lead, nationality / cultureQuote, Lead, nationality / culture
is an Indian American distinguished professor
Sources
1. Vijay Vazirani (Wikipedia)
Lead
Vijay Virkumar Vazirani (Hindi: विजय वीरकुमार वज़ीरानी; b. 1957)
Education and career
he joined the faculty at Cornell University in 1984
Lead, nationality / culture
is an Indian American distinguished professor
In Branch: Computational Complexity Theory, Research
together with work on computational complexity theory, cryptography, and algorithmic game theory
Principal Result: Valiant-Vazirani Theorem, Research
the isolation lemma, the Valiant-Vazirani theorem
Mentored By: Manuel Blum, Education
was supervised by Manuel Blum
View the SourceValiant-Vazirani theorem, Wikipedia
Proofs Credited: Valiant-Vazirani Theorem, Lead sentenceQuote, Proofs Credited: Valiant-Vazirani Theorem, Lead sentence
It was proven by Leslie Valiant and Vijay Vazirani in their paper titled NP is as easy as detecting unique solutions published in 1986.
View the Source Reader Challenges (0)
No disputes yet. Spotted an error or a better source? Open the first one.
Sign in to dispute this or suggest a correction.