Ran Raz: Publications:
Boolean Circuit Complexity

  1. ``Two Sides of the Coin Problem'' ,
    G.Cohen, A.Ganor, R.Raz

  2. ``Improved Average-Case Lower Bounds for DeMorgan Formula Size'' ,
    I.Komargodski, R.Raz, A.Tal

  3. ``Average-Case Lower Bounds for Formula Size'' ,
    I.Komargodski, R.Raz,

  4. ``Circuit Complexity and Communication Complexity''
    (lecture notes series from IAS summer school on Complexity Theory),

  5. ``Lower Bounds for Matrix Product, in Bounded Depth Circuits with Arbitrary Gates'',
    R.Raz, A.Shpilka,

  6. ``An Explicit Lower Bound of 5n - o(n) for Boolean Circuits'',
    K.Iwama, O.Lachish, H.Morizumi, R.Raz,

  7. ``Higher Lower Bounds for Monotone Size'',
    D.Harnik, R.Raz,

  8. ``Separation of the Monotone NC Hierarchy'',
    R.Raz, P.McKenzie,

  9. ``On proving Super-Logarithmic Depth Lower Bounds via the Direct sum in Communication Complexity'',
    M.Karchmer, R.Raz, A.Wigderson,

  10. ``Monotone Circuits for Matching Require Linear Depth'',
    R.Raz, A.Wigderson,

  11. ``Probabilistic Communication Complexity of Boolean Relations'',
    R.Raz, A.Wigderson,