Ran Raz
Ran Raz
Verified email at princeton.edu - Homepage
TitleCited byYear
A sub-constant error-probability low-degree test, and a sub-constant error-probability PCP characterization of NP
R Raz, S Safra
Proceedings of the twenty-ninth annual ACM symposium on Theory of computing …, 1997
9511997
A parallel repetition theorem
R Raz
SIAM Journal on Computing 27 (3), 763-803, 1998
7811998
ProMate: a structure based prediction program to identify the location of protein–protein binding sites
H Neuvirth, R Raz, G Schreiber
Journal of molecular biology 338 (1), 181-199, 2004
4732004
Distance labeling in graphs
C Gavoille, D Peleg, S Pérennes, R Raz
Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms …, 2001
3482001
Approximating-CVP to within almost-polynomial factors is NP-hard
I Dinur, G Kindler, S Safra
Proceedings 39th Annual Symposium on Foundations of Computer Science (Cat …, 1998
2421998
Exponential separation of quantum and classical communication complexity
R Raz
Proceedings of the thirty-first annual ACM symposium on Theory of computing …, 1999
2361999
Extracting all the randomness and reducing the error in Trevisan's extractors
R Raz, O Reingold, S Vadhan
Journal of Computer and System Sciences 65 (1), 97-128, 2002
2142002
Monotone circuits for matching require linear depth
R Raz, A Wigderson
Journal of the ACM (JACM) 39 (3), 736-744, 1992
1971992
Exponential separations for one-way quantum communication complexity, with applications to cryptography
D Gavinsky, J Kempe, I Kerenidis, R Raz, R De Wolf
Proceedings of the thirty-ninth annual ACM symposium on Theory of computing …, 2007
1852007
Lower bounds for cutting planes proofs with small coefficients
M Bonet, T Pitassi, R Raz
The Journal of Symbolic Logic 62 (3), 708-728, 1997
1701997
Extractors with weak random seeds
R Raz
Proceedings of the thirty-seventh annual ACM symposium on Theory of …, 2005
1692005
Separation of the monotone NC hierarchy
R Raz, P McKenzie
Proceedings 38th Annual Symposium on Foundations of Computer Science, 234-243, 1997
1691997
Multi-linear formulas for permanent and determinant are of super-polynomial size
R Raz
Journal of the ACM (JACM) 56 (2), 1-17, 2009
158*2009
Two-query PCP with subconstant error
D Moshkovitz, R Raz
Journal of the ACM (JACM) 57 (5), 1-29, 2008
1582008
Super-logarithmic depth lower bounds via the direct sum in communication complexity
M Karchmer, R Raz, A Wigderson
Computational Complexity 5 (3-4), 191-204, 1995
153*1995
On interpolation and automatization for Frege systems
ML Bonet, T Pitassi, R Raz
SIAM Journal on Computing 29 (6), 1939-1967, 2000
145*2000
Memory delegation
KM Chung, YT Kalai, FH Liu, R Raz
Annual Cryptology Conference, 151-168, 2011
1382011
Deterministic polynomial identity testing in non-commutative models
R Raz, A Shpilka
Computational Complexity 14 (1), 1-19, 2005
1382005
Lower bounds and separations for constant depth multilinear circuits
R Raz, A Yehudayoff
Computational Complexity 18 (2), 171-207, 2009
1122009
Lower bounds on the distortion of embedding finite metric spaces in graphs
Y Rabinovich, R Raz
Discrete & Computational Geometry 19 (1), 79-94, 1998
1091998
The system can't perform the operation now. Try again later.
Articles 1–20