Background
Vazirani, Vijay V. was born on April 20, 1957 in Mumbai, Maharashtra, India. Son of Virkumar and Kamla Vazirani.
(Covering the basic techniques used in the latest research...)
Covering the basic techniques used in the latest research work, the author consolidates progress made so far, including some very recent and promising results, and conveys the beauty and excitement of work in the field. He gives clear, lucid explanations of key results and ideas, with intuitive proofs, and provides critical examples and numerous illustrations to help elucidate the algorithms. Many of the results presented have been simplified and new insights provided. Of interest to theoretical computer scientists, operations researchers, and discrete mathematicians.
http://www.amazon.com/gp/product/3540653678/?tag=2022091-20
university professor computer scientist
Vazirani, Vijay V. was born on April 20, 1957 in Mumbai, Maharashtra, India. Son of Virkumar and Kamla Vazirani.
He received his Bachelor"s degree from Massachusetts Institute of Technology in 1979 and his Doctor of Philosophy 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. 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, 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 UNIQUE-SAT is in P, then Natural Philosophy = 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 University of California Berkeley computer science professor Umesh Vazirani. In 2005 they both were inducted as Fellows of the Association for Computing Machinery. In 2011, he was awarded a Guggenheim Fellowship.
(Covering the basic techniques used in the latest research...)
Married Milena Mihail. 1 child Michel.