Vijay Vazirani

Vijay Virkumar Vazirani (Hindi: विजय वीरकुमार वज़ीरानी; b. 1957[1]) 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.

Vijay Vazirani
Vijay Vazirani in 2010 visiting the University of California, Berkeley.
Born1957
NationalityAmerican
Alma materMIT (Bachelor's degree)
University of California, Berkeley (PhD)
Awards
Scientific career
Fieldsalgorithms, computational complexity theory, algorithmic game theory.
Institutions
Doctoral advisorManuel Blum
Doctoral students

Education and career

Vazirani received his Bachelor's degree 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.[2] After postdoctoral research with Michael O. Rabin and Leslie Valiant at Harvard University, he joined the faculty at Cornell University in 1984. He moved to the Indian Institute of Technology, 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. In 2017 he moved to the University of California, Irvine as Distinguished Professor.

Research

Vazirani's 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,[3] 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.[4] 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[5] 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.

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. 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.[6]

Awards and honors

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.[7][8] In 2011, he was awarded a Guggenheim Fellowship.

gollark: NOOOOOOOOOOOOOOOOOOOOOO
gollark: What if I want one IP per Earth-consuming nanobot?
gollark: Technically that does exist, it's just a weird unrelated thing.
gollark: It works for me. Blame your ISP.
gollark: My stuff all supportsi t.

See also

References
  1. Deutsche Nationalbibliothek
  2. Vijay Vazirani at the Mathematics Genealogy Project
  3. Three of his papers on the subject from that time period have over 100 citations each, according to Google scholar: Micali, S.; Vazirani, V. V. (1980), "An algorithm for finding maximum matching in general graphs", Proc. 21st IEEE Symp. Foundations of Computer Science, pp. 17–27, doi:10.1109/SFCS.1980.12; Mulmuley, Ketan; Vazirani, Umesh V.; Vazirani, Vijay V. (1987), "Matching is as easy as matrix inversion", Combinatorica, 7 (1): 105–113, doi:10.1007/BF02579206; Karp, Richard M.; Vazirani, Umesh V.; Vazirani, Vijay V. (1990), "An optimal algorithm for on-line bipartite matching", Proc 22nd ACM Symp. Theory of Computing, pp. 352–358, doi:10.1145/100216.100262, ISBN 0-89791-361-2.
  4. Jerrum, Mark R.; Valiant, Leslie G.; Vazirani, Vijay V. (1986), "Random generation of combinatorial structures from a uniform distribution", Theoretical Computer Science, 43 (2–3): 169–188, doi:10.1016/0304-3975(86)90174-X, MR 0855970. See Bubley, Russ (2001), Randomized algorithms: approximation, generation, and counting, CPHC/BCS Distinguished Dissertations, Springer-Verlag, p. 120, doi:10.1007/978-1-4471-0695-1, ISBN 1-85233-325-1, MR 1986183; Goldreich, Oded (2008), Computational Complexity: A Conceptual Perspective, Cambridge University Press, p. 229, ISBN 9781139472746.
  5. Jain, Kamal; Vazirani, Vijay V. (2001), "Approximation algorithms for metric facility location and k-median problems using the primal-dual schema and Lagrangian relaxation", Journal of the ACM, 48 (2): 274–296, doi:10.1145/375827.375845, MR 1868717. See Williamson, David P.; Shmoys, David B. (2011), The Design of Approximation Algorithms, Cambridge University Press, p. 191, ISBN 9781139498173
  6. Mehta, Aranyak; Saberi, Amin; Vazirani, Umesh; Vazirani, Vijay (2007), "AdWords and generalized online matching", Journal of the ACM, 54 (5): Art. 22, 19, doi:10.1145/1284320.1284321, MR 2359264
  7. ACM Fellows Award: Umesh Vazirani Archived December 14, 2007, at the Wayback Machine.
  8. ACM Fellows Award: Vijay Vazirani Archived December 14, 2007, at the Wayback Machine.
This article is issued from Wikipedia. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.