dblp.uni-trier.dewww.uni-trier.de

Amir Shpilka

List of publications from the DBLP Bibliography Server - FAQ
Coauthor Index - Ask others: ACM DL/Guide - CiteSeer - CSB - Google - MSN - Yahoo

2009
50EEAmir Shpilka: Interpolation of Depth-3 Arithmetic Circuits with Two Multiplication Gates. SIAM J. Comput. 38(6): 2130-2161 (2009)
2008
49EEZeev Dvir, Amir Shpilka: Noisy Interpolating Sets for Low Degree Polynomials. IEEE Conference on Computational Complexity 2008: 140-148
48EEZohar Shay Karnin, Amir Shpilka: Black Box Polynomial Identity Testing of Generalized Depth-3 Arithmetic Circuits with Bounded Top Fan-In. IEEE Conference on Computational Complexity 2008: 280-291
47EEZeev Dvir, Amir Shpilka: Towards Dimension Expanders over Finite Fields. IEEE Conference on Computational Complexity 2008: 304-310
46EEAmir Shpilka, Ilya Volkovich: Read-once polynomial identity testing. STOC 2008: 507-516
45EEZeev Dvir, Amir Shpilka, Amir Yehudayoff: Hardness-randomness tradeoffs for bounded depth arithmetic circuits. STOC 2008: 741-748
44EEZeev Dvir, Amir Shpilka: Noisy Interpolating Sets for Low Degree Polynomials. Electronic Colloquium on Computational Complexity (ECCC) 15(004): (2008)
43EERan 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
42EERan Raz, Amir Shpilka, Amir Yehudayoff: A Lower Bound for the Size of Syntactically Multilinear Arithmetic Circuits. FOCS 2007: 438-448
41EESofya Raskhodnikova, Dana Ron, Amir Shpilka, Adam Smith: Strong Lower Bounds for Approximating Distribution Support Size and the Distinct Elements Problem. FOCS 2007: 559-569
40EEAmir Shpilka: Interpolation of depth-3 arithmetic circuits with two multiplication gates. STOC 2007: 284-293
39EEZeev Dvir, Amir Shpilka: An Improved Analysis of Linear Mergers. Computational Complexity 16(1): 34-59 (2007)
38EEZohar Shay Karnin, Amir Shpilka: Black Box Polynomial Identity Testing of Depth-3 Arithmetic Circuits with Bounded Top Fan-in. Electronic Colloquium on Computational Complexity (ECCC) 14(042): (2007)
37EEZeev Dvir, Amir Shpilka, Amir Yehudayoff: Hardness-Randomness Tradeoffs for Bounded Depth Arithmetic Circuits. Electronic Colloquium on Computational Complexity (ECCC) 14(121): (2007)
36EEZeev Dvir, Amir Shpilka: Towards Dimension Expanders Over Finite Fields. Electronic Colloquium on Computational Complexity (ECCC) 14(122): (2007)
35EEAli Juma, Valentine Kabanets, Charles Rackoff, Amir Shpilka: The black-box query complexity of polynomial summation. Electronic Colloquium on Computational Complexity (ECCC) 14(125): (2007)
34EEZeev 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
33EEAmir Shpilka: Constructions of Low-Degree and Error-Correcting in-Biased Generators. IEEE Conference on Computational Complexity 2006: 33-45
32EERan 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)
31EEElchanan Mossel, Amir Shpilka, Luca Trevisan: On epsilon-biased generators in NC0. Random Struct. Algorithms 29(1): 56-81 (2006)
30EEAmir Shpilka, Avi Wigderson: Derandomizing Homomorphism Testing in General Groups. SIAM J. Comput. 36(4): 1215-1230 (2006)
29EEAdam R. Klivans, Amir Shpilka: Learning Restricted Models of Arithmetic Circuits. Theory of Computing 2(1): 185-206 (2006)
2005
28EEZeev Dvir, Amir Shpilka: An Improved Analysis of Mergers. APPROX-RANDOM 2005: 270-281
27EEZeev Dvir, Amir Shpilka: Locally decodable codes with 2 queries and polynomial identity testing for depth 3 circuits. STOC 2005: 592-601
26EERan Raz, Amir Shpilka: Deterministic polynomial identity testing in non-commutative models. Computational Complexity 14(1): 1-19 (2005)
25EEZeev 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)
24EEZeev Dvir, Amir Shpilka: An Improved Analysis of Mergers Electronic Colloquium on Computational Complexity (ECCC)(067): (2005)
23EESofya 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)
22EEAmir Shpilka: Constructions of low-degree and error-correcting epsilon-biased sets Electronic Colloquium on Computational Complexity (ECCC)(155): (2005)
21EELászló Babai, Amir Shpilka, Daniel Stefankovic: Locally testable cyclic codes. IEEE Transactions on Information Theory 51(8): 2849-2858 (2005)
2004
20EERan Raz, Amir Shpilka: Deterministic Polynomial Identity Testing in Non-Commutative Models. IEEE Conference on Computational Complexity 2004: 215-222
19EERan Raz, Amir Shpilka: On the Power of Quantum Proofs. IEEE Conference on Computational Complexity 2004: 260-274
18EEAmir Shpilka, Avi Wigderson: Derandomizing homomorphism testing in general groups. STOC 2004: 427-435
2003
17EEAdam Klivans, Amir Shpilka: Learning Arithmetic Circuits via Partial Derivatives. COLT 2003: 463-476
16EELászló Babai, Amir Shpilka, Daniel Stefankovic: Locally Testable Cyclic Codes. FOCS 2003: 116-125
15EEElchanan Mossel, Amir Shpilka, Luca Trevisan: On e-Biased Generators in NC0. FOCS 2003: 136-145
14EEElchanan Mossel, Amir Shpilka, Luca Trevisan: On epsilon-Biased Generators in NC0 Electronic Colloquium on Computational Complexity (ECCC)(043): (2003)
13EERan Raz, Amir Shpilka: Lower Bounds for Matrix Product in Bounded Depth Circuits with Arbitrary Gates. SIAM J. Comput. 32(2): 488-513 (2003)
12EEAmir Shpilka: Lower Bounds for Matrix Product. SIAM J. Comput. 32(5): 1185-1200 (2003)
2002
11EEAmir Shpilka: Lower Bounds for Matrix Product CoRR cs.CC/0201001: (2002)
10EEAmir 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
8EEAmir Shpilka: Affine Projections of Symmetric Polynomials. IEEE Conference on Computational Complexity 2001: 160-171
7EERan Raz, Amir Shpilka: Lower bounds for matrix product, in bounded depth circuits with arbitrary gates. STOC 2001: 409-418
6EEAmir Shpilka, Avi Wigderson: Depth-3 arithmetic circuits over fields of characteristic zero. Computational Complexity 10(1): 1-27 (2001)
5EEAmir Shpilka: Lower bounds for matrix product Electronic Colloquium on Computational Complexity (ECCC) 8(060): (2001)
4EEAmir Shpilka: Affine Projections of Symmetric Polynomials Electronic Colloquium on Computational Complexity (ECCC) 8(35): (2001)
2000
3EERan 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
2EEAmir Shpilka, Avi Wigderson: Depth-3 Arithmetic Formulae over Fields of Characteristic Zero. IEEE Conference on Computational Complexity 1999: 87-
1EEAmir Shpilka, Avi Wigderson: Depth-3 Arithmetic Formulae over Fields of Characteristic Zero Electronic Colloquium on Computational Complexity (ECCC) 6(23): (1999)

Coauthor Index

1László Babai [16] [21]
2Zeev Dvir [24] [25] [27] [28] [34] [36] [37] [39] [44] [45] [47] [49]
3Ali Juma [35]
4Valentine Kabanets [35]
5Zohar Shay Karnin [38] [48]
6Adam R. Klivans (Adam Klivans) [17] [29]
7Elchanan Mossel [14] [15] [31]
8Charles Rackoff [35]
9Sofya Raskhodnikova [23] [41]
10Ran Raz [3] [7] [13] [19] [20] [26] [32] [42] [43]
11Dana Ron [23] [41]
12Ronitt Rubinfeld [23]
13Adam Smith [23] [41]
14Daniel Stefankovic [16] [21]
15Luca Trevisan [14] [15] [31]
16Ilya Volkovich [46]
17Avi Wigderson [1] [2] [6] [18] [30]
18Amir Yehudayoff [32] [37] [42] [43] [45]

Colors in the list of coauthors

Copyright © Sun May 17 03:24:02 2009 by Michael Ley (ley@uni-trier.de)