Bureaucrats, editor, Administrators
373
edits
Changes
From Theory
→Speaker
Line 3:
Line 3:
Vijay Vazirani got his Bachelor’s degree in Computer Science from MIT in 1979 and his Ph.D. from the University +of California at Berkeley in 1983. His research career has been centered around the design of algorithms and +computational complexity theory. He has made seminal contributions to the classical maximum matching problem, +approximation algorithms and the computability of equilibria, particularly algorithms for computing market equilibria.+His work in complexity theory includes the Valiant-Vazirani theorem, proving that if UNIQUE-SAT is in P then NP = RP.+ +In 2001 he published what was widely regarded as the definitive book on Approximation Algorithms. This book has +been translated into Japanese, Polish, French and Chinese. He was a Distinguished SISL Visitor at the Social and +Information Sciences Laboratory at Caltech during 2011-12. He is a Guggenheim Fellow and an ACM Fellow.+
== Speaker ==
== Speaker ==
−Allan Borodin received his BSC from Rutgers University in 1963,
−and obtained an MSC degree in 1966 from Stevens Institute of Technology
−while working as a Member of the Technical Staff at Bell Laboratories.
−He returned full time to graduate school at Cornell in 1966
−and received his PhD in 1969. He came to Canada and the University of
−Toronto in 1969 for a year or two but forgot to leave. He has been
−on the faculty of the Department of Computer Science at Toronto since 1969
−and served as department chair from 1980-1985. He has held
−visiting positions at Cornell, ETH Zurich, Universite' de Nice,
+Hebrew University, Weizmann University, Technion, Tel Aviv University,
+University of Washington
+and the Institute for Advanced Study. Professor Borodin is
+a fellow of the Royal Society of Canada and a recipient of the
+2008 CRM-Fields-PIMS Prize. He was appointed a University Professor
+in 2011.
== Abstract ==
== Abstract ==
