Seguir
Ran Raz
Ran Raz
Dirección de correo verificada de princeton.edu - Página principal
Título
Citado por
Citado por
Año
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
10981997
A parallel repetition theorem
R Raz
Proceedings of the twenty-seventh annual ACM symposium on Theory of …, 1995
9331995
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
5562004
Distance labeling in graphs
C Gavoille, D Peleg, S Pérennes, R Raz
Journal of algorithms 53 (1), 85-112, 2004
4382004
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
3101998
Exponential separation of quantum and classical communication complexity
R Raz
Proceedings of the thirty-first annual ACM symposium on Theory of computing …, 1999
2951999
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
2702007
Extracting all the randomness and reducing the error in Trevisan's extractors
R Raz, O Reingold, S Vadhan
Proceedings of the thirty-first annual ACM symposium on Theory of computing …, 1999
2681999
Separation of the monotone NC hierarchy
R Raz, P McKenzie
Proceedings 38th Annual Symposium on Foundations of Computer Science, 234-243, 1997
2391997
Monotone circuits for matching require linear depth
R Raz, A Wigderson
Journal of the ACM (JACM) 39 (3), 736-744, 1992
2301992
Two-query PCP with subconstant error
D Moshkovitz, R Raz
Journal of the ACM (JACM) 57 (5), 1-29, 2008
2122008
Extractors with weak random seeds
R Raz
Proceedings of the thirty-seventh annual ACM symposium on Theory of …, 2005
2122005
Multi-linear formulas for permanent and determinant are of super-polynomial size
R Raz
Journal of the ACM (JACM) 56 (2), 1-17, 2009
210*2009
Super-logarithmic depth lower bounds via the direct sum in communication complexity
M Karchmer, R Raz, A Wigderson
Computational Complexity 5, 191-204, 1995
202*1995
Lower bounds for cutting planes proofs with small coefficients
M Bonet, T Pitassi, R Raz
Proceedings of the twenty-seventh annual ACM symposium on Theory of …, 1995
2021995
Deterministic polynomial identity testing in non-commutative models
R Raz, A Shpilka
computational complexity 14, 1-19, 2005
1782005
On the complexity of matrix product
R Raz
Proceedings of the thiry-fourth annual ACM symposium on Theory of computing …, 2002
1722002
On interpolation and automatization for Frege systems
ML Bonet, T Pitassi, R Raz
SIAM Journal on Computing 29 (6), 1939-1967, 2000
169*2000
How to delegate computations: the power of no-signaling proofs
YT Kalai, R Raz, RD Rothblum
ACM Journal of the ACM (JACM) 69 (1), 1-82, 2021
1652021
Memory delegation
KM Chung, YT Kalai, FH Liu, R Raz
Annual Cryptology Conference, 151-168, 2011
1552011
El sistema no puede realizar la operación en estos momentos. Inténtalo de nuevo más tarde.
Artículos 1–20