About the Author
Ran Raz
Professor
Department of Computer Science and Applied Mathematics
Weizmann Institute of Science
Rehovot 76100, Israel
ran.raz[ta]weizmann[td]ac[td]il
http://www.wisdom.weizmann.ac.il/~ranraz/
Professor
Department of Computer Science and Applied Mathematics
Weizmann Institute of Science
Rehovot 76100, Israel
ran.raz[ta]weizmann[td]ac[td]il
http://www.wisdom.weizmann.ac.il/~ranraz/
Ran Raz received his
Ph.D. in 1992 from Hebrew University
under the supervision of Michael Ben-Or and Avi Wigderson.
Since 1994, he has been a faculty member in the Faculty of
Mathematics and Computer Science at the
Weizmann Institute.
His main research area is complexity theory, with emphasis
on proving lower bounds for computational models.
More specifically, he is interested in Boolean circuit complexity,
arithmetic circuit complexity, communication complexity,
propositional proof theory, probabilistically checkable proofs,
quantum computation and communication, and
randomness and derandomization.