| 2008 |
|---|
| 38 | EE | Amir Shpilka,
Ilya Volkovich:
Read-once polynomial identity testing.
STOC 2008: 507-516 |
| 37 | EE | Zeev Dvir,
Amir Shpilka,
Amir Yehudayoff:
Hardness-randomness tradeoffs for bounded depth arithmetic circuits.
STOC 2008: 741-748 |
| 2007 |
|---|
| 36 | EE | Ran Raz,
Amir Shpilka,
Amir Yehudayoff:
A Lower Bound for the Size of Syntactically Multilinear Arithmetic Circuits.
FOCS 2007: 438-448 |
| 35 | EE | Sofya Raskhodnikova,
Dana Ron,
Amir Shpilka,
Adam Smith:
Strong Lower Bounds for Approximating Distribution Support Size and the Distinct Elements Problem.
FOCS 2007: 559-569 |
| 34 | EE | Amir Shpilka:
Interpolation of depth-3 arithmetic circuits with two multiplication gates.
STOC 2007: 284-293 |
| 33 | EE | Zeev Dvir,
Amir Shpilka:
An Improved Analysis of Linear Mergers.
Computational Complexity 16(1): 34-59 (2007) |
| 32 | EE | Zeev Dvir,
Amir Shpilka:
Locally Decodable Codes with Two Queries and Polynomial Identity Testing for Depth 3 Circuits.
SIAM J. Comput. 36(5): 1404-1434 (2007) |
| 2006 |
|---|
| 31 | EE | Amir Shpilka:
Constructions of Low-Degree and Error-Correcting in-Biased Generators.
IEEE Conference on Computational Complexity 2006: 33-45 |
| 30 | EE | Elchanan Mossel,
Amir Shpilka,
Luca Trevisan:
On epsilon-biased generators in NC0.
Random Struct. Algorithms 29(1): 56-81 (2006) |
| 29 | EE | Amir Shpilka,
Avi Wigderson:
Derandomizing Homomorphism Testing in General Groups.
SIAM J. Comput. 36(4): 1215-1230 (2006) |
| 2005 |
|---|
| 28 | EE | Zeev Dvir,
Amir Shpilka:
An Improved Analysis of Mergers.
APPROX-RANDOM 2005: 270-281 |
| 27 | EE | Zeev Dvir,
Amir Shpilka:
Locally decodable codes with 2 queries and polynomial identity testing for depth 3 circuits.
STOC 2005: 592-601 |
| 26 | EE | Ran Raz,
Amir Shpilka:
Deterministic polynomial identity testing in non-commutative models.
Computational Complexity 14(1): 1-19 (2005) |
| 25 | EE | Zeev Dvir,
Amir Shpilka:
Locally Decodable Codes with 2 queries and Polynomial Identity Testing for depth 3 circuits
Electronic Colloquium on Computational Complexity (ECCC)(044): (2005) |
| 24 | EE | Zeev Dvir,
Amir Shpilka:
An Improved Analysis of Mergers
Electronic Colloquium on Computational Complexity (ECCC)(067): (2005) |
| 23 | EE | Sofya Raskhodnikova,
Dana Ron,
Ronitt Rubinfeld,
Amir Shpilka,
Adam Smith:
Sublinear Algorithms for Approximating String Compressibility and the Distribution Support Size
Electronic Colloquium on Computational Complexity (ECCC)(125): (2005) |
| 22 | EE | Amir Shpilka:
Constructions of low-degree and error-correcting epsilon-biased sets
Electronic Colloquium on Computational Complexity (ECCC)(155): (2005) |
| 21 | EE | László Babai,
Amir Shpilka,
Daniel Stefankovic:
Locally testable cyclic codes.
IEEE Transactions on Information Theory 51(8): 2849-2858 (2005) |
| 2004 |
|---|
| 20 | EE | Ran Raz,
Amir Shpilka:
Deterministic Polynomial Identity Testing in Non-Commutative Models.
IEEE Conference on Computational Complexity 2004: 215-222 |
| 19 | EE | Ran Raz,
Amir Shpilka:
On the Power of Quantum Proofs.
IEEE Conference on Computational Complexity 2004: 260-274 |
| 18 | EE | Amir Shpilka,
Avi Wigderson:
Derandomizing homomorphism testing in general groups.
STOC 2004: 427-435 |
| 2003 |
|---|
| 17 | EE | Adam Klivans,
Amir Shpilka:
Learning Arithmetic Circuits via Partial Derivatives.
COLT 2003: 463-476 |
| 16 | EE | László Babai,
Amir Shpilka,
Daniel Stefankovic:
Locally Testable Cyclic Codes.
FOCS 2003: 116-125 |
| 15 | EE | Elchanan Mossel,
Amir Shpilka,
Luca Trevisan:
On e-Biased Generators in NC0.
FOCS 2003: 136-145 |
| 14 | EE | Elchanan Mossel,
Amir Shpilka,
Luca Trevisan:
On epsilon-Biased Generators in NC0
Electronic Colloquium on Computational Complexity (ECCC)(043): (2003) |
| 13 | EE | Ran Raz,
Amir Shpilka:
Lower Bounds for Matrix Product in Bounded Depth Circuits with Arbitrary Gates.
SIAM J. Comput. 32(2): 488-513 (2003) |
| 12 | EE | Amir Shpilka:
Lower Bounds for Matrix Product.
SIAM J. Comput. 32(5): 1185-1200 (2003) |
| 2002 |
|---|
| 11 | EE | Amir Shpilka:
Lower Bounds for Matrix Product
CoRR cs.CC/0201001: (2002) |
| 10 | EE | Amir Shpilka:
Affine projections of symmetric polynomials.
J. Comput. Syst. Sci. 65(4): 639-659 (2002) |
| 2001 |
|---|
| 9 | | Amir Shpilka:
Lower Bounds for Matrix Product.
FOCS 2001: 358-367 |
| 8 | EE | Amir Shpilka:
Affine Projections of Symmetric Polynomials.
IEEE Conference on Computational Complexity 2001: 160-171 |
| 7 | EE | Ran Raz,
Amir Shpilka:
Lower bounds for matrix product, in bounded depth circuits with arbitrary gates.
STOC 2001: 409-418 |
| 6 | EE | Amir Shpilka,
Avi Wigderson:
Depth-3 arithmetic circuits over fields of characteristic zero.
Computational Complexity 10(1): 1-27 (2001) |
| 5 | EE | Amir Shpilka:
Lower bounds for matrix product
Electronic Colloquium on Computational Complexity (ECCC) 8(060): (2001) |
| 4 | EE | Amir Shpilka:
Affine Projections of Symmetric Polynomials
Electronic Colloquium on Computational Complexity (ECCC) 8(35): (2001) |
| 2000 |
|---|
| 3 | EE | Ran Raz,
Amir Shpilka:
Lower Bounds for Matrix Product, in Bounded Depth Circuits with Arbitrary Gates
Electronic Colloquium on Computational Complexity (ECCC) 7(29): (2000) |
| 1999 |
|---|
| 2 | EE | Amir Shpilka,
Avi Wigderson:
Depth-3 Arithmetic Formulae over Fields of Characteristic Zero.
IEEE Conference on Computational Complexity 1999: 87- |
| 1 | EE | Amir Shpilka,
Avi Wigderson:
Depth-3 Arithmetic Formulae over Fields of Characteristic Zero
Electronic Colloquium on Computational Complexity (ECCC) 6(23): (1999) |
