Ran Raz: Publications:
Randomness and Derandomization
-
``Two Sides of the Coin Problem''
,
G.Cohen, A.Ganor, R.Raz
-
Proceeding of RANDOM, 2014
-
``Space Pseudorandom Generators by Communication Complexity Lower Bounds''
,
A.Ganor, R.Raz
-
Proceeding of RANDOM, 2014
-
``Improved Average-Case Lower Bounds for DeMorgan Formula Size''
,
I.Komargodski, R.Raz, A.Tal
-
``Efficient Multiparty Protocols via Log-Depth Threshold Formulae'',
G.Cohen, I.Damgard, Y.Ishai, J.Kolker, P.B.Miltersen, R.Raz, R.Rothblum,
-
Proceeding of CRYPTO, 2013
-
``Average-Case Lower Bounds for Formula Size''
,
I.Komargodski, R.Raz,
-
Proceeding of the 45th STOC, 2013
-
``Non-Malleable Extractors with Short Seeds and Applications to Privacy Amplification''
,
G.Cohen, R.Raz, G.Segev,
-
Proceeding of Computational Complexity, 2012
-
SIAM Journal of Computing 43(2): 450-476 (2014)
-
``Pseudorandom Generators for Regular Branching Programs''
,
M.Braverman, A.Rao, R.Raz, A.Yehudayoff,
-
Proceeding of the 51st FOCS, 2010
-
SIAM Journal of Computing 43(3): 973-986 (2014)
-
``Sub-Constant Error Probabilistically Checkable Proof of
Almost-Linear Size'',
D.Moshkovitz, R.Raz,
-
Journal of Computational Complexity 19(3): 367-422 (2010)
-
``Multilinear Formulas, Maximal-Partition Discrepancy and
Mixed-Sources Extractors'',
R.Raz, A.Yehudayoff,
-
Proceeding of the 49th FOCS, 2008
-
Journal of Computer and System Sciences 77(1): 167-190 (2011)
-
``Elusive Functions and Lower Bounds for Arithmetic Circuits'',
R.Raz,
-
Proceeding of the 40th STOC, 2008, pp. 711-720
-
Theory Of Computing Vol. 6, article 7 (2010)
-
``Analyzing Linear Mergers'',
Z.Dvir, R.Raz,
-
Random Structures and Algorithms 32(3) (2008), pp. 334-345
-
``Sub-Constant Error Low Degree Test of Almost Linear Size'',
D.Moshkovitz, R.Raz,
-
Proceeding of the 38th STOC, 2006, pp. 21-30
-
SIAM Journal of Computing 38(1) (2008), pp. 140-180
-
``Deterministic Extractors for Affine Sources over Large Fields'',
A.Gabizon, R.Raz,
-
Proceeding of the 46th FOCS, 2005, pp. 407-418
-
Combinatorica 28(4) (2008), pp. 415-440
-
``Extractors with Weak Random Seeds'',
R.Raz,
-
Proceeding of the 37th STOC, 2005, pp. 11-20
-
``Deterministic Extractors for Bit-Fixing Sources by Obtaining an
Independent Seed'',
A.Gabizon, R.Raz, R.Shaltiel,
-
Proceeding of the 45th FOCS, 2004, pp. 394-403
-
SIAM Journal of Computing 36(4) (2006), pp. 1072-1094
-
``Improved Randomness Extraction from Two Independent Sources'',
Y.Dodis, A.Elbaz, R.Oliveira, R.Raz,
-
Proceeding of the 8th RANDOM, 2004, pp. 334-344
-
``Deterministic Polynomial Identity Testing in Non Commutative
Models'',
R.Raz, A.Shpilka,
-
Proceeding of Computational Complexity, 2004, pp. 215-222
-
Journal of Computational Complexity 14(1) (2005), pp. 1-19
-
``On the Distribution of the Number of Roots of Polynomials
and Explicit Weak Designs'',
T.Hartman, R.Raz,
-
Proceeding of the satellite workshops of the 27th ICALP, 2001,
pp. 3-22
(title:
``On the Distribution of the Number of Roots of Polynomials
and Explicit Logspace Extractors'')
-
Random Structures and Algorithms 23(3) (2003), pp. 235-263
-
``Error Reduction for Extractors'',
R.Raz, O.Reingold, S.Vadhan,
-
Proceeding of the 40th FOCS, 1999, pp. 191-201
-
``Extracting all the Randomness and Reducing the Error
in Trevisan's Extractors'',
R.Raz, O.Reingold, S.Vadhan,
-
Proceeding of the 31st STOC, 1999, pp. 149-158
-
Journal of Computer and System Sciences
65(1) (2002), pp. 97-128
-
``On Recycling the Randomness of the
States in Bounded Space Computation'',
R.Raz, O.Reingold,
-
Proceeding of the 31st STOC, 1999, pp. 159-168