|
|
| (One intermediate revision by one other user not shown) |
| Line 1: |
Line 1: |
| {{Infobox person
| | The writer's title is Andera and she believes it seems fairly good. Distributing manufacturing has been his occupation for some time. It's not a typical factor but what she likes doing is to perform domino but she doesn't have the time recently. Her family members lives in Ohio but her spouse desires them to move.<br><br>Also visit my weblog: [http://formalarmour.com/index.php?do=/profile-26947/info/ email psychic readings] |
| |name = Vijay Vazirani
| |
| |image = Vijay Vazirani.jpg
| |
| |image_size = 200px
| |
| |caption = Vijay Vazirani in 2010 visiting the [[University of California, Berkeley]].
| |
| |birth_date = 1957
| |
| |birth_place =
| |
| |death_date =
| |
| |death_place =
| |
| |nationality = [[Indian American]]
| |
| |field = [[algorithms]], [[computational complexity theory]], [[algorithmic game theory]].
| |
| | |
| |work_institution =
| |
| |alma_mater = [[MIT]] (Bachelor's degree)<br>[[University of California, Berkeley]] (PhD)
| |
| |doctoral_advisor = [[Manuel Blum]]
| |
| |doctoral_students =
| |
| |occupation = Professor of Computer Science at [[Georgia Institute of Technology|Georgia Tech]].
| |
| |prizes = [[Guggenheim Fellowship]]
| |
| |religion =
| |
| |footnotes = He is the brother of [[Umesh Vazirani]]
| |
| }}
| |
| | |
| '''Vijay Virkumar [[Vazirani]]''' ({{lang-hi|विजय वीरकुमार वज़ीरानी}}; b. 1957<ref>[http://d-nb.info/gnd/122932196/about/html'' Deutsche Nationalbibliothek'']</ref>) is an [[Indian American]] Professor of Computer Science at [[Georgia Institute of Technology|Georgia Tech]].<ref>[http://www.cc.gatech.edu/fac/Vijay.Vazirani/ Faculty page at Georgia Tech]</ref>
| |
| | |
| 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]].
| |
| | |
| ==Career==
| |
| 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,<ref>Three of his papers on the subject from that time period have over 100 citations each, according to Google scholar: {{citation | last1 = Micali | first1 = S. | author1-link = Silvio Micali | last2 = Vazirani | first2 = V. V. | contribution = An <math>\scriptstyle O(\sqrt{|V|}\cdot|E|)</math> algorithm for finding maximum matching in general graphs | doi = 10.1109/SFCS.1980.12 | pages = 17–27 | title = [[Symposium on Foundations of Computer Science|Proc. 21st IEEE Symp. Foundations of Computer Science]] | year = 1980}}; {{citation|title=Matching is as easy as matrix inversion|first1=Ketan|last1=Mulmuley|authorlink=Ketan Mulmuley|first2=Umesh V.|last2=Vazirani|authorlink2=Umesh Vazirani|first3=Vijay V.|last3=Vazirani|journal=Combinatorica|volume=7|issue=1|year=1987|pages=105–113|doi=10.1007/BF02579206}}; {{citation|first1=Richard M.|last1=Karp|author1-link=Richard M. Karp|first2=Umesh V.|last2=Vazirani|first3=Vijay V.|last3=Vazirani|contribution=An optimal algorithm for on-line bipartite matching|title=[[Symposium on Theory of Computing|Proc 22nd ACM Symp. Theory of Computing]]|year=1990|pages=352–358|doi=10.1145/100216.100262|isbn=0-89791-361-2}}.</ref> and some key contributions to [[computational complexity theory]], e.g., 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.
| |
| | |
| Two of his most significant research results were proving, along with [[Leslie Valiant]], that if [[Boolean satisfiability problem#Extensions of SAT|UNIQUE-SAT]] is in [[P (complexity)|P]], then [[NP (complexity)|NP]] = [[RP (complexity)|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.
| |
| | |
| He is the brother of [[UC Berkeley]] computer science professor [[Umesh Vazirani]]. In 2005 they both were inducted as Fellows of the [[Association for Computing Machinery]].<ref>[http://fellows.acm.org/fellow_citation.cfm?id=UK41587&srt=all ACM Fellows Award: Umesh Vazirani].</ref><ref>[http://fellows.acm.org/fellow_citation.cfm?id=UK17331&srt=all ACM Fellows Award: Vijay Vazirani].</ref>
| |
| In 2011, he was awarded a [[Guggenheim Fellowship]].
| |
| | |
| == References ==
| |
| <references/>
| |
| | |
| ==External links==
| |
| *[http://www.scs.gatech.edu/people/vijay-vazirani "Vijay Vazirani"], ''Georgia Tech School of Computer Science''
| |
| *[http://genealogy.math.ndsu.nodak.edu/id.php?id=78255 "Vijay V. Vazirani"], ''Mathematics Genealogy Project''
| |
| | |
| {{Persondata <!-- Metadata: see [[Wikipedia:Persondata]]. -->
| |
| | NAME = Vazirani, Vijay
| |
| | ALTERNATIVE NAMES =
| |
| | SHORT DESCRIPTION = American theoretical computer scientist
| |
| | DATE OF BIRTH = 1951
| |
| | PLACE OF BIRTH =
| |
| | DATE OF DEATH =
| |
| | PLACE OF DEATH =
| |
| }}
| |
| {{DEFAULTSORT:Vazirani, Vijay}}
| |
| [[Category:1951 births]]
| |
| [[Category:Living people]]
| |
| [[Category:Georgia Institute of Technology faculty]]
| |
| [[Category:Fellows of the Association for Computing Machinery]]
| |
| [[Category:Massachusetts Institute of Technology alumni]]
| |
| [[Category:University of California, Berkeley alumni]]
| |
| [[Category:University of California, Berkeley faculty]]
| |
| [[Category:Theoretical computer scientists]]
| |
| [[Category:American Hindus]]
| |
| [[Category:Sindhi people]]
| |
| [[Category:Guggenheim Fellows]]
| |
The writer's title is Andera and she believes it seems fairly good. Distributing manufacturing has been his occupation for some time. It's not a typical factor but what she likes doing is to perform domino but she doesn't have the time recently. Her family members lives in Ohio but her spouse desires them to move.
Also visit my weblog: email psychic readings