Ran Raz - RankMe

257 papers A* 60A 22Journal 156Unranked 16

Year	Rank	Type	Title / Venue / Authors
2026	J	`jnl`	A Note on Natural-Proofs for Super-Linear Lower Bounds for Linear Functions. Electron. Colloquium Comput. Complex. Ran Raz
2025	J	`jnl`	Information Dissemination via Broadcasts in the Presence of Adversarial Noise. Electron. Colloquium Comput. Complex. Klim Efremenko, Gillat Kol, Dmitry Paramonov, Ran Raz, Raghuvansh Saxena
2024	A	`conf`	Information Dissemination via Broadcasts in the Presence of Adversarial Noise. CCC Klim Efremenko, Gillat Kol, Dmitry Paramonov, Ran Raz, Raghuvansh R. Saxena
2024	—	`conf`	Quantum Logspace Computations are Verifiable. SOSA Uma Girish, Ran Raz, Wei Zhan
2023	A*	`conf`	Certified Hardness vs. Randomness for Log-Space. FOCS Edward Pyne, Ran Raz, Wei Zhan
2023	J	`jnl`	Certified Hardness vs. Randomness for Log-Space. CoRR Edward Pyne, Ran Raz, Wei Zhan
2023	J	`jnl`	Certified Hardness vs. Randomness for Log-Space. Electron. Colloquium Comput. Complex. Edward Pyne, Ran Raz, Wei Zhan
2023	A	`conf`	Is Untrusted Randomness Helpful? ITCS Uma Girish, Ran Raz, Wei Zhan
2023	A*	`conf`	Memory-Sample Lower Bounds for Learning with Classical-Quantum Hybrid Memory. STOC Qipeng Liu, Ran Raz, Wei Zhan
2023	J	`jnl`	Memory-Sample Lower Bounds for Learning with Classical-Quantum Hybrid Memory. CoRR Qipeng Liu, Ran Raz, Wei Zhan
2023	J	`jnl`	Memory-Sample Lower Bounds for Learning with Classical-Quantum Hybrid Memory. Electron. Colloquium Comput. Complex. Qipeng Liu, Ran Raz, Wei Zhan
2023	J	`jnl`	On the works of Avi Wigderson. CoRR Boaz Barak, Yael Kalai, Ran Raz, Salil P. Vadhan, Nisheeth K. Vishnoi
2023	J	`jnl`	Quantum Logspace Computations are Verifiable. CoRR Uma Girish, Ran Raz, Wei Zhan
2023	J	`jnl`	Quantum Logspace Computations are Verifiable. Electron. Colloquium Comput. Complex. Uma Girish, Ran Raz, Wei Zhan
2022	A	`conf`	Eliminating Intermediate Measurements Using Pseudorandom Generators. ITCS Uma Girish, Ran Raz
2022	J	`jnl`	How to Delegate Computations: The Power of No-Signaling Proofs. J. ACM Yael Tauman Kalai, Ran Raz, Ron D. Rothblum
2022	J	`jnl`	Oracle Separation of BQP and PH. J. ACM Ran Raz, Avishay Tal
2022	J	`jnl`	Parallel Repetition For All 3-Player Games Over Binary Alphabet. CoRR Uma Girish, Justin Holmgren, Kunal Mittal, Ran Raz, Wei Zhan
2022	J	`jnl`	Parallel Repetition For All 3-Player Games Over Binary Alphabet. Electron. Colloquium Comput. Complex. Uma Girish, Justin Holmgren, Kunal Mittal, Ran Raz, Wei Zhan
2022	A*	`conf`	Parallel repetition for all 3-player games over binary alphabet. STOC Uma Girish, Justin Holmgren, Kunal Mittal, Ran Raz, Wei Zhan
2022	J	`jnl`	Polynomial Bounds On Parallel Repetition For All 3-Player Games With Binary Inputs. CoRR Uma Girish, Kunal Mittal, Ran Raz, Wei Zhan
2022	J	`jnl`	Polynomial Bounds On Parallel Repetition For All 3-Player Games With Binary Inputs. Electron. Colloquium Comput. Complex. Uma Girish, Kunal Mittal, Ran Raz, Wei Zhan
2022	A	`conf`	Polynomial Bounds on Parallel Repetition for All 3-Player Games with Binary Inputs. APPROX/RANDOM Uma Girish, Kunal Mittal, Ran Raz, Wei Zhan
2022	J	`jnl`	Quantum versus Randomized Communication Complexity, with Efficient Players. Comput. Complex. Uma Girish, Ran Raz, Avishay Tal
2021	J	`jnl`	A Lower Bound for Adaptively-Secure Collective Coin Flipping Protocols. Comb. Yael Tauman Kalai, Ilan Komargodski, Ran Raz
2021	J	`jnl`	A Parallel Repetition Theorem for the GHZ Game: A Simpler Proof. Electron. Colloquium Comput. Complex. Uma Girish, Justin Holmgren, Kunal Mittal, Ran Raz, Wei Zhan
2021	A	`conf`	Block Rigidity: Strong Multiplayer Parallel Repetition Implies Super-Linear Lower Bounds for Turing Machines. ITCS Kunal Mittal, Ran Raz
2021	J	`jnl`	Eliminating Intermediate Measurements using Pseudorandom Generators. CoRR Uma Girish, Ran Raz
2021	J	`jnl`	Eliminating Intermediate Measurements using Pseudorandom Generators. Electron. Colloquium Comput. Complex. Uma Girish, Ran Raz
2021	J	`jnl`	Exponential Separation of Communication and External Information. SIAM J. Comput. Anat Ganor, Gillat Kol, Ran Raz
2021	—	`conf`	Lower Bounds for XOR of Forrelations. APPROX-RANDOM Uma Girish, Ran Raz, Wei Zhan
2021	—	`conf`	Memory-Sample Lower Bounds for Learning Parity with Noise. APPROX-RANDOM Sumegha Garg, Pravesh K. Kothari, Pengda Liu, Ran Raz
2021	J	`jnl`	Memory-Sample Lower Bounds for Learning Parity with Noise. CoRR Sumegha Garg, Pravesh K. Kothari, Pengda Liu, Ran Raz
2021	—	`conf`	Parallel Repetition for the GHZ Game: A Simpler Proof. APPROX-RANDOM Uma Girish, Justin Holmgren, Kunal Mittal, Ran Raz, Wei Zhan
2021	J	`jnl`	Parallel Repetition for the GHZ Game: A Simpler Proof. CoRR Uma Girish, Justin Holmgren, Kunal Mittal, Ran Raz, Wei Zhan
2021	A*	`conf`	Quantum Logspace Algorithm for Powering Matrices with Bounded Norm. ICALP Uma Girish, Ran Raz, Wei Zhan
2021	A	`conf`	Quantum Versus Randomized Communication Complexity, with Efficient Players. ITCS Uma Girish, Ran Raz, Avishay Tal
2020	J	`jnl`	A Parallel Repetition Theorem for the GHZ Game. CoRR Justin Holmgren, Ran Raz
2020	J	`jnl`	A Parallel Repetition Theorem for the GHZ Game. Electron. Colloquium Comput. Complex. Justin Holmgren, Ran Raz
2020	J	`jnl`	Block Rigidity: Strong Multiplayer Parallel Repetition implies Super-Linear Lower Bounds for Turing Machines. CoRR Kunal Mittal, Ran Raz
2020	J	`jnl`	Block Rigidity: Strong Multiplayer Parallel Repetition implies Super-Linear Lower Bounds for Turing Machines. Electron. Colloquium Comput. Complex. Kunal Mittal, Ran Raz
2020	J	`jnl`	Lower Bounds for XOR of Forrelations. CoRR Uma Girish, Ran Raz, Wei Zhan
2020	J	`jnl`	Lower Bounds for XOR of Forrelations. Electron. Colloquium Comput. Complex. Uma Girish, Ran Raz, Wei Zhan
2020	A*	`conf`	Near-Quadratic Lower Bounds for Two-Pass Graph Streaming Algorithms. FOCS Sepehr Assadi, Ran Raz
2020	J	`jnl`	Near-Quadratic Lower Bounds for Two-Pass Graph Streaming Algorithms. CoRR Sepehr Assadi, Ran Raz
2020	J	`jnl`	Quantum Logspace Algorithm for Powering Matrices with Bounded Norm. CoRR Uma Girish, Ran Raz, Wei Zhan
2020	J	`jnl`	Quantum Logspace Algorithm for Powering Matrices with Bounded Norm. Electron. Colloquium Comput. Complex. Uma Girish, Ran Raz, Wei Zhan
2020	A	`conf`	The Random-Query Model and the Memory-Bounded Coupon Collector. ITCS Ran Raz, Wei Zhan
2020	—	`conf`	Time-Space Tradeoffs for Distinguishing Distributions and Applications to Security of Goldreich's PRG. APPROX-RANDOM Sumegha Garg, Pravesh K. Kothari, Ran Raz
2020	J	`jnl`	Time-Space Tradeoffs for Distinguishing Distributions and Applications to Security of Goldreich's PRG. CoRR Sumegha Garg, Pravesh K. Kothari, Ran Raz
2019	J	`jnl`	Fast Learning Requires Good Memory: A Time-Space Lower Bound for Parity Learning. J. ACM Ran Raz
2019	A*	`conf`	Oracle separation of BQP and PH. STOC Ran Raz, Avishay Tal
2019	J	`jnl`	Quantum versus Randomized Communication Complexity, with Efficient Players. CoRR Uma Girish, Ran Raz, Avishay Tal
2019	J	`jnl`	Quantum versus Randomized Communication Complexity, with Efficient Players. Electron. Colloquium Comput. Complex. Uma Girish, Ran Raz, Avishay Tal
2019	J	`jnl`	The Random-Query Model and the Memory-Bounded Coupon Collector. Electron. Colloquium Comput. Complex. Ran Raz, Wei Zhan
2019	A	`conf`	Time-Space Lower Bounds for Two-Pass Learning. CCC Sumegha Garg, Ran Raz, Avishay Tal
2019	J	`jnl`	Time-Space Lower Bounds for Two-Pass Learning. Electron. Colloquium Comput. Complex. Sumegha Garg, Ran Raz, Avishay Tal
2018	A	`conf`	A Candidate for a Strong Separation of Information and Communication. ITCS Mark Braverman, Anat Ganor, Gillat Kol, Ran Raz
2018	A	`conf`	A Lower Bound for Adaptively-Secure Collective Coin-Flipping Protocols. DISC Yael Tauman Kalai, Ilan Komargodski, Ran Raz
2018	J	`jnl`	A Lower Bound for Adaptively-Secure Collective Coin-Flipping Protocols. Electron. Colloquium Comput. Complex. Ilan Komargodski, Ran Raz, Yael Tauman Kalai
2018	A*	`conf`	Extractor-based time-space lower bounds for learning. STOC Sumegha Garg, Ran Raz, Avishay Tal
2018	J	`jnl`	Oracle Separation of BQP and PH. Electron. Colloquium Comput. Complex. Ran Raz, Avishay Tal
2017	A*	`conf`	A Time-Space Lower Bound for a Large Class of Learning Problems. FOCS Ran Raz
2017	J	`jnl`	A Time-Space Lower Bound for a Large Class of Learning Problems. Electron. Colloquium Comput. Complex. Ran Raz
2017	J	`jnl`	Extractor-Based Time-Space Lower Bounds for Learning. CoRR Sumegha Garg, Ran Raz, Avishay Tal
2017	J	`jnl`	Extractor-Based Time-Space Lower Bounds for Learning. Electron. Colloquium Comput. Complex. Sumegha Garg, Ran Raz, Avishay Tal
2017	J	`jnl`	Improved Average-Case Lower Bounds for De Morgan Formula Size: Matching Worst-Case Lower Bound. SIAM J. Comput. Ilan Komargodski, Ran Raz, Avishay Tal
2017	A*	`conf`	Time-space hardness of learning sparse parities. STOC Gillat Kol, Ran Raz, Avishay Tal
2016	A	`ed.`	31st Conference on Computational Complexity, CCC 2016, Tokyo, Japan, May 29 - June 1, 2016 CCC Ran Raz
2016	J	`jnl`	Bounds on 2-query Locally Testable Codes with affine tests. Inf. Process. Lett. Gillat Kol, Ran Raz
2016	J	`jnl`	Exponential Separation of Information and Communication for Boolean Functions. J. ACM Anat Ganor, Gillat Kol, Ran Raz
2016	A*	`conf`	Exponential separation of communication and external information. STOC Anat Ganor, Gillat Kol, Ran Raz
2016	A*	`conf`	Fast Learning Requires Good Memory: A Time-Space Lower Bound for Parity Learning. FOCS Ran Raz
2016	J	`jnl`	Fast Learning Requires Good Memory: A Time-Space Lower Bound for Parity Learning. CoRR Ran Raz
2016	J	`jnl`	Fast Learning Requires Good Memory: A Time-Space Lower Bound for Parity Learning. Electron. Colloquium Comput. Complex. Ran Raz
2016	J	`jnl`	Fast Learning Requires Good Memory: A Time-Space Lower Bound for Parity Learning. IACR Cryptol. ePrint Arch. Ran Raz
2016	J	`jnl`	Label Cover Instances with Large Girth and the Hardness of Approximating Basic ACM Trans. Algorithms Michael Dinitz, Guy Kortsarz, Ran Raz
2016	A	`conf`	On the Space Complexity of Linear Programming with Preprocessing. ITCS Yael Tauman Kalai, Ran Raz, Oded Regev
2016	J	`jnl`	Time-Space Hardness of Learning Sparse Parities. Electron. Colloquium Comput. Complex. Gillat Kol, Ran Raz, Avishay Tal
2015	J	`jnl`	Arthur-Merlin streaming complexity. Inf. Comput. Tom Gur, Ran Raz
2015	J	`jnl`	Exponential Separation of Communication and External Information. Electron. Colloquium Comput. Complex. Anat Ganor, Gillat Kol, Ran Raz
2015	A*	`conf`	Exponential Separation of Information and Communication for Boolean Functions. STOC Anat Ganor, Gillat Kol, Ran Raz
2015	A*	`conf`	Welfare Maximization with Limited Interaction. FOCS Noga Alon, Noam Nisan, Ran Raz, Omri Weinstein
2015	J	`jnl`	Welfare Maximization with Limited Interaction. CoRR Noga Alon, Noam Nisan, Ran Raz, Omri Weinstein
2015	J	`jnl`	Welfare Maximization with Limited Interaction. Electron. Colloquium Comput. Complex. Noga Alon, Noam Nisan, Ran Raz, Omri Weinstein
2014	J	`jnl`	Competing-Provers Protocols for Circuit Evaluation. Theory Comput. Gillat Kol, Ran Raz
2014	J	`jnl`	Exponential Separation of Information and Communication for Boolean Functions. Electron. Colloquium Comput. Complex. Anat Ganor, Gillat Kol, Ran Raz
2014	A*	`conf`	Exponential Separation of Information and Communication. FOCS Anat Ganor, Gillat Kol, Ran Raz
2014	J	`jnl`	Exponential Separation of Information and Communication. Electron. Colloquium Comput. Complex. Anat Ganor, Gillat Kol, Ran Raz
2014	A*	`conf`	How to delegate computations: the power of no-signaling proofs. STOC Yael Tauman Kalai, Ran Raz, Ron D. Rothblum
2014	J	`jnl`	Nonmalleable Extractors with Short Seeds and Applications to Privacy Amplification. SIAM J. Comput. Gil Cohen, Ran Raz, Gil Segev
2014	J	`jnl`	On the Space Complexity of Linear Programming with Preprocessing. Electron. Colloquium Comput. Complex. Yael Tauman Kalai, Ran Raz
2014	J	`jnl`	Pseudorandom Generators for Regular Branching Programs. SIAM J. Comput. Mark Braverman, Anup Rao, Ran Raz, Amir Yehudayoff
2014	—	`conf`	Space Pseudorandom Generators by Communication Complexity Lower Bounds. APPROX-RANDOM Anat Ganor, Ran Raz
2014	—	`conf`	Two Sides of the Coin Problem. APPROX-RANDOM Gil Cohen, Anat Ganor, Ran Raz
2014	J	`jnl`	Two Sides of the Coin Problem. Electron. Colloquium Comput. Complex. Gil Cohen, Anat Ganor, Ran Raz
2013	J	`jnl`	Arthur-Merlin Streaming Complexity CoRR Tom Gur, Ran Raz
2013	—	`conf`	Arthur-Merlin Streaming Complexity. ICALP (1) Tom Gur, Ran Raz
2013	J	`jnl`	Arthur-Merlin Streaming Complexity. Electron. Colloquium Comput. Complex. Tom Gur, Ran Raz
2013	A*	`conf`	Average-case lower bounds for formula size. STOC Ilan Komargodski, Ran Raz
2013	A	`conf`	Competing provers protocols for circuit evaluation. ITCS Gillat Kol, Ran Raz
2013	A*	`conf`	Delegation for bounded space. STOC Yael Tauman Kalai, Ran Raz, Ron D. Rothblum
2013	—	`conf`	Efficient Multiparty Protocols via Log-Depth Threshold Formulae - (Extended Abstract). CRYPTO (2) Gil Cohen, Ivan Bjerre Damgård, Yuval Ishai, Jonas Kölker, Peter Bro Miltersen, Ran Raz, Ron D. Rothblum
2013	J	`jnl`	Efficient Multiparty Protocols via Log-Depth Threshold Formulae. Electron. Colloquium Comput. Complex. Gil Cohen, Ivan Bjerre Damgård, Yuval Ishai, Jonas Kölker, Peter Bro Miltersen, Ran Raz, Ron Rothblum
2013	J	`jnl`	Efficient Multiparty Protocols via Log-Depth Threshold Formulae. IACR Cryptol. ePrint Arch. Gil Cohen, Ivan Bjerre Damgård, Yuval Ishai, Jonas Kölker, Peter Bro Miltersen, Ran Raz, Ron D. Rothblum
2013	J	`jnl`	How to Delegate Computations: The Power of No-Signaling Proofs. Electron. Colloquium Comput. Complex. Yael Tauman Kalai, Ran Raz, Ron Rothblum
2013	J	`jnl`	How to Delegate Computations: The Power of No-Signaling Proofs. IACR Cryptol. ePrint Arch. Yael Tauman Kalai, Ran Raz, Ron Rothblum
2013	A*	`conf`	Improved Average-Case Lower Bounds for DeMorgan Formula Size. FOCS Ilan Komargodski, Ran Raz, Avishay Tal
2013	J	`jnl`	Improved Average-Case Lower Bounds for DeMorgan Formula Size. Electron. Colloquium Comput. Complex. Ilan Komargodski, Ran Raz, Avishay Tal
2013	J	`jnl`	Interactive Channel Capacity. Electron. Colloquium Comput. Complex. Gillat Kol, Ran Raz
2013	A*	`conf`	Interactive channel capacity. STOC Gillat Kol, Ran Raz
2013	J	`jnl`	Space Pseudorandom Generators by Communication Complexity Lower Bounds. Electron. Colloquium Comput. Complex. Anat Ganor, Ran Raz
2013	J	`jnl`	Tensor-Rank and Lower Bounds for Arithmetic Formulas. J. ACM Ran Raz
2012	A	`conf`	A Strong Parallel Repetition Theorem for Projection Games on Expanders. CCC Ran Raz, Ricky Rosen
2012	J	`jnl`	Average-Case Lower Bounds for Formula Size. Electron. Colloquium Comput. Complex. Ilan Komargodski, Ran Raz
2012	A	`conf`	Bounds on locally testable codes with unique tests. ITCS Gillat Kol, Ran Raz
2012	—	`conf`	Label Cover Instances with Large Girth and the Hardness of Approximating Basic k-Spanner. ICALP (1) Michael Dinitz, Guy Kortsarz, Ran Raz
2012	J	`jnl`	Label Cover instances with large girth and the hardness of approximating basic k-spanner CoRR Michael Dinitz, Guy Kortsarz, Ran Raz
2012	A	`conf`	Non-malleable Extractors with Short Seeds and Applications to Privacy Amplification. CCC Gil Cohen, Ran Raz, Gil Segev
2012	J	`jnl`	The Spectrum of Small DeMorgan Formulas. Electron. Colloquium Comput. Complex. Anat Ganor, Ilan Komargodski, Ran Raz
2011	J	`jnl`	A Counterexample to Strong Parallel Repetition. SIAM J. Comput. Ran Raz
2011	J	`jnl`	Competing Provers Protocols for Circuit Evaluation. Electron. Colloquium Comput. Complex. Gillat Kol, Ran Raz
2011	A*	`conf`	Memory Delegation. CRYPTO Kai-Min Chung, Yael Tauman Kalai, Feng-Hao Liu, Ran Raz
2011	J	`jnl`	Memory Delegation. IACR Cryptol. ePrint Arch. Kai-Min Chung, Yael Tauman Kalai, Feng-Hao Liu, Ran Raz
2011	J	`jnl`	Multilinear formulas, maximal-partition discrepancy and mixed-sources extractors. J. Comput. Syst. Sci. Ran Raz, Amir Yehudayoff
2011	J	`jnl`	Non-Malleable Extractors with Short Seeds and Applications to Privacy Amplification. Electron. Colloquium Comput. Complex. Gil Cohen, Ran Raz, Gil Segev
2011	J	`jnl`	PCP Characterizations of NP: Toward a Polynomially-Small Error-Probability. Comput. Complex. Irit Dinur, Eldar Fischer, Guy Kindler, Ran Raz, Shmuel Safra
2010	J	`jnl`	A Strong Parallel Repetition Theorem for Projection Games on Expanders. Electron. Colloquium Comput. Complex. Ran Raz, Ricky Rosen
2010	J	`jnl`	Elusive Functions and Lower Bounds for Arithmetic Circuits. Theory Comput. Ran Raz
2010	A	`conf`	Parallel Repetition of Two Prover Games (Invited Survey). CCC Ran Raz
2010	A*	`conf`	Pseudorandom Generators for Regular Branching Programs. FOCS Mark Braverman, Anup Rao, Ran Raz, Amir Yehudayoff
2010	J	`jnl`	Pseudorandom Generators for Regular Branching Programs. Electron. Colloquium Comput. Complex. Mark Braverman, Anup Rao, Ran Raz, Amir Yehudayoff
2010	J	`jnl`	Sub-Constant Error Probabilistically Checkable Proof of Almost-Linear Size. Comput. Complex. Dana Moshkovitz, Ran Raz
2010	J	`jnl`	Tensor-Rank and Lower Bounds for Arithmetic Formulas. Electron. Colloquium Comput. Complex. Ran Raz
2010	A*	`conf`	Tensor-rank and lower bounds for arithmetic formulas. STOC Ran Raz
2010	J	`jnl`	The Surprise Examination Paradox and the Second Incompleteness Theorem CoRR Shira Kritchman, Ran Raz
2010	J	`jnl`	Two-query PCP with subconstant error. J. ACM Dana Moshkovitz, Ran Raz
2009	J	`jnl`	Bounds on 2-Query Locally Testable Codes with Affine Tests. Electron. Colloquium Comput. Complex. Gillat Kol, Ran Raz
2009	J	`jnl`	Locally Testable Codes Analogues to the Unique Games Conjecture Do Not Exist. Electron. Colloquium Comput. Complex. Gillat Kol, Ran Raz
2009	J	`jnl`	Lower Bounds and Separations for Constant Depth Multilinear Circuits. Comput. Complex. Ran Raz, Amir Yehudayoff
2009	J	`jnl`	Multi-linear formulas for permanent and determinant are of super-polynomial size. J. ACM Ran Raz
2009	A*	`conf`	Probabilistically Checkable Arguments. CRYPTO Yael Tauman Kalai, Ran Raz
2009	J	`jnl`	Quantum Information and the PCP Theorem. Algorithmica Ran Raz
2009	—	`conf`	Strong Parallel Repetition Theorem for Free Projection Games. APPROX-RANDOM Boaz Barak, Anup Rao, Ran Raz, Ricky Rosen, Ronen Shaltiel
2008	A*	`conf`	A Counterexample to Strong Parallel Repetition. FOCS Ran Raz
2008	J	`jnl`	A Counterexample to Strong Parallel Repetition. Electron. Colloquium Comput. Complex. Ran Raz
2008	J	`jnl`	A Lower Bound for the Size of Syntactically Multilinear Arithmetic Circuits. SIAM J. Comput. Ran Raz, Amir Shpilka, Amir Yehudayoff
2008	J	`jnl`	Analyzing linear mergers. Random Struct. Algorithms Zeev Dvir, Ran Raz
2008	J	`jnl`	Balancing Syntactically Multilinear Arithmetic Circuits. Comput. Complex. Ran Raz, Amir Yehudayoff
2008	J	`jnl`	Deterministic extractors for affine sources over large fields. Comb. Ariel Gabizon, Ran Raz
2008	J	`jnl`	Elusive Functions and Lower Bounds for Arithmetic Circuits. Electron. Colloquium Comput. Complex. Ran Raz
2008	A*	`conf`	Elusive functions and lower bounds for arithmetic circuits. STOC Ran Raz
2008	J	`jnl`	Exponential Separation for One-Way Quantum Communication Complexity, with Applications to Cryptography. SIAM J. Comput. Dmitry Gavinsky, Julia Kempe, Iordanis Kerenidis, Ran Raz, Ronald de Wolf
2008	—	`conf`	Interactive PCP. ICALP (2) Yael Tauman Kalai, Ran Raz
2008	A	`conf`	Lower Bounds and Separations for Constant Depth Multilinear Circuits. CCC Ran Raz, Amir Yehudayoff
2008	J	`jnl`	Lower Bounds and Separations for Constant Depth Multilinear Circuits. Electron. Colloquium Comput. Complex. Ran Raz, Amir Yehudayoff
2008	A*	`conf`	Multilinear Formulas, Maximal-Partition Discrepancy and Mixed-Sources Extractors. FOCS Ran Raz, Amir Yehudayoff
2008	J	`jnl`	Resolution over linear equations and multilinear proofs. Ann. Pure Appl. Log. Ran Raz, Iddo Tzameret
2008	J	`jnl`	Sub-Constant Error Low Degree Test of Almost-Linear Size. SIAM J. Comput. Dana Moshkovitz, Ran Raz
2008	J	`jnl`	The Strength of Multilinear Proofs. Comput. Complex. Ran Raz, Iddo Tzameret
2008	A*	`conf`	Two Query PCP with Sub-Constant Error. FOCS Dana Moshkovitz, Ran Raz
2008	J	`jnl`	Two Query PCP with Sub-Constant Error. Electron. Colloquium Comput. Complex. Dana Moshkovitz, Ran Raz
2007	A*	`conf`	A Lower Bound for the Size of Syntactically Multilinear Arithmetic Circuits. FOCS Ran Raz, Amir Shpilka, Amir Yehudayoff
2007	A*	`conf`	Exponential separations for one-way quantum communication complexity, with applications to cryptography. STOC Dmitry Gavinsky, Julia Kempe, Iordanis Kerenidis, Ran Raz, Ronald de Wolf
2007	J	`jnl`	Interactive PCP. Electron. Colloquium Comput. Complex. Yael Tauman Kalai, Ran Raz
2007	J	`jnl`	Multilinear Formulas, Maximal-Partition Discrepancy and Mixed-Sources Extractors. Electron. Colloquium Comput. Complex. Ran Raz, Amir Yehudayoff
2007	J	`jnl`	Resolution over Linear Equations and Multilinear Proofs CoRR Ran Raz, Iddo Tzameret
2007	J	`jnl`	Resolution over Linear Equations and Multilinear Proofs. Electron. Colloquium Comput. Complex. Ran Raz, Iddo Tzameret
2007	J	`jnl`	Sub-Constant Error Probabilistically Checkable Proof of Almost Linear Size. Electron. Colloquium Comput. Complex. Dana Moshkovitz, Ran Raz
2006	J	`jnl`	A Lower Bound for the Size of Syntactically Multilinear Arithmetic Circuits. Electron. Colloquium Comput. Complex. Ran Raz, Amir Shpilka, Amir Yehudayoff
2006	J	`jnl`	Deterministic Extractors for Bit-Fixing Sources by Obtaining an Independent Seed. SIAM J. Comput. Ariel Gabizon, Ran Raz, Ronen Shaltiel
2006	J	`jnl`	Separation of Multilinear Circuit and Formula Size. Theory Comput. Ran Raz
2006	A*	`conf`	Sub-constant error low degree test of almost-linear size. STOC Dana Moshkovitz, Ran Raz
2006	A*	`conf`	Succinct Non-Interactive Zero-Knowledge Proofs with Preprocessing for LOGSNP. FOCS Yael Tauman Kalai, Ran Raz
2006	J	`jnl`	The Strength of Multilinear Proofs Electron. Colloquium Comput. Complex. Ran Raz, Iddo Tzameret
2006	J	`jnl`	The one-way communication complexity of the Boolean Hidden Matching Problem CoRR Iordanis Kerenidis, Ran Raz
2006	J	`jnl`	The one-way communication complexity of the Boolean Hidden Matching Problem. Electron. Colloquium Comput. Complex. Iordanis Kerenidis, Ran Raz
2005	J	`jnl`	A time lower bound for satisfiability. Theor. Comput. Sci. Dieter van Melkebeek, Ran Raz
2005	J	`jnl`	Analyzing Linear Mergers Electron. Colloquium Comput. Complex. Zeev Dvir, Ran Raz
2005	J	`jnl`	Deterministic Extractors for Affine Sources over Large Fields Electron. Colloquium Comput. Complex. Ariel Gabizon, Ran Raz
2005	A*	`conf`	Deterministic Extractors for Affine Sources over Large Fields. FOCS Ariel Gabizon, Ran Raz
2005	J	`jnl`	Deterministic Extractors for Bit-fixing Sources by Obtaining an Independent Seed Electron. Colloquium Comput. Complex. Ariel Gabizon, Ran Raz, Ronen Shaltiel
2005	J	`jnl`	Deterministic polynomial identity testing in non-commutative models. Comput. Complex. Ran Raz, Amir Shpilka
2005	A*	`conf`	Extractors with weak random seeds. STOC Ran Raz
2005	J	`jnl`	Quantum Information and the PCP Theorem Electron. Colloquium Comput. Complex. Ran Raz
2005	A*	`conf`	Quantum Information and the PCP Theorem. FOCS Ran Raz
2005	J	`jnl`	Sub-Constant Error Low Degree Test of Almost Linear Size Electron. Colloquium Comput. Complex. Dana Moshkovitz, Ran Raz
2004	A*	`conf`	A Time Lower Bound for Satisfiability. ICALP Dieter van Melkebeek, Ran Raz
2004	J	`jnl`	Bounded-Depth Frege Lower Bounds for Weaker Pigeonhole Principles. SIAM J. Comput. Joshua Buresh-Oppenheim, Paul Beame, Toniann Pitassi, Ran Raz, Ashish Sabharwal
2004	—	`ch.`	Circuit and Communication Complexity. Computational Complexity Theory Ran Raz
2004	A*	`conf`	Deterministic Extractors for Bit-Fixing Sources by Obtaining an Independent Seed. FOCS Ariel Gabizon, Ran Raz, Ronen Shaltiel
2004	A	`conf`	Deterministic Polynomial Identity Testing in Non-Commutative Models. CCC Ran Raz, Amir Shpilka
2004	J	`jnl`	Distance labeling in graphs. J. Algorithms Cyril Gavoille, David Peleg, Stéphane Pérennes, Ran Raz
2004	J	`jnl`	Extractors with Weak Random Seeds Electron. Colloquium Comput. Complex. Ran Raz
2004	—	`conf`	Improved Randomness Extraction from Two Independent Sources. APPROX-RANDOM Yevgeniy Dodis, Ariel Elbaz, Roberto Oliveira, Ran Raz
2004	A*	`conf`	Multi-linear formulas for permanent and determinant are of super-polynomial size. STOC Ran Raz
2004	J	`jnl`	Multilinear-NC Electron. Colloquium Comput. Complex. Ran Raz
2004	A*	`conf`	Multilinear-NC neq Multilinear-NC. FOCS Ran Raz
2004	A	`conf`	On the Power of Quantum Proofs. CCC Ran Raz, Amir Shpilka
2004	—	`ch.`	Quantum computation. Computational Complexity Theory Ran Raz
2004	J	`jnl`	Regular Resolution Lower Bounds For The Weak Pigeonhole Principle. Comb. Toniann Pitassi, Ran Raz
2004	J	`jnl`	Resolution lower bounds for the weak pigeonhole principle. J. ACM Ran Raz
2003	J	`jnl`	Approximating CVP to Within Almost-Polynomial Factors is NP-Hard. Comb. Irit Dinur, Guy Kindler, Ran Raz, Shmuel Safra
2003	J	`jnl`	Lower Bounds for Matrix Product in Bounded Depth Circuits with Arbitrary Gates. SIAM J. Comput. Ran Raz, Amir Shpilka
2003	J	`jnl`	Multi-Linear Formulas for Permanent and Determinant are of Super-Polynomial Size Electron. Colloquium Comput. Complex. Ran Raz
2003	J	`jnl`	On the Complexity of Matrix Product. SIAM J. Comput. Ran Raz
2003	J	`jnl`	On the distribution of the number of roots of polynomials and explicit weak designs. Random Struct. Algorithms Tzvika Hartman, Ran Raz
2003	J	`jnl`	P != NP, propositional proof complexity, and resolution lower bounds for the weak pigeonhole principle CoRR Ran Raz
2002	A*	`conf`	Bounded-Depth Frege Lower Bounds for Weaker Pigeonhole Principles. FOCS Josh Buresh-Oppenheim, Paul Beame, Toniann Pitassi, Ran Raz, Ashish Sabharwal
2002	J	`jnl`	Bounded-depth Frege lower bounds for weaker pigeonhole principles Electron. Colloquium Comput. Complex. Josh Buresh-Oppenheim, Paul Beame, Toniann Pitassi, Ran Raz, Ashish Sabharwal
2002	J	`jnl`	Extracting all the Randomness and Reducing the Error in Trevisan's Extractors. J. Comput. Syst. Sci. Ran Raz, Omer Reingold, Salil P. Vadhan
2002	J	`jnl`	On the Complexity of Matrix Product Electron. Colloquium Comput. Complex. Ran Raz
2002	A*	`conf`	On the complexity of matrix product. STOC Ran Raz
2002	A	`conf`	Resolution Lower Bounds for the Weak Pigeonhole Principle. CCC Ran Raz
2002	A*	`conf`	Resolution lower bounds for the weak pigeonhole principle. STOC Ran Raz
2001	A*	`conf`	Distance labeling in graphs. SODA Cyril Gavoille, David Peleg, Stephane Perennes, Ran Raz
2001	A*	`conf`	Explicit lower bound of STOC Oded Lachish, Ran Raz
2001	A*	`conf`	Lower bounds for matrix product, in bounded depth circuits with arbitrary gates. STOC Ran Raz, Amir Shpilka
2001	A*	`conf`	Regular resolution lower bounds for the weak pigeonhole principle. STOC Toniann Pitassi, Ran Raz
2001	J	`jnl`	Resolution Lower Bounds for the Weak Pigeonhole Principle Electron. Colloquium Comput. Complex. Ran Raz
2000	A*	`conf`	Higher lower bounds on monotone size. STOC Danny Harnik, Ran Raz
2000	J	`jnl`	Lower Bounds for Matrix Product, in Bounded Depth Circuits with Arbitrary Gates Electron. Colloquium Comput. Complex. Ran Raz, Amir Shpilka
2000	J	`jnl`	On Interpolation and Automatization for Frege Systems. SIAM J. Comput. Maria Luisa Bonet, Toniann Pitassi, Ran Raz
2000	J	`jnl`	On the Distribution of the Number of Roots of Polynomials and Explicit Logspace Extractors Electron. Colloquium Comput. Complex. Tzvika Hartman, Ran Raz
2000	—	`conf`	On the Distribution of the Number of Roots of Polynomials and Explicit Logspace Extractors. ICALP Satellite Workshops Tzvika Hartman, Ran Raz
2000	J	`jnl`	The BNS-Chung criterion for multi-party communication complexity. Comput. Complex. Ran Raz
2000	J	`jnl`	VC-Dimension of Sets of Permutations. Comb. Ran Raz
1999	J	`jnl`	Arthur-Merlin Games in Boolean Decision Trees. J. Comput. Syst. Sci. Ran Raz, Gábor Tardos, Oleg Verbitsky, Nikolai K. Vereshchagin
1999	A*	`conf`	Error Reduction for Extractors. FOCS Ran Raz, Omer Reingold, Salil P. Vadhan
1999	A*	`conf`	Exponential Separation of Quantum and Classical Communication Complexity. STOC Ran Raz
1999	J	`jnl`	Extracting All the Randomness and Reducing the Error in Trevisan's Extractors Electron. Colloquium Comput. Complex. Ran Raz, Omer Reingold, Salil P. Vadhan
1999	A*	`conf`	Extracting all the Randomness and Reducing the Error in Trevisan's Extractors. STOC Ran Raz, Omer Reingold, Salil P. Vadhan
1999	A*	`conf`	On Recycling the Randomness of States in Space Bounded Computation. STOC Ran Raz, Omer Reingold
1999	A*	`conf`	PCP Characterizations of NP: Towards a Polynomially-Small Error-Probability. STOC Irit Dinur, Eldar Fischer, Guy Kindler, Ran Raz, Shmuel Safra
1999	J	`jnl`	Separation of the Monotone NC Hierarchy. Comb. Ran Raz, Pierre McKenzie
1998	J	`jnl`	A Parallel Repetition Theorem. SIAM J. Comput. Ran Raz
1998	A	`conf`	Arthur-Merlin Games in Boolean Decision Trees. CCC Ran Raz, Gábor Tardos, Oleg Verbitsky, Nikolai K. Vereshchagin
1998	J	`jnl`	Lower Bounds on the Distortion of Embedding Finite Metric Spaces in Graphs. Discret. Comput. Geom. Yuri Rabinovich, Ran Raz
1998	J	`jnl`	PCP Characterizations of NP: Towards a Polynomially-Small Error-Probability Electron. Colloquium Comput. Complex. Irit Dinur, Eldar Fischer, Guy Kindler, Ran Raz, Shmuel Safra
1997	A*	`conf`	A Sub-Constant Error-Probability Low-Degree Test, and a Sub-Constant Error-Probability PCP Characterization of NP. STOC Ran Raz, Shmuel Safra
1997	J	`jnl`	Arthur-Merlin Games in Boolean Decision Trees Electron. Colloquium Comput. Complex. Ran Raz, Gábor Tardos, Oleg Verbitsky, Nikolai K. Vereshchagin
1997	A*	`conf`	Direct Product Results and the GCD Problem, in Old and New Communication Models. STOC Itzhak Parnafes, Ran Raz, Avi Wigderson
1997	J	`jnl`	Lower Bounds for Cutting Planes Proofs with Small Coefficients. J. Symb. Log. Maria Luisa Bonet, Toniann Pitassi, Ran Raz
1997	A*	`conf`	No Feasible Interpolation for TC0-Frege Proofs. FOCS Maria Luisa Bonet, Toniann Pitassi, Ran Raz
1997	A*	`conf`	Separation of the Monotone NC Hierarchy. FOCS Ran Raz, Pierre McKenzie
1995	A*	`conf`	A parallel repetition theorem. STOC Ran Raz
1995	J	`jnl`	Fourier Analysis for Probabilistic Communication Complexity. Comput. Complex. Ran Raz
1995	A*	`conf`	Lower bounds for cutting planes proofs with small coefficients. STOC Maria Luisa Bonet, Toniann Pitassi, Ran Raz
1995	J	`jnl`	On the "Log Rank"-Conjecture in Communication Complexity. Comb. Ran Raz, Boris Spieker
1995	J	`jnl`	Super-Logarithmic Depth Lower Bounds Via the Direct Sum in Communication Complexity. Comput. Complex. Mauricio Karchmer, Ran Raz, Avi Wigderson
1994	—	`conf`	A Direct Product Theorem. SCT Russell Impagliazzo, Ran Raz, Avi Wigderson
1993	A*	`conf`	On the "log rank"-Conjecture in Communication Complexity FOCS Ran Raz, Boris Spieker
1992	J	`jnl`	Monotone Circuits for Matching Require Linear Depth. J. ACM Ran Raz, Avi Wigderson
1992	—	`—`	חסמים תחתונים לסיבוכיות תקשורת הסתברותית ולעומק מעגלים בוליאנים מונוטונים (Lower bounds for probabilistic communication complexity and for the depth of monotone boolean circuits.). Ran Raz
1991	—	`conf`	Super-logarithmic Depth Lower Bounds via Direct Sum in Communication Coplexity. SCT Mauricio Karchmer, Ran Raz, Avi Wigderson
1990	A*	`conf`	Monotone Circuits for Matching Require Linear Depth STOC Ran Raz, Avi Wigderson
1989	A*	`conf`	Probabilistic Communication Complexity of Boolean Relations (Extended Abstract) FOCS Ran Raz, Avi Wigderson