Obserwuj
Ran Raz
Ran Raz
Zweryfikowany adres z princeton.edu - Strona główna
Tytuł
Cytowane przez
Cytowane przez
Rok
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
10511997
A parallel repetition theorem
R Raz
SIAM Journal on Computing 27 (3), 763-803, 1998
8651998
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
5292004
Distance labeling in graphs
C Gavoille, D Peleg, S Pérennes, R Raz
Journal of Algorithms 53 (1), 85-112, 2004
3982004
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
2781998
Exponential separation of quantum and classical communication complexity
R Raz
Proceedings of the thirty-first annual ACM symposium on Theory of computing …, 1999
2761999
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
2472002
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
2372007
Monotone circuits for matching require linear depth
R Raz, A Wigderson
Journal of the ACM (JACM) 39 (3), 736-744, 1992
2221992
Separation of the monotone NC hierarchy
R Raz, P McKenzie
Proceedings 38th Annual Symposium on Foundations of Computer Science, 234-243, 1997
2151997
Extractors with weak random seeds
R Raz
Proceedings of the thirty-seventh annual ACM symposium on Theory of …, 2005
1952005
Two-query PCP with subconstant error
D Moshkovitz, R Raz
Journal of the ACM (JACM) 57 (5), 1-29, 2008
1932008
Multi-linear formulas for permanent and determinant are of super-polynomial size
R Raz
Journal of the ACM (JACM) 56 (2), 1-17, 2009
192*2009
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
1891997
Deterministic polynomial identity testing in non-commutative models
R Raz, A Shpilka
computational complexity 14 (1), 1-19, 2005
1802005
Super-logarithmic depth lower bounds via the direct sum in communication complexity
M Karchmer, R Raz, A Wigderson
Computational Complexity 5 (3), 191-204, 1995
180*1995
On interpolation and automatization for Frege systems
ML Bonet, T Pitassi, R Raz
SIAM Journal on Computing 29 (6), 1939-1967, 2000
164*2000
Memory delegation
KM Chung, YT Kalai, FH Liu, R Raz
Annual Cryptology Conference, 151-168, 2011
1532011
On the complexity of matrix product
R Raz
Proceedings of the thiry-fourth annual ACM symposium on Theory of computing …, 2002
1532002
How to delegate computations: the power of no-signaling proofs
YT Kalai, R Raz, RD Rothblum
Proceedings of the forty-sixth annual ACM symposium on Theory of computing …, 2014
1312014
Nie można teraz wykonać tej operacji. Spróbuj ponownie później.
Prace 1–20