| 2023 | FOCS | Certified Hardness vs. Randomness for Log-Space. | Edward Pyne, Ran Raz, Wei Zhan |
| 2023 | STOC | Memory-Sample Lower Bounds for Learning with Classical-Quantum Hybrid Memory. | Qipeng Liu, Ran Raz, Wei Zhan |
| 2022 | STOC | Parallel repetition for all 3-player games over binary alphabet. | Uma Girish, Justin Holmgren, Kunal Mittal, Ran Raz, Wei Zhan |
| 2021 | ICALP | Quantum Logspace Algorithm for Powering Matrices with Bounded Norm. | Uma Girish, Ran Raz, Wei Zhan |
| 2020 | FOCS | Near-Quadratic Lower Bounds for Two-Pass Graph Streaming Algorithms. | Sepehr Assadi, Ran Raz |
| 2019 | STOC | Oracle separation of BQP and PH. | Ran Raz, Avishay Tal |
| 2018 | STOC | Extractor-based time-space lower bounds for learning. | Sumegha Garg, Ran Raz, Avishay Tal |
| 2017 | FOCS | A Time-Space Lower Bound for a Large Class of Learning Problems. | Ran Raz |
| 2017 | STOC | Time-space hardness of learning sparse parities. | Gillat Kol, Ran Raz, Avishay Tal |
| 2016 | FOCS | Fast Learning Requires Good Memory: A Time-Space Lower Bound for Parity Learning. | Ran Raz |
| 2016 | STOC | Exponential separation of communication and external information. | Anat Ganor, Gillat Kol, Ran Raz |
| 2015 | FOCS | Welfare Maximization with Limited Interaction. | Noga Alon, Noam Nisan, Ran Raz, Omri Weinstein |
| 2015 | STOC | Exponential Separation of Information and Communication for Boolean Functions. | Anat Ganor, Gillat Kol, Ran Raz |
| 2014 | FOCS | Exponential Separation of Information and Communication. | Anat Ganor, Gillat Kol, Ran Raz |
| 2014 | STOC | How to delegate computations: the power of no-signaling proofs. | Yael Tauman Kalai, Ran Raz, Ron D. Rothblum |
| 2013 | CRYPTO | Efficient Multiparty Protocols via Log-Depth Threshold Formulae - (Extended Abstract). | Gil Cohen, Ivan Bjerre Damgrd, Yuval Ishai, Jonas Klker, Peter Bro Miltersen, Ran Raz, Ron D. Rothblum |
| 2013 | FOCS | Improved Average-Case Lower Bounds for DeMorgan Formula Size. | Ilan Komargodski, Ran Raz, Avishay Tal |
| 2013 | ICALP | Arthur-Merlin Streaming Complexity. | Tom Gur, Ran Raz |
| 2013 | STOC | Delegation for bounded space. | Yael Tauman Kalai, Ran Raz, Ron D. Rothblum |
| 2013 | STOC | Interactive channel capacity. | Gillat Kol, Ran Raz |
| 2013 | STOC | Average-case lower bounds for formula size. | Ilan Komargodski, Ran Raz |
| 2012 | ICALP | Label Cover Instances with Large Girth and the Hardness of Approximating Basic k-Spanner. | Michael Dinitz, Guy Kortsarz, Ran Raz |
| 2011 | CRYPTO | Memory Delegation. | Kai-Min Chung, Yael Tauman Kalai, Feng-Hao Liu, Ran Raz |
| 2010 | FOCS | Pseudorandom Generators for Regular Branching Programs. | Mark Braverman, Anup Rao, Ran Raz, Amir Yehudayoff |
| 2010 | STOC | Tensor-rank and lower bounds for arithmetic formulas. | Ran Raz |
| 2009 | CRYPTO | Probabilistically Checkable Arguments. | Yael Tauman Kalai, Ran Raz |
| 2008 | FOCS | Two Query PCP with Sub-Constant Error. | Dana Moshkovitz, Ran Raz |
| 2008 | FOCS | A Counterexample to Strong Parallel Repetition. | Ran Raz |
| 2008 | FOCS | Multilinear Formulas, Maximal-Partition Discrepancy and Mixed-Sources Extractors. | Ran Raz, Amir Yehudayoff |
| 2008 | ICALP | Interactive PCP. | Yael Tauman Kalai, Ran Raz |
| 2008 | STOC | Elusive functions and lower bounds for arithmetic circuits. | Ran Raz |
| 2007 | FOCS | A Lower Bound for the Size of Syntactically Multilinear Arithmetic Circuits. | Ran Raz, Amir Shpilka, Amir Yehudayoff |
| 2007 | STOC | Exponential separations for one-way quantum communication complexity, with applications to cryptography. | Dmitry Gavinsky, Julia Kempe, Iordanis Kerenidis, Ran Raz, Ronald de Wolf |
| 2006 | FOCS | Succinct Non-Interactive Zero-Knowledge Proofs with Preprocessing for LOGSNP. | Yael Tauman Kalai, Ran Raz |
| 2006 | STOC | Sub-constant error low degree test of almost-linear size. | Dana Moshkovitz, Ran Raz |
| 2005 | FOCS | Deterministic Extractors for Affine Sources over Large Fields. | Ariel Gabizon, Ran Raz |
| 2005 | FOCS | Quantum Information and the PCP Theorem. | Ran Raz |
| 2005 | STOC | Extractors with weak random seeds. | Ran Raz |
| 2004 | FOCS | Deterministic Extractors for Bit-Fixing Sources by Obtaining an Independent Seed. | Ariel Gabizon, Ran Raz, Ronen Shaltiel |
| 2004 | FOCS | Multilinear-NC neq Multilinear-NC. | Ran Raz |
| 2004 | ICALP | A Time Lower Bound for Satisfiability. | Dieter van Melkebeek, Ran Raz |
| 2004 | STOC | Multi-linear formulas for permanent and determinant are of super-polynomial size. | Ran Raz |
| 2002 | FOCS | Bounded-Depth Frege Lower Bounds for Weaker Pigeonhole Principles. | Josh Buresh-Oppenheim, Paul Beame, Toniann Pitassi, Ran Raz, Ashish Sabharwal |
| 2002 | STOC | On the complexity of matrix product. | Ran Raz |
| 2002 | STOC | Resolution lower bounds for the weak pigeonhole principle. | Ran Raz |
| 2001 | SODA | Distance labeling in graphs. | Cyril Gavoille, David Peleg, Stephane Perennes, Ran Raz |
| 2001 | STOC | Explicit lower bound of | Oded Lachish, Ran Raz |
| 2001 | STOC | Regular resolution lower bounds for the weak pigeonhole principle. | Toniann Pitassi, Ran Raz |
| 2001 | STOC | Lower bounds for matrix product, in bounded depth circuits with arbitrary gates. | Ran Raz, Amir Shpilka |
| 2000 | ICALP | On the Distribution of the Number of Roots of Polynomials and Explicit Logspace Extractors. | Tzvika Hartman, Ran Raz |
| 2000 | STOC | Higher lower bounds on monotone size. | Danny Harnik, Ran Raz |
| 1999 | FOCS | Error Reduction for Extractors. | Ran Raz, Omer Reingold, Salil P. Vadhan |
| 1999 | STOC | PCP Characterizations of NP: Towards a Polynomially-Small Error-Probability. | Irit Dinur, Eldar Fischer, Guy Kindler, Ran Raz, Shmuel Safra |
| 1999 | STOC | Exponential Separation of Quantum and Classical Communication Complexity. | Ran Raz |
| 1999 | STOC | On Recycling the Randomness of States in Space Bounded Computation. | Ran Raz, Omer Reingold |
| 1999 | STOC | Extracting all the Randomness and Reducing the Error in Trevisan's Extractors. | Ran Raz, Omer Reingold, Salil P. Vadhan |
| 1997 | FOCS | No Feasible Interpolation for TC0-Frege Proofs. | Maria Luisa Bonet, Toniann Pitassi, Ran Raz |
| 1997 | FOCS | Separation of the Monotone NC Hierarchy. | Ran Raz, Pierre McKenzie |
| 1997 | STOC | Direct Product Results and the GCD Problem, in Old and New Communication Models. | Itzhak Parnafes, Ran Raz, Avi Wigderson |
| 1997 | STOC | A Sub-Constant Error-Probability Low-Degree Test, and a Sub-Constant Error-Probability PCP Characterization of NP. | Ran Raz, Shmuel Safra |
| 1995 | STOC | Lower bounds for cutting planes proofs with small coefficients. | Maria Luisa Bonet, Toniann Pitassi, Ran Raz |
| 1995 | STOC | A parallel repetition theorem. | Ran Raz |
| 1993 | FOCS | On the "log rank"-Conjecture in Communication Complexity | Ran Raz, Boris Spieker |
| 1990 | STOC | Monotone Circuits for Matching Require Linear Depth | Ran Raz, Avi Wigderson |
| 1989 | FOCS | Probabilistic Communication Complexity of Boolean Relations (Extended Abstract) | Ran Raz, Avi Wigderson |