Calculated based on number of publications stored in Pure and citations from Scopus
1989 …2022

Research activity per year

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

Search results

  • 2007

    A lower bound for the size of syntactically multilinear arithmetic circuits

    Raz, R., Shpilka, A. & Yehudayoff, A., 2007, Proceedings of the 48th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2007. p. 438-448 11 p. 4389514. (Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS).

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    9 Scopus citations
  • Exponential separations for one-way quantum communication complexity, with applications to cryptography

    Gavinsky, D., Kempe, J., Kerenidis, I., Raz, R. & De Wolf, R., 2007, STOC'07: Proceedings of the 39th Annual ACM Symposium on Theory of Computing. p. 516-525 10 p. (Proceedings of the Annual ACM Symposium on Theory of Computing).

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    81 Scopus citations
  • 2006

    Sub-constant error low degree test of almost-linear size

    Moshkovitz, D. & Raz, R., 2006, STOC'06: Proceedings of the 38th Annual ACM Symposium on Theory of Computing. Association for Computing Machinery (ACM), p. 21-30 10 p. (Proceedings of the Annual ACM Symposium on Theory of Computing; vol. 2006).

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    13 Scopus citations
  • Succinct non-interactive zero-knowledge proofs with preprocessing for LOGSNP

    Kalai, Y. T. & Razt, R., Dec 1 2006, 47th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2006. p. 355-366 12 p. 4031371. (Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS).

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    17 Scopus citations
  • 2005

    Deterministic extractors for affine sources over large fields

    Gabizon, A. & Raz, R., 2005, Proceedings - 46th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2005. p. 407-418 12 p. 1530733. (Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS; vol. 2005).

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    33 Scopus citations
  • Quantum information and the PCP theorem

    Raz, R., 2005, Proceedings - 46th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2005. p. 459-468 10 p. 1530738. (Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS; vol. 2005).

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    9 Scopus citations
  • 2001

    Distance labeling in graphs

    Gavoille, C., Peleg, D., Pérennes, S. & Raz, R., 2001, Proceedings of the 12th Annual ACM-SIAM Symposium on Discrete Algorithms. p. 210-219 10 p. (Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms).

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    105 Scopus citations
  • 2000

    Higher lower bounds on monotone size

    Harnik, D. & Raz, R., 2000, Proceedings of the 32nd Annual ACM Symposium on Theory of Computing, STOC 2000. p. 378-387 10 p. (Proceedings of the Annual ACM Symposium on Theory of Computing).

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    Open Access
    25 Scopus citations
  • 1998

    Arthur-Merlin games in Boolean decision trees

    Raz, R., Tardos, G., Verbitsky, O. & Vereshagin, N., 1998, Proceedings - 13th Annual IEEE Conference on Computational Complexity, CCC 1998. IEEE Computer Society, p. 58-67 10 p. 694591. (Proceedings of the Annual IEEE Conference on Computational Complexity).

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    3 Scopus citations
  • 1994

    Direct product theorem

    Impagliazzo, R., Raz, R. & Wigderson, A., Dec 1 1994, Proceedings of the IEEE Annual Structure in Complexity Theory Conference. Anon (ed.). Publ by IEEE, p. 88-96 9 p. (Proceedings of the IEEE Annual Structure in Complexity Theory Conference).

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    12 Scopus citations
  • 1993

    On the `log rank' - conjecture in communication complexity

    Raz, R. & Spieker, B., Dec 1 1993, Annual Symposium on Foundatons of Computer Science (Proceedings). Anon (ed.). Publ by IEEE, p. 168-176 9 p. (Annual Symposium on Foundatons of Computer Science (Proceedings)).

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    15 Scopus citations
  • 1991

    Super-logarithmic depth lower bounds via direct sum in communication complexity

    Karchmer, M., Raz, R. & Wigderson, A., Dec 1 1991, Proc 6 Annu Struct Complexity Theor. Publ by IEEE, p. 299-304 6 p. (Proc 6 Annu Struct Complexity Theor).

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    26 Scopus citations
  • 1990

    Monotone circuits for matching require linear depth

    Raz, R. & Wigderson, A., 1990, Proc 22nd Annu ACM Symp Theory Comput. Publ by ACM, p. 287-292 6 p. (Proc 22nd Annu ACM Symp Theory Comput).

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    30 Scopus citations
  • 1989

    Probabilistic communication complexity of Boolean relations

    Raz, R. & Wigderson, A., 1989, Annual Symposium on Foundations of Computer Science (Proceedings). Publ by IEEE, p. 562-567 6 p. (Annual Symposium on Foundations of Computer Science (Proceedings)).

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    32 Scopus citations