• 4698 Citations
  • 34 h-Index
1989 …2020

Research output per year

If you made any changes in Pure these will be visible here soon.

Research Output

Filter
Conference article
2005

Extractors with weak random seeds

Raz, R., Dec 1 2005, In : Proceedings of the Annual ACM Symposium on Theory of Computing. p. 11-20 10 p.

Research output: Contribution to journalConference article

113 Scopus citations
2004

Deterministic extractors for bit-fixing sources by obtaining an independent seed

Gabizon, A., Raz, R. & Shaltiel, R., Dec 1 2004, In : Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS. p. 394-403 10 p.

Research output: Contribution to journalConference article

26 Scopus citations

Deterministic polynomial identity testing in non commutative models

Raz, R. & Shpilka, A., Oct 18 2004, In : Proceedings of the Annual IEEE Conference on Computational Complexity. 19, p. 215-222 8 p.

Research output: Contribution to journalConference article

10 Scopus citations
40 Scopus citations

Multilinear-NC 1 ≠ multilinear-NC 2

Raz, R., Dec 1 2004, In : Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS. p. 344-351 8 p.

Research output: Contribution to journalConference article

18 Scopus citations

On the power of quantum proofs

Raz, R. & Shpilka, A., Oct 18 2004, In : Proceedings of the Annual IEEE Conference on Computational Complexity. 19, p. 260-274 15 p.

Research output: Contribution to journalConference article

21 Scopus citations
2002

Bounded-depth Frege lower bounds for weaker pigeonhole principles

Buresh-Oppenheim, J., Beame, P., Pitassi, T., Raz, R. & Sabharwal, A., Dec 1 2002, In : Annual Symposium on Foundations of Computer Science - Proceedings. p. 583-592 10 p.

Research output: Contribution to journalConference article

On the complexity of matrix product

Raz, R., 2002, In : Conference Proceedings of the Annual ACM Symposium on Theory of Computing. p. 144-151 8 p.

Research output: Contribution to journalConference article

22 Scopus citations

Resolution lower bounds for the weak pigeonhole principle

Raz, R., 2002, In : Conference Proceedings of the Annual ACM Symposium on Theory of Computing. p. 553-562 10 p.

Research output: Contribution to journalConference article

18 Scopus citations
2001

Explicit lower bound of 4.5n - o(n) for Boolean circuits

Lachish, O. & Raz, R., Sep 29 2001, In : Conference Proceedings of the Annual ACM Symposium on Theory of Computing. p. 399-408 10 p.

Research output: Contribution to journalConference article

36 Scopus citations

Lower bounds for matrix product, in bounded depth circuits with arbitrary gates

Raz, R. & Shpilka, A., 2001, In : Conference Proceedings of the Annual ACM Symposium on Theory of Computing. p. 409-418 10 p.

Research output: Contribution to journalConference article

12 Scopus citations

Regular resolution lower bounds for the weak Pigeonhole principle

Pitassi, T. & Raz, R., 2001, In : Conference Proceedings of the Annual ACM Symposium on Theory of Computing. p. 347-355 9 p.

Research output: Contribution to journalConference article

15 Scopus citations
1999

Arthur-Merlin games in boolean decision trees

Raz, R., Tardos, G., Verbitsky, O. & Vereshchagin, N., Oct 1999, In : Journal of Computer and System Sciences. 59, 2, p. 346-372 27 p.

Research output: Contribution to journalConference article

4 Scopus citations

Error reduction for extractors

Raz, R., Reingold, O. & Vadhan, S., Dec 1 1999, In : Annual Symposium on Foundations of Computer Science - Proceedings. p. 191-201 11 p.

Research output: Contribution to journalConference article

23 Scopus citations
143 Scopus citations

Extracting all the randomness and reducing the error in Trevisan's extractors

Raz, R., Reingold, O. & Vadhan, S., 1999, In : Conference Proceedings of the Annual ACM Symposium on Theory of Computing. p. 149-158 10 p.

Research output: Contribution to journalConference article

53 Scopus citations

On recycling the randomness of states in space bounded computation

Raz, R. & Reingold, O., 1999, In : Conference Proceedings of the Annual ACM Symposium on Theory of Computing. p. 159-168 10 p.

Research output: Contribution to journalConference article

56 Scopus citations

PCP characterizations of NP: Towards a polynomially-small error-probability

Dinur, I., Fischer, E., Kindler, G., Raz, R. & Safra, S., Jan 1 1999, In : Conference Proceedings of the Annual ACM Symposium on Theory of Computing. p. 29-40 12 p.

Research output: Contribution to journalConference article

36 Scopus citations
1997

Direct product results and the GCD problem, in old and new communication models

Parnafes, I., Raz, R. & Wigderson, A., Jan 1 1997, In : Conference Proceedings of the Annual ACM Symposium on Theory of Computing. p. 363-372 10 p.

Research output: Contribution to journalConference article

32 Scopus citations

No feasible interpolation for TC0-Frege proofs

Bonet, M. L., Pitassi, T. & Raz, R., Dec 1 1997, In : Annual Symposium on Foundations of Computer Science - Proceedings. p. 254-263 10 p.

Research output: Contribution to journalConference article

16 Scopus citations
533 Scopus citations