Date: Thu, 21 Nov 1996 19:53:42 GMT Server: NCSA/1.4 Content-type: text/html Last-modified: Fri, 09 Aug 1996 22:16:27 GMT Content-length: 2544
Ph.D., University of California at Berkeley
Associate Professor
(510) 642-0572
vazirani@cs.berkeley.edu
Editor
Computational Complexity
Member
Editorial Board, Probability Combinatorics and Complexity
Member
Program Committee, Foundations of Computer Science, 1986
Member
Program Committee, Symposium on the Theory of Computing, 1990
Co-Chairman
Workshop on Randomized Algorithms, 1991
A Markovian Extension of Valiants Learning Model
(with D. Aldous),
Proc. Conf. Foundations of Computer Science, 1990. Also, submitted for
publication to Information and Computation.
Matching Is as Easy as Matrix Inversion
(with K. Mulmuley and V. V. Vazirani), Combinatorica, Vol. 7, No. 1, 1987 (invited paper).
Towards a Strong Communication Complexity Theory or Generating
Quasi-Random Sequences from Two Communicating Semi-Random Sources
Combinatorica, Vol. 7, No. 4, 1987 (invited paper).
Generating Quasi-Random Sequences from Semi-Random Sources
(with M. Santha), J. Computational Systems Sci., Vol. 33, No. 1,
1986 (invited paper).
Random Polynomial Time Is Equal to Semi-Random Polynomial Time
(with
V. V. Vazirani), Proc. Conf. Foundations of Computer Science, 1985.