Ran Raz is a faculty member in the Faculty of Mathematics and Computer Science at the Weizmann Institute of Science. His primary research area is complexity theory, with a focus on proving lower bounds for computational models. He is deeply interested in various aspects of complexity, including Boolean circuit complexity, arithmetic circuit complexity, communication complexity, propositional proof theory, and probabilistically checkable proofs. His work also explores themes in quantum computation and randomness, particularly derandomization.