Ran Raz: Publications:
Arithmetic Circuit Complexity

1. ``Tensor-Rank and Lower Bounds for Arithmetic Formulas'' ,
   R.Raz,
   
   • Proceeding of the 42nd STOC, 2010
   • Journal of the Association for Computing Machinery 60(6) (2013)
   
   
2. ``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)
   
   
3. ``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)
   
   
4. ``Lower Bounds and Separations for Constant Depth Multilinear Circuits '',
   R.Raz, A.Yehudayoff,
   
   • Proceeding of Computational Complexity, 2008, pp. 128-139
   • Journal of Computational Complexity 18(2): 171-207 (2009)
   
   
5. ``Balancing Syntactically Multilinear Arithmetic Circuits'',
   R.Raz, A.Yehudayoff,
   
   • Journal of Computational Complexity 17(4):515-535 (2008)
   
   
6. ``A Lower Bound for the Size of Syntactically Multilinear Arithmetic Circuits'',
   R.Raz, A.Shpilka, A.Yehudayoff,
   
   • Proceeding of the 48th FOCS, 2007, pp. 438-448
   • SIAM Journal of Computing 38(4) (2008)
   
   
7. ``Separation of Multilinear Circuit and Formula Size'',
   R.Raz,
   
   • Proceeding of the 45th FOCS, 2004, pp. 344-351
     (title: ``Multilinear-NC1 ≠ Multilinear-NC2'')
   • Theory Of Computing Vol. 2, article 6 (2006)
   
   
8. ``Multi-Linear Formulas for Permanent and Determinant are of Super-Polynomial Size'',
   R.Raz,
   
   • Proceeding of the 36th STOC, 2004, pp. 633-641
   • Journal of the Association for Computing Machinery 56(2) (2009)
   
   
9. ``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
   
   
10. ``On the Complexity of Matrix Product'',
    R.Raz,
    
    • Proceeding of the 34th STOC, 2002, pp. 144-151
      
    • SIAM Journal of Computing 32(5) (2003), pp. 1356-1369
    
    
11. ``Lower Bounds for Matrix Product, in Bounded Depth Circuits with Arbitrary Gates'',
    R.Raz, A.Shpilka,
    
    • Proceeding of the 33rd STOC, 2001, pp. 409-418
      
    • SIAM Journal of Computing 32(2) (2003), pp. 488-513