views: 1180

# Ran Raz

Professor

Sign in to view more

Show Academic Trajectory

Ego Network

D-Core

Research Interests

Author Statistics

Experience

Sign in to view more

Education

Sign in to view more

Bio

Ran Raz is a Professor of Theoretical Computer Science at the Weizmann Institute of Science. His main research area is complexity theory, with an emphasis on proving lower bounds for various computational models. More specifically, he is interested in Boolean and arithmetic circuit complexity, communication complexity, probabilistically checkable proofs, quantum computation and communication, and randomness and derandomization.

## Papers140 papers

Sort

By YearBy Citation

Electronic Colloquium on Computational Complexity (ECCC), (2019): 152

EIBibtex

Electronic Colloquium on Computational Complexity (ECCC), (2019): 71

ITCS, pp.11:1-11:13, (2018)

Electronic Colloquium on Computational Complexity (ECCC), (2018)

STOC '18: Symposium on Theory of Computing
Los Angeles
CA
USA
June, 20..., pp.990-1002, (2018)

Electronic Colloquium on Computational Complexity (ECCC), (2018): 140

DISC, pp.34:1-34:16, (2018)

STOC, pp.1067-1080, (2017)

SIAM J. Comput., no. 1 (2017): 37-57

Electronic Colloquium on Computational Complexity (ECCC), (2017)

Electronic Colloquium on Computational Complexity, (2016): 266-275

Electronic Colloquium on Computational Complexity (ECCC), no. 8 (2016): 521-525

ACM Trans. Algorithms, no. 2 (2016)

STOC '16: Symposium on Theory of Computing
Cambridge
MA
USA
June, 2016, pp.977-986, (2016)

ACM Transactions on Algorithms, no. 2 (2016): 25

Bibtex

conference on computational complexity, pp.0, (2016)

Bibtex

ITCS, pp.293-300, (2016)

J. ACM, no. 5 (2015): 46:1-46:31

View All