| 2008 |
|---|
| 10 | EE | Ran Raz,
Amir Yehudayoff:
Multilinear Formulas, Maximal-Partition Discrepancy and Mixed-Sources Extractors.
FOCS 2008: 273-282 |
| 9 | EE | Ran Raz,
Amir Yehudayoff:
Lower Bounds and Separations for Constant Depth Multilinear Circuits.
IEEE Conference on Computational Complexity 2008: 128-139 |
| 8 | EE | Zeev Dvir,
Amir Shpilka,
Amir Yehudayoff:
Hardness-randomness tradeoffs for bounded depth arithmetic circuits.
STOC 2008: 741-748 |
| 7 | EE | Ran Raz,
Amir Yehudayoff:
Lower Bounds and Separations for Constant Depth Multilinear Circuits.
Electronic Colloquium on Computational Complexity (ECCC) 15(006): (2008) |
| 6 | EE | Ronen Gradwohl,
Amir Yehudayoff:
t-Wise independence with local dependencies.
Inf. Process. Lett. 106(5): 208-212 (2008) |
| 5 | EE | Ran Raz,
Amir Shpilka,
Amir Yehudayoff:
A Lower Bound for the Size of Syntactically Multilinear Arithmetic Circuits.
SIAM J. Comput. 38(4): 1624-1647 (2008) |
| 2007 |
|---|
| 4 | EE | Ran Raz,
Amir Shpilka,
Amir Yehudayoff:
A Lower Bound for the Size of Syntactically Multilinear Arithmetic Circuits.
FOCS 2007: 438-448 |
| 3 | EE | Ran Raz,
Amir Yehudayoff:
Multilinear Formulas, Maximal-Partition Discrepancy and Mixed-Sources Extractors.
Electronic Colloquium on Computational Complexity (ECCC) 14(085): (2007) |
| 2 | EE | Zeev Dvir,
Amir Shpilka,
Amir Yehudayoff:
Hardness-Randomness Tradeoffs for Bounded Depth Arithmetic Circuits.
Electronic Colloquium on Computational Complexity (ECCC) 14(121): (2007) |
| 2006 |
|---|
| 1 | EE | Ran Raz,
Amir Shpilka,
Amir Yehudayoff:
A Lower Bound for the Size of Syntactically Multilinear Arithmetic Circuits.
Electronic Colloquium on Computational Complexity (ECCC) 13(060): (2006) |
