The SCEAS System
| |||||||

## Search the dblp DataBase
Amir Shpilka:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
## Publications of Author- Zeev Dvir, Amir Shpilka
**An Improved Analysis of Mergers.**[Citation Graph (0, 0)][DBLP] APPROX-RANDOM, 2005, pp:270-281 [Conf] - Ran Raz, Amir Shpilka
**Deterministic Polynomial Identity Testing in Non-Commutative Models.**[Citation Graph (0, 0)][DBLP] IEEE Conference on Computational Complexity, 2004, pp:215-222 [Conf] - Ran Raz, Amir Shpilka
**On the Power of Quantum Proofs.**[Citation Graph (0, 0)][DBLP] IEEE Conference on Computational Complexity, 2004, pp:260-274 [Conf] - Amir Shpilka
**Affine Projections of Symmetric Polynomials.**[Citation Graph (0, 0)][DBLP] IEEE Conference on Computational Complexity, 2001, pp:160-171 [Conf] - Amir Shpilka
**Constructions of Low-Degree and Error-Correcting in-Biased Generators.**[Citation Graph (0, 0)][DBLP] IEEE Conference on Computational Complexity, 2006, pp:33-45 [Conf] - Amir Shpilka, Avi Wigderson
**Depth-3 Arithmetic Formulae over Fields of Characteristic Zero.**[Citation Graph (0, 0)][DBLP] IEEE Conference on Computational Complexity, 1999, pp:87-0 [Conf] - Adam Klivans, Amir Shpilka
**Learning Arithmetic Circuits via Partial Derivatives.**[Citation Graph (0, 0)][DBLP] COLT, 2003, pp:463-476 [Conf] - László Babai, Amir Shpilka, Daniel Stefankovic
**Locally Testable Cyclic Codes.**[Citation Graph (0, 0)][DBLP] FOCS, 2003, pp:116-125 [Conf] - Elchanan Mossel, Amir Shpilka, Luca Trevisan
**On e-Biased Generators in NC0.**[Citation Graph (0, 0)][DBLP] FOCS, 2003, pp:136-145 [Conf] - Amir Shpilka
**Lower Bounds for Matrix Product.**[Citation Graph (0, 0)][DBLP] FOCS, 2001, pp:358-367 [Conf] - Zeev Dvir, Amir Shpilka
**Locally decodable codes with 2 queries and polynomial identity testing for depth 3 circuits.**[Citation Graph (0, 0)][DBLP] STOC, 2005, pp:592-601 [Conf] - Ran Raz, Amir Shpilka
**Lower bounds for matrix product, in bounded depth circuits with arbitrary gates.**[Citation Graph (0, 0)][DBLP] STOC, 2001, pp:409-418 [Conf] - Amir Shpilka, Avi Wigderson
**Derandomizing homomorphism testing in general groups.**[Citation Graph (0, 0)][DBLP] STOC, 2004, pp:427-435 [Conf] - Ran Raz, Amir Shpilka
**Deterministic polynomial identity testing in non-commutative models.**[Citation Graph (0, 0)][DBLP] Computational Complexity, 2005, v:14, n:1, pp:1-19 [Journal] - Amir Shpilka, Avi Wigderson
**Depth-3 arithmetic circuits over fields of characteristic zero.**[Citation Graph (0, 0)][DBLP] Computational Complexity, 2001, v:10, n:1, pp:1-27 [Journal] - Amir Shpilka
**Lower Bounds for Matrix Product**[Citation Graph (0, 0)][DBLP] CoRR, 2002, v:0, n:, pp:- [Journal] - Ran Raz, Amir Shpilka
**Lower Bounds for Matrix Product, in Bounded Depth Circuits with Arbitrary Gates**[Citation Graph (0, 0)][DBLP] Electronic Colloquium on Computational Complexity (ECCC), 2000, v:7, n:29, pp:- [Journal] - Amir Shpilka
**Affine Projections of Symmetric Polynomials**[Citation Graph (0, 0)][DBLP] Electronic Colloquium on Computational Complexity (ECCC), 2001, v:8, n:35, pp:- [Journal] - Amir Shpilka
**Lower bounds for matrix product**[Citation Graph (0, 0)][DBLP] Electronic Colloquium on Computational Complexity (ECCC), 2001, v:8, n:060, pp:- [Journal] - Elchanan Mossel, Amir Shpilka, Luca Trevisan
**On epsilon-Biased Generators in NC0**[Citation Graph (0, 0)][DBLP] Electronic Colloquium on Computational Complexity (ECCC), 2003, v:, n:043, pp:- [Journal] - Zeev Dvir, Amir Shpilka
**Locally Decodable Codes with 2 queries and Polynomial Identity Testing for depth 3 circuits**[Citation Graph (0, 0)][DBLP] Electronic Colloquium on Computational Complexity (ECCC), 2005, v:, n:044, pp:- [Journal] - Zeev Dvir, Amir Shpilka
**An Improved Analysis of Mergers**[Citation Graph (0, 0)][DBLP] Electronic Colloquium on Computational Complexity (ECCC), 2005, v:, n:067, pp:- [Journal] - Sofya Raskhodnikova, Dana Ron, Ronitt Rubinfeld, Amir Shpilka, Adam Smith
**Sublinear Algorithms for Approximating String Compressibility and the Distribution Support Size**[Citation Graph (0, 0)][DBLP] Electronic Colloquium on Computational Complexity (ECCC), 2005, v:, n:125, pp:- [Journal] - Amir Shpilka
**Constructions of low-degree and error-correcting epsilon-biased sets**[Citation Graph (0, 0)][DBLP] Electronic Colloquium on Computational Complexity (ECCC), 2005, v:, n:155, pp:- [Journal] - Amir Shpilka
**Affine projections of symmetric polynomials.**[Citation Graph (0, 0)][DBLP] J. Comput. Syst. Sci., 2002, v:65, n:4, pp:639-659 [Journal] - Elchanan Mossel, Amir Shpilka, Luca Trevisan
**On epsilon-biased generators in NC**[Citation Graph (0, 0)][DBLP]^{0}. Random Struct. Algorithms, 2006, v:29, n:1, pp:56-81 [Journal] - Ran Raz, Amir Shpilka
**Lower Bounds for Matrix Product in Bounded Depth Circuits with Arbitrary Gates.**[Citation Graph (0, 0)][DBLP] SIAM J. Comput., 2003, v:32, n:2, pp:488-513 [Journal] - Amir Shpilka
**Lower Bounds for Matrix Product.**[Citation Graph (0, 0)][DBLP] SIAM J. Comput., 2003, v:32, n:5, pp:1185-1200 [Journal] - Amir Shpilka, Avi Wigderson
**Derandomizing Homomorphism Testing in General Groups.**[Citation Graph (0, 0)][DBLP] SIAM J. Comput., 2006, v:36, n:4, pp:1215-1230 [Journal] - Zeev Dvir, Amir Shpilka
**Locally Decodable Codes with Two Queries and Polynomial Identity Testing for Depth 3 Circuits.**[Citation Graph (0, 0)][DBLP] SIAM J. Comput., 2007, v:36, n:5, pp:1404-1434 [Journal] - László Babai, Amir Shpilka, Daniel Stefankovic
**Locally testable cyclic codes.**[Citation Graph (0, 0)][DBLP] IEEE Transactions on Information Theory, 2005, v:51, n:8, pp:2849-2858 [Journal] - Amir Shpilka
**Interpolation of depth-3 arithmetic circuits with two multiplication gates.**[Citation Graph (0, 0)][DBLP] STOC, 2007, pp:284-293 [Conf] - Zeev Dvir, Amir Shpilka
**An Improved Analysis of Linear Mergers.**[Citation Graph (0, 0)][DBLP] Computational Complexity, 2007, v:16, n:1, pp:34-59 [Journal] **Improved Polynomial Identity Testing for Read-Once Formulas.**[Citation Graph (, )][DBLP]**Towards Dimension Expanders over Finite Fields.**[Citation Graph (, )][DBLP]**Noisy Interpolating Sets for Low Degree Polynomials.**[Citation Graph (, )][DBLP]**Black Box Polynomial Identity Testing of Generalized Depth-3 Arithmetic Circuits with Bounded Top Fan-In.**[Citation Graph (, )][DBLP]**Reconstruction of Generalized Depth-3 Arithmetic Circuits with Bounded Top Fan-in.**[Citation Graph (, )][DBLP]**On the Complexity of Boolean Functions in Different Characteristics.**[Citation Graph (, )][DBLP]**A Lower Bound for the Size of Syntactically Multilinear Arithmetic Circuits.**[Citation Graph (, )][DBLP]**Strong Lower Bounds for Approximating Distribution Support Size and the Distinct Elements Problem.**[Citation Graph (, )][DBLP]**Testing Fourier Dimensionality and Sparsity.**[Citation Graph (, )][DBLP]**On the Relation between Polynomial Identity Testing and Finding Variable Disjoint Factors.**[Citation Graph (, )][DBLP]**Hardness-randomness tradeoffs for bounded depth arithmetic circuits.**[Citation Graph (, )][DBLP]**Read-once polynomial identity testing.**[Citation Graph (, )][DBLP]**Explicit construction of a small epsilon-net for linear threshold functions.**[Citation Graph (, )][DBLP]**On the structure of cubic and quartic polynomials.**[Citation Graph (, )][DBLP]**Deterministic identity testing of depth-4 multilinear circuits with bounded top fan-in.**[Citation Graph (, )][DBLP]**The Black-Box Query Complexity of Polynomial Summation.**[Citation Graph (, )][DBLP]**Constructions of Low-degree and Error-Correcting epsilon-Biased Generators.**[Citation Graph (, )][DBLP]**The Complexity of Boolean Functions in Different Characteristics.**[Citation Graph (, )][DBLP]**Noisy Interpolating Sets for Low Degree Polynomials.**[Citation Graph (, )][DBLP]**Hardness-Randomness Tradeoffs for Bounded Depth Arithmetic Circuits.**[Citation Graph (, )][DBLP]**Towards Dimension Expanders Over Finite Fields.**[Citation Graph (, )][DBLP]**Black Box Polynomial Identity Testing of Depth-3 Arithmetic Circuits with Bounded Top Fan-in.**[Citation Graph (, )][DBLP]**The black-box query complexity of polynomial summation.**[Citation Graph (, )][DBLP]**A Lower Bound for the Size of Syntactically Multilinear Arithmetic Circuits.**[Citation Graph (, )][DBLP]
Search in 0.005secs, Finished in 0.007secs | |||||||

| |||||||

| |||||||

System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002 for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002 |