Age, Biography and Wiki

Vijay Vazirani was born on 1951 in India, is an Indian American professor of computer science. Discover Vijay Vazirani's Biography, Age, Height, Physical Stats, Dating/Affairs, Family and career updates. Learn How rich is he in this year and how he spends money? Also learn how he earned most of networth at the age of 73 years old?

Popular As N/A
Occupation N/A
Age 73 years old
Zodiac Sign
Born 1951, 1951
Birthday 1951
Birthplace India
Nationality India

We recommend you to check the complete list of Famous People born on 1951. He is a member of famous professor with the age 73 years old group.

Vijay Vazirani Height, Weight & Measurements

At 73 years old, Vijay Vazirani height not available right now. We will update Vijay Vazirani's Height, weight, Body Measurements, Eye Color, Hair Color, Shoe & Dress size soon as possible.

Physical Status
Height Not Available
Weight Not Available
Body Measurements Not Available
Eye Color Not Available
Hair Color Not Available

Dating & Relationship status

He is currently single. He is not dating anyone. We don't have much information about He's past relationship and any previous engaged. According to our Database, He has no children.

Family
Parents Not Available
Wife Not Available
Sibling Not Available
Children Not Available

Vijay Vazirani Net Worth

His net worth has been growing significantly in 2023-2024. So, how much is Vijay Vazirani worth at the age of 73 years old? Vijay Vazirani’s income source is mostly from being a successful professor. He is from India. We have estimated Vijay Vazirani's net worth, money, salary, income, and assets.

Net Worth in 2024 $1 Million - $5 Million
Salary in 2024 Under Review
Net Worth in 2023 Pending
Salary in 2023 Under Review
House Not Available
Cars Not Available
Source of Income professor

Vijay Vazirani Social Network

Instagram
Linkedin
Twitter
Facebook
Wikipedia
Imdb

Timeline

1957

Vijay Virkumar Vazirani (विजय वीरकुमार वज़ीरानी; b. 1957 ) is an Indian American distinguished professor of computer science in the Donald Bren School of Information and Computer Sciences at the University of California, Irvine.

1979

Vazirani first majored in electrical engineering at Indian Institute of Technology, Delhi but in his second year he transferred to MIT and received his bachelor's degree in computer science from MIT in 1979 and his Ph.D. from the University of California, Berkeley in 1983.

His dissertation, Maximum Matchings without Blossoms, was supervised by Manuel Blum.

1980

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, the Valiant-Vazirani theorem, and the equivalence between random generation and approximate counting.

His research results also include proving, along with Leslie Valiant, that if UNIQUE-SAT is in P, then NP = RP (Valiant–Vazirani theorem), and obtaining in 1980, along with Silvio Micali, an algorithm for finding maximum matchings in general graphs; the latter is still the most efficient known algorithm for the problem.

1984

After postdoctoral research with Michael O. Rabin and Leslie Valiant at Harvard University, he joined the faculty at Cornell University in 1984.

1990

He moved to the IIT Delhi as a full professor in 1990, and moved again to the Georgia Institute of Technology in 1995.

He 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.

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.

2001

In July 2001 he published what is widely regarded as the definitive book on approximation algorithms (Springer-Verlag, Berlin).

2002

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.

2005

In 2005 both Vazirani and his brother Umesh Vazirani (also a theoretical computer scientist, at the University of California, Berkeley) were inducted as Fellows of the Association for Computing Machinery.

2007

With Mehta, Saberi, and Umesh Vazirani, he showed in 2007 how to formulate the problem of choosing advertisements for AdWords as an online matching problem, and found a solution to this problem with optimal competitive ratio.

2011

In 2011, he was awarded a Guggenheim Fellowship.

In 2022, Vazirani received the John von Neumann Theory Prize for "fundamental and sustained contributions to the design of algorithms, including approximation algorithms, computational complexity theory, and algorithmic game theory, central to operations research and the management sciences".

2017

In 2017 he moved to the University of California, Irvine as distinguished professor.

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