| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | Michael Dinitz, Guy Kortsarz, Ran Raz |
Label Cover instances with large girth and the hardness of approximating basic k-spanner  |
CoRR  |
2012 |
DBLP BibTeX RDF |
|
| 1 | Gillat Kol, Ran Raz |
Bounds on locally testable codes with unique tests. |
ITCS |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Gil Cohen, Ran Raz, Gil Segev |
Non-Malleable Extractors with Short Seeds and Applications to Privacy Amplification. |
Electronic Colloquium on Computational Complexity (ECCC) |
2011 |
DBLP BibTeX RDF |
|
| 1 | Gillat Kol, Ran Raz |
Competing Provers Protocols for Circuit Evaluation. |
Electronic Colloquium on Computational Complexity (ECCC) |
2011 |
DBLP BibTeX RDF |
|
| 1 | Kai-Min Chung, Yael Tauman Kalai, Feng-Hao Liu, Ran Raz |
Memory Delegation. |
IACR Cryptology ePrint Archive |
2011 |
DBLP BibTeX RDF |
|
| 1 | Irit Dinur, Eldar Fischer, Guy Kindler, Ran Raz, Shmuel Safra |
PCP Characterizations of NP: Toward a Polynomially-Small Error-Probability. |
Computational Complexity |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Ran Raz, Amir Yehudayoff |
Multilinear formulas, maximal-partition discrepancy and mixed-sources extractors. |
J. Comput. Syst. Sci. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Ran Raz |
A Counterexample to Strong Parallel Repetition. |
SIAM J. Comput. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Kai-Min Chung, Yael Tauman Kalai, Feng-Hao Liu, Ran Raz |
Memory Delegation. |
CRYPTO |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Mark Braverman, Anup Rao, Ran Raz, Amir Yehudayoff |
Pseudorandom Generators for Regular Branching Programs. |
Electronic Colloquium on Computational Complexity (ECCC) |
2010 |
DBLP BibTeX RDF |
|
| 1 | Ran Raz |
A Strong Parallel Repetition Theorem for Projection Games on Expanders. |
Electronic Colloquium on Computational Complexity (ECCC) |
2010 |
DBLP BibTeX RDF |
|
| 1 | Ran Raz, Ricky Rosen |
A Strong Parallel Repetition Theorem for Projection Games on Expanders. |
Electronic Colloquium on Computational Complexity (ECCC) |
2010 |
DBLP BibTeX RDF |
|
| 1 | Ran Raz |
Tensor-Rank and Lower Bounds for Arithmetic Formulas. |
Electronic Colloquium on Computational Complexity (ECCC) |
2010 |
DBLP BibTeX RDF |
|
| 1 | Ran Raz |
Elusive Functions and Lower Bounds for Arithmetic Circuits. |
Theory of Computing |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Dana Moshkovitz, Ran Raz |
Two-query PCP with subconstant error. |
J. ACM |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Dana Moshkovitz, Ran Raz |
Sub-Constant Error Probabilistically Checkable Proof of Almost-Linear Size. |
Computational Complexity |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Shira Kritchman, Ran Raz |
The Surprise Examination Paradox and the Second Incompleteness Theorem |
CoRR |
2010 |
DBLP BibTeX RDF |
|
| 1 | Mark Braverman, Anup Rao, Ran Raz, Amir Yehudayoff |
Pseudorandom Generators for Regular Branching Programs. |
FOCS |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Ran Raz |
Parallel Repetition of Two Prover Games (Invited Survey). |
IEEE Conference on Computational Complexity |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Ran Raz |
Tensor-rank and lower bounds for arithmetic formulas. |
STOC |
2010 |
DBLP DOI BibTeX RDF |
homogenous circuits, multilinear circuits, tensor rank, lower bounds, arithmetic circuits |
| 1 | Gillat Kol, Ran Raz |
Bounds on 2-Query Locally Testable Codes with Affine Tests. |
Electronic Colloquium on Computational Complexity (ECCC) |
2009 |
DBLP BibTeX RDF |
|
| 1 | Gillat Kol, Ran Raz |
Locally Testable Codes Analogues to the Unique Games Conjecture Do Not Exist. |
Electronic Colloquium on Computational Complexity (ECCC) |
2009 |
DBLP BibTeX RDF |
|
| 1 | Ran Raz |
Quantum Information and the PCP Theorem. |
Algorithmica |
2009 |
DBLP DOI BibTeX RDF |
Quantum interactive proofs, Quantum advice, Quantum computation, Probabilistically checkable proofs, Quantum information, Low degree test |
| 1 | Ran Raz |
Multi-linear formulas for permanent and determinant are of super-polynomial size. |
J. ACM |
2009 |
DBLP DOI BibTeX RDF |
arithmetic formulas, lower bounds, circuit complexity, algebraic complexity |
| 1 | Ran Raz, Amir Yehudayoff |
Lower Bounds and Separations for Constant Depth Multilinear Circuits. |
Computational Complexity |
2009 |
DBLP DOI BibTeX RDF |
68Q17, Subject classification |
| 1 | Yael Tauman Kalai, Ran Raz |
Probabilistically Checkable Arguments. |
CRYPTO |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Boaz Barak, Anup Rao, Ran Raz, Ricky Rosen, Ronen Shaltiel |
Strong Parallel Repetition Theorem for Free Projection Games. |
APPROX-RANDOM |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Ran Raz |
Elusive Functions and Lower Bounds for Arithmetic Circuits. |
Electronic Colloquium on Computational Complexity (ECCC) |
2008 |
DBLP BibTeX RDF |
|
| 1 | Ran Raz |
A Counterexample to Strong Parallel Repetition. |
Electronic Colloquium on Computational Complexity (ECCC) |
2008 |
DBLP BibTeX RDF |
|
| 1 | Dana Moshkovitz, Ran Raz |
Two Query PCP with Sub-Constant Error. |
Electronic Colloquium on Computational Complexity (ECCC) |
2008 |
DBLP BibTeX RDF |
|
| 1 | Ran Raz, Amir Yehudayoff |
Lower Bounds and Separations for Constant Depth Multilinear Circuits. |
Electronic Colloquium on Computational Complexity (ECCC) |
2008 |
DBLP BibTeX RDF |
|
| 1 | Zeev Dvir, Ran Raz |
Analyzing linear mergers. |
Random Struct. Algorithms |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Ran Raz, Iddo Tzameret |
Resolution over linear equations and multilinear proofs. |
Ann. Pure Appl. Logic |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Ariel Gabizon, Ran Raz |
Deterministic extractors for affine sources over large fields. |
Combinatorica |
2008 |
DBLP DOI BibTeX RDF |
Mathematics Subject Classification (2000) 11T24, 68Q99, 68R05, 05D10 |
| 1 | Ran Raz, Iddo Tzameret |
The Strength of Multilinear Proofs. |
Computational Complexity |
2008 |
DBLP DOI BibTeX RDF |
Subject classification. 03F20, 68Q17, 13P10 |
| 1 | Ran Raz, Amir Yehudayoff |
Balancing Syntactically Multilinear Arithmetic Circuits. |
Computational Complexity |
2008 |
DBLP DOI BibTeX RDF |
Subject classification, 68W30 |
| 1 | Dmitry Gavinsky, Julia Kempe, Iordanis Kerenidis, Ran Raz, Ronald de Wolf |
Exponential Separation for One-Way Quantum Communication Complexity, with Applications to Cryptography. |
SIAM J. Comput. |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Ran Raz, Amir Shpilka, Amir Yehudayoff |
A Lower Bound for the Size of Syntactically Multilinear Arithmetic Circuits. |
SIAM J. Comput. |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Dana Moshkovitz, Ran Raz |
Sub-Constant Error Low Degree Test of Almost-Linear Size. |
SIAM J. Comput. |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Yael Tauman Kalai, Ran Raz |
Interactive PCP. |
ICALP |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Ran Raz |
A Counterexample to Strong Parallel Repetition. |
FOCS |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Dana Moshkovitz, Ran Raz |
Two Query PCP with Sub-Constant Error. |
FOCS |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Ran Raz, Amir Yehudayoff |
Multilinear Formulas, Maximal-Partition Discrepancy and Mixed-Sources Extractors. |
FOCS |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Ran Raz, Amir Yehudayoff |
Lower Bounds and Separations for Constant Depth Multilinear Circuits. |
IEEE Conference on Computational Complexity |
2008 |
DBLP DOI BibTeX RDF |
Constant Depth, Lower Bounds, Separations, Arithmetic Circuits |
| 1 | Ran Raz |
Elusive functions and lower bounds for arithmetic circuits. |
STOC |
2008 |
DBLP DOI BibTeX RDF |
bounded depth circuits, lower bounds, arithmetic circuits, circuit complexity |
| 1 | Ran Raz, Amir Yehudayoff |
Multilinear Formulas, Maximal-Partition Discrepancy and Mixed-Sources Extractors. |
Electronic Colloquium on Computational Complexity (ECCC) |
2007 |
DBLP BibTeX RDF |
|
| 1 | Dana Moshkovitz, Ran Raz |
Sub-Constant Error Probabilistically Checkable Proof of Almost Linear Size. |
Electronic Colloquium on Computational Complexity (ECCC) |
2007 |
DBLP BibTeX RDF |
|
| 1 | Yael Tauman Kalai, Ran Raz |
Interactive PCP. |
Electronic Colloquium on Computational Complexity (ECCC) |
2007 |
DBLP BibTeX RDF |
|
| 1 | Ran Raz, Iddo Tzameret |
Resolution over Linear Equations and Multilinear Proofs. |
Electronic Colloquium on Computational Complexity (ECCC) |
2007 |
DBLP BibTeX RDF |
|
| 1 | Ran Raz, Iddo Tzameret |
Resolution over Linear Equations and Multilinear Proofs |
CoRR |
2007 |
DBLP BibTeX RDF |
|
| 1 | Ran Raz, Amir Shpilka, Amir Yehudayoff |
A Lower Bound for the Size of Syntactically Multilinear Arithmetic Circuits. |
FOCS |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Dmitry Gavinsky, Julia Kempe, Iordanis Kerenidis, Ran Raz, Ronald de Wolf |
Exponential separations for one-way quantum communication complexity, with applications to cryptography. |
STOC |
2007 |
DBLP DOI BibTeX RDF |
cryptography, communication complexity, quantum |
| 1 | Iordanis Kerenidis, Ran Raz |
The one-way communication complexity of the Boolean Hidden Matching Problem. |
Electronic Colloquium on Computational Complexity (ECCC) |
2006 |
DBLP BibTeX RDF |
|
| 1 | Ran Raz, Amir Shpilka, Amir Yehudayoff |
A Lower Bound for the Size of Syntactically Multilinear Arithmetic Circuits. |
Electronic Colloquium on Computational Complexity (ECCC) |
2006 |
DBLP BibTeX RDF |
|
| 1 | Ran Raz, Iddo Tzameret |
The Strength of Multilinear Proofs |
Electronic Colloquium on Computational Complexity (ECCC) |
2006 |
DBLP BibTeX RDF |
|
| 1 | Ran Raz |
Separation of Multilinear Circuit and Formula Size. |
Theory of Computing |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Iordanis Kerenidis, Ran Raz |
The one-way communication complexity of the Boolean Hidden Matching Problem |
CoRR |
2006 |
DBLP BibTeX RDF |
|
| 1 | Ariel Gabizon, Ran Raz, Ronen Shaltiel |
Deterministic Extractors for Bit-Fixing Sources by Obtaining an Independent Seed. |
SIAM J. Comput. |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Yael Tauman Kalai, Ran Raz |
Succinct Non-Interactive Zero-Knowledge Proofs with Preprocessing for LOGSNP. |
FOCS |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Dana Moshkovitz, Ran Raz |
Sub-constant error low degree test of almost-linear size. |
STOC |
2006 |
DBLP DOI BibTeX RDF |
plane vs. point test, probabilistically checkable proofs, locally testable codes, low degree testing |
| 1 | Zeev Dvir, Ran Raz |
Analyzing Linear Mergers |
Electronic Colloquium on Computational Complexity (ECCC) |
2005 |
DBLP BibTeX RDF |
|
| 1 | Ariel Gabizon, Ran Raz |
Deterministic Extractors for Affine Sources over Large Fields |
Electronic Colloquium on Computational Complexity (ECCC) |
2005 |
DBLP BibTeX RDF |
|
| 1 | Ariel Gabizon, Ran Raz, Ronen Shaltiel |
Deterministic Extractors for Bit-fixing Sources by Obtaining an Independent Seed |
Electronic Colloquium on Computational Complexity (ECCC) |
2005 |
DBLP BibTeX RDF |
|
| 1 | Ran Raz |
Quantum Information and the PCP Theorem |
Electronic Colloquium on Computational Complexity (ECCC) |
2005 |
DBLP BibTeX RDF |
|
| 1 | Dana Moshkovitz, Ran Raz |
Sub-Constant Error Low Degree Test of Almost Linear Size |
Electronic Colloquium on Computational Complexity (ECCC) |
2005 |
DBLP BibTeX RDF |
|
| 1 | Dieter van Melkebeek, Ran Raz |
A time lower bound for satisfiability. |
Theor. Comput. Sci. |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Ran Raz, Amir Shpilka |
Deterministic polynomial identity testing in non-commutative models. |
Computational Complexity |
2005 |
DBLP DOI BibTeX RDF |
68Q25, Subject classification |
| 1 | Ariel Gabizon, Ran Raz |
Deterministic Extractors for Affine Sources over Large Fields. |
FOCS |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Ran Raz |
Quantum Information and the PCP Theorem. |
FOCS |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Ran Raz |
Extractors with weak random seeds. |
STOC |
2005 |
DBLP DOI BibTeX RDF |
random sources, extractors, pseudorandomness, condensers, mergers, randomness extraction, explicit constructions, Ramsey graphs |
| 1 | Ran Raz |
Multilinear-NC1 != Multilinear-NC2 |
Electronic Colloquium on Computational Complexity (ECCC) |
2004 |
DBLP BibTeX RDF |
|
| 1 | Ran Raz |
Extractors with Weak Random Seeds |
Electronic Colloquium on Computational Complexity (ECCC) |
2004 |
DBLP BibTeX RDF |
|
| 1 | Cyril Gavoille, David Peleg, Stéphane Pérennes, Ran Raz |
Distance labeling in graphs. |
J. Algorithms |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Ran Raz |
Resolution lower bounds for the weak pigeonhole principle. |
J. ACM |
2004 |
DBLP DOI BibTeX RDF |
P different than NP, computational complexity, Lower bounds, propositional logic, proof complexity |
| 1 | Toniann Pitassi, Ran Raz |
Regular Resolution Lower Bounds For The Weak Pigeonhole Principle. |
Combinatorica |
2004 |
DBLP DOI BibTeX RDF |
Mathematics Subject Classification (2000): 03F20, 68Q17 |
| 1 | Joshua Buresh-Oppenheim, Paul Beame, Toniann Pitassi, Ran Raz, Ashish Sabharwal |
Bounded-Depth Frege Lower Bounds for Weaker Pigeonhole Principles. |
SIAM J. Comput. |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Dieter van Melkebeek, Ran Raz |
A Time Lower Bound for Satisfiability. |
ICALP |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Yevgeniy Dodis, Ariel Elbaz, Roberto Oliveira, Ran Raz |
Improved Randomness Extraction from Two Independent Sources. |
APPROX-RANDOM |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Ariel Gabizon, Ran Raz, Ronen Shaltiel |
Deterministic Extractors for Bit-Fixing Sources by Obtaining an Independent Seed. |
FOCS |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Ran Raz |
Multilinear-NC neq Multilinear-NC. |
FOCS |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Ran Raz, Amir Shpilka |
On the Power of Quantum Proofs. |
IEEE Conference on Computational Complexity |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Ran Raz, Amir Shpilka |
Deterministic Polynomial Identity Testing in Non-Commutative Models. |
IEEE Conference on Computational Complexity |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Ran Raz |
Multi-linear formulas for permanent and determinant are of super-polynomial size. |
STOC |
2004 |
DBLP DOI BibTeX RDF |
arithmetic formulas, computational complexity, lower bounds, circuit complexity, algebraic complexity |
| 1 | Ran Raz |
Multi-Linear Formulas for Permanent and Determinant are of Super-Polynomial Size |
Electronic Colloquium on Computational Complexity (ECCC) |
2003 |
DBLP BibTeX RDF |
|
| 1 | Tzvika Hartman, Ran Raz |
On the distribution of the number of roots of polynomials and explicit weak designs. |
Random Struct. Algorithms |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Irit Dinur, Guy Kindler, Ran Raz, Shmuel Safra |
Approximating CVP to Within Almost-Polynomial Factors is NP-Hard. |
Combinatorica |
2003 |
DBLP DOI BibTeX RDF |
AMS Subject Classification (2000): 68Q17 |
| 1 | Ran Raz |
P != NP, propositional proof complexity, and resolution lower bounds for the weak pigeonhole principle |
CoRR |
2003 |
DBLP BibTeX RDF |
|
| 1 | Ran Raz, Amir Shpilka |
Lower Bounds for Matrix Product in Bounded Depth Circuits with Arbitrary Gates. |
SIAM J. Comput. |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Ran Raz |
On the Complexity of Matrix Product. |
SIAM J. Comput. |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Josh Buresh-Oppenheim, Paul Beame, Toniann Pitassi, Ran Raz, Ashish Sabharwal |
Bounded-depth Frege lower bounds for weaker pigeonhole principles |
Electronic Colloquium on Computational Complexity (ECCC) |
2002 |
DBLP BibTeX RDF |
|
| 1 | Ran Raz |
On the Complexity of Matrix Product |
Electronic Colloquium on Computational Complexity (ECCC) |
2002 |
DBLP BibTeX RDF |
|
| 1 | Ran Raz, Omer Reingold, Salil P. Vadhan |
Extracting all the Randomness and Reducing the Error in Trevisan's Extractors. |
J. Comput. Syst. Sci. |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Josh Buresh-Oppenheim, Paul Beame, Toniann Pitassi, Ran Raz, Ashish Sabharwal |
Bounded-Depth Frege Lower Bounds for Weaker Pigeonhole Principles. |
FOCS |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Ran Raz |
Resolution Lower Bounds for the Weak Pigeonhole Principle. (PDF / PS) |
IEEE Conference on Computational Complexity |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Ran Raz |
On the complexity of matrix product. |
STOC |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Ran Raz |
Resolution lower bounds for the weak pigeonhole principle. |
STOC |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Ran Raz |
Resolution Lower Bounds for the Weak Pigeonhole Principle |
Electronic Colloquium on Computational Complexity (ECCC) |
2001 |
DBLP BibTeX RDF |
|
| 1 | Cyril Gavoille, David Peleg, Stephane Perennes, Ran Raz |
Distance labeling in graphs. |
SODA |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Oded Lachish, Ran Raz |
Explicit lower bound of 4.5n - o(n) for boolena circuits. |
STOC |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Ran Raz, Amir Shpilka |
Lower bounds for matrix product, in bounded depth circuits with arbitrary gates. |
STOC |
2001 |
DBLP DOI BibTeX RDF |
|
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")