Vijay Vazirani

Vijay Vazirani, 2010, University of California, Berkeley.

Vijay Virkumar Vazirani (born April 20, 1957 ) is an Indian-born American computer scientist.

Vazirani studied at the Massachusetts Institute of Technology (Bachelor's degree 1979) and received his PhD in 1983 from the University of California, Berkeley with Manuel Blum (Maximum matchings without blossoms). In the 1990s he was a professor at the Indian Institute of Technology in Delhi . He is a professor of computer science at the Georgia Institute of Technology . Among other things, he was visiting professor at Berkeley.

Vazirani worked on the development of approximation algorithms (such as the Jain-Vazirani algorithm in Facility Location 2001), pairing algorithms (matching) in graph theory (with Silvio Micali he found an improved algorithm for maximum pairings in graphs in 1980), complexity theory (where he and Leslie Valiant proved an important theorem in 1985), cryptography , coding theory, algorithmic game theory and quantum computer science.

His brother Umesh Vazirani is a computer science professor at Berkeley. Both have been Fellows of the Association for Computing Machinery (ACM) since 2005 .

His father VN Vazirani was a professor of civil engineering.

Fonts

• Approximation algorithms, Springer 2001
• with Noam Nisan, Éva Tardos , Tim Roughgarden (editors): Algorithmic Game Theory, Cambridge University Press 2007

Web links

• Literature by and about Vijay Vazirani in the catalog of the German National Library
• Homepage at Georgia Tech

Individual evidence

1. ^ Vazirani, Micali An algorithm for finding maximum matching in general graphs ${\displaystyle \textstyle O({\sqrt {|V|}}\cdot |E|)}$ , Proc. 21st IEEE Symposium Foundations Computer Science, 1980, pp. 17-27 (| V | = number of corners, | E | = number of edges)