| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | Zohar Shay Karnin, Yuval Rabani, Amir Shpilka |
Explicit Dimension Reduction and Its Applications.  |
SIAM J. Comput.  |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Amir Shpilka |
Capacity Achieving Two-Write WOM Codes. |
LATIN |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Gil Cohen, Amir Shpilka, Avishay Tal |
On the degree of univariate polynomials over the integers. |
ITCS |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Michael A. Forbes, Amir Shpilka |
On Identity Testing of Tensors, Low-rank Recovery and Compressed Sensing. |
Electronic Colloquium on Computational Complexity (ECCC) |
2011 |
DBLP BibTeX RDF |
|
| 1 | Noga Alon, Amir Shpilka, Chris Umans |
On Sunflowers and Matrix Multiplication. |
Electronic Colloquium on Computational Complexity (ECCC) |
2011 |
DBLP BibTeX RDF |
|
| 1 | Eli Ben-Sasson, Elena Grigorescu, Ghid Maatouk, Amir Shpilka, Madhu Sudan |
On Sums of Locally Testable Affine Invariant Properties. |
Electronic Colloquium on Computational Complexity (ECCC) |
2011 |
DBLP BibTeX RDF |
|
| 1 | Gil Cohen, Amir Shpilka, Avishay Tal |
On the Degree of Univariate Polynomials Over the Integers. |
Electronic Colloquium on Computational Complexity (ECCC) |
2011 |
DBLP BibTeX RDF |
|
| 1 | Elad Haramaty, Amir Shpilka, Madhu Sudan |
Optimal testing of multivariate polynomials over small prime fields. |
Electronic Colloquium on Computational Complexity (ECCC) |
2011 |
DBLP BibTeX RDF |
|
| 1 | Arnab Bhattacharyya, Zeev Dvir, Shubhangi Saraf, Amir Shpilka |
Tight lower bounds for 2-query LCCs over finite fields. |
Electronic Colloquium on Computational Complexity (ECCC) |
2011 |
DBLP BibTeX RDF |
|
| 1 | Zeev Dvir, Amir Shpilka |
Noisy Interpolating Sets for Low-Degree Polynomials. |
Theory of Computing |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Zohar Shay Karnin, Amir Shpilka |
Black box polynomial identity testing of generalized depth-3 arithmetic circuits with bounded top fan-in. |
Combinatorica |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Zeev Dvir, Amir Shpilka |
Towards dimension expanders over finite fields. |
Combinatorica |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Michael A. Forbes, Amir Shpilka |
On Identity Testing of Tensors, Low-rank Recovery and Compressed Sensing |
CoRR |
2011 |
DBLP BibTeX RDF |
|
| 1 | Amir Shpilka |
New constructions of WOM codes using the Wozencraft ensemble |
CoRR |
2011 |
DBLP BibTeX RDF |
|
| 1 | Parikshit Gopalan, Ryan O'Donnell, Rocco A. Servedio, Amir Shpilka, Karl Wimmer |
Testing Fourier Dimensionality and Sparsity. |
SIAM J. Comput. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Amir Shpilka |
Recent Results on Polynomial Identity Testing. |
CSR |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Eli Ben-Sasson, Elena Grigorescu, Ghid Maatouk, Amir Shpilka, Madhu Sudan |
On Sums of Locally Testable Affine Invariant Properties. |
APPROX-RANDOM |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Elad Haramaty, Amir Shpilka, Madhu Sudan |
Optimal Testing of Multivariate Polynomials over Small Prime Fields. |
FOCS |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Arnab Bhattacharyya, Zeev Dvir, Amir Shpilka, Shubhangi Saraf |
Tight Lower Bounds for 2-query LCCs over Finite Fields. |
FOCS |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Zohar Shay Karnin, Yuval Rabani, Amir Shpilka |
Explicit Dimension Reduction and Its Applications. |
IEEE Conference on Computational Complexity |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Eli Ben-Sasson, Ghid Maatouk, Amir Shpilka, Madhu Sudan |
Symmetric LDPC Codes are not Necessarily Locally Testable. |
IEEE Conference on Computational Complexity |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Amir Shpilka, Avishay Tal |
On the Minimal Fourier Degree of Symmetric Boolean Functions. |
IEEE Conference on Computational Complexity |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Eli Ben-Sasson, Ghid Maatouk, Amir Shpilka, Madhu Sudan |
Symmetric LDPC codes are not necessarily locally testable. |
Electronic Colloquium on Computational Complexity (ECCC) |
2010 |
DBLP BibTeX RDF |
|
| 1 | Gil Cohen, Amir Shpilka |
On the degree of symmetric functions on the Boolean cube. |
Electronic Colloquium on Computational Complexity (ECCC) |
2010 |
DBLP BibTeX RDF |
|
| 1 | Amir Shpilka, Ilya Volkovich |
On the Relation between Polynomial Identity Testing and Finding Variable Disjoint Factors. |
Electronic Colloquium on Computational Complexity (ECCC) |
2010 |
DBLP BibTeX RDF |
|
| 1 | Shachar Lovett, Partha Mukhopadhyay, Amir Shpilka |
Pseudorandom generators for CC0[p] and the Fourier spectrum of low-degree polynomials over finite fields. |
Electronic Colloquium on Computational Complexity (ECCC) |
2010 |
DBLP BibTeX RDF |
|
| 1 | Amir Shpilka, Ilya Volkovich |
Read-Once Polynomial Identity Testing. |
Electronic Colloquium on Computational Complexity (ECCC) |
2010 |
DBLP BibTeX RDF |
|
| 1 | Amir Shpilka, Avishay Tal |
On the Minimal Fourier Degree of Symmetric Boolean Functions. |
Electronic Colloquium on Computational Complexity (ECCC) |
2010 |
DBLP BibTeX RDF |
|
| 1 | Amir Shpilka, Amir Yehudayoff |
Arithmetic Circuits: A survey of recent results and open questions. |
Foundations and Trends in Theoretical Computer Science |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Parikshit Gopalan, Amir Shpilka, Shachar Lovett |
The Complexity of Boolean Functions in Different Characteristics. |
Computational Complexity |
2010 |
DBLP BibTeX RDF |
|
| 1 | Yuval Rabani, Amir Shpilka |
Explicit Construction of a Small Epsilon-Net for Linear Threshold Functions. |
SIAM J. Comput. |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Amir Shpilka, Ilya Volkovich |
On the Relation between Polynomial Identity Testing and Finding Variable Disjoint Factors. |
ICALP |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Shachar Lovett, Partha Mukhopadhyay, Amir Shpilka |
Pseudorandom Generators for CC0[p] and the Fourier Spectrum of Low-Degree Polynomials over Finite Fields. |
FOCS |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Zohar Shay Karnin, Partha Mukhopadhyay, Amir Shpilka, Ilya Volkovich |
Deterministic identity testing of depth-4 multilinear circuits with bounded top fan-in. |
STOC |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Elad Haramaty, Amir Shpilka |
On the structure of cubic and quartic polynomials. |
STOC |
2010 |
DBLP DOI BibTeX RDF |
Gowers norm, cubic polynomials, quartic polynomials |
| 1 | Elad Haramaty, Amir Shpilka |
On the Structure of Cubic and Quartic Polynomials. |
Electronic Colloquium on Computational Complexity (ECCC) |
2009 |
DBLP BibTeX RDF |
|
| 1 | Zohar Shay Karnin, Partha Mukhopadhyay, Amir Shpilka, Ilya Volkovich |
Deterministic identity testing of depth 4 multilinear circuits with bounded top fan-in. |
Electronic Colloquium on Computational Complexity (ECCC) |
2009 |
DBLP BibTeX RDF |
|
| 1 | Zohar Shay Karnin, Yuval Rabani, Amir Shpilka |
Explicit Dimension Reduction and Its Applications. |
Electronic Colloquium on Computational Complexity (ECCC) |
2009 |
DBLP BibTeX RDF |
|
| 1 | Parikshit Gopalan, Shachar Lovett, Amir Shpilka |
On the Complexity of Boolean Functions in Different Characteristics. |
Electronic Colloquium on Computational Complexity (ECCC) |
2009 |
DBLP BibTeX RDF |
|
| 1 | Ali Juma, Valentine Kabanets, Charles Rackoff, Amir Shpilka |
The Black-Box Query Complexity of Polynomial Summation. |
Computational Complexity |
2009 |
DBLP DOI BibTeX RDF |
Subject classification. 68Q05, 68Q17, 68Q25, 68Q15 |
| 1 | Amir Shpilka |
Constructions of Low-degree and Error-Correcting epsilon-Biased Generators. |
Computational Complexity |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Sofya Raskhodnikova, Dana Ron, Amir Shpilka, Adam Smith |
Strong Lower Bounds for Approximating Distribution Support Size and the Distinct Elements Problem. |
SIAM J. Comput. |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Zeev Dvir, Amir Shpilka, Amir Yehudayoff |
Hardness-Randomness Tradeoffs for Bounded Depth Arithmetic Circuits. |
SIAM J. Comput. |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Amir Shpilka |
Interpolation of Depth-3 Arithmetic Circuits with Two Multiplication Gates. |
SIAM J. Comput. |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Parikshit Gopalan, Ryan O'Donnell, Rocco A. Servedio, Amir Shpilka, Karl Wimmer |
Testing Fourier Dimensionality and Sparsity. |
ICALP |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Amir Shpilka, Ilya Volkovich |
Improved Polynomial Identity Testing for Read-Once Formulas. |
APPROX-RANDOM |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Zohar Shay Karnin, Amir Shpilka |
Reconstruction of Generalized Depth-3 Arithmetic Circuits with Bounded Top Fan-in. |
IEEE Conference on Computational Complexity |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Parikshit Gopalan, Shachar Lovett, Amir Shpilka |
On the Complexity of Boolean Functions in Different Characteristics. |
IEEE Conference on Computational Complexity |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Yuval Rabani, Amir Shpilka |
Explicit construction of a small epsilon-net for linear threshold functions. |
STOC |
2009 |
DBLP DOI BibTeX RDF |
linear threshold function, explicit construction, epsilon-net |
| 1 | Zeev Dvir, Amir Shpilka |
Noisy Interpolating Sets for Low Degree Polynomials. |
Electronic Colloquium on Computational Complexity (ECCC) |
2008 |
DBLP BibTeX RDF |
|
| 1 | Ran Raz, Amir Shpilka, Amir Yehudayoff |
A Lower Bound for the Size of Syntactically Multilinear Arithmetic Circuits. |
SIAM J. Comput. |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Zeev Dvir, Amir Shpilka |
Noisy Interpolating Sets for Low Degree Polynomials. |
IEEE Conference on Computational Complexity |
2008 |
DBLP DOI BibTeX RDF |
Error correcting codes, Polynomial interpolation |
| 1 | Zohar 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 |
DBLP DOI BibTeX RDF |
PIT, depth-3, arithmetic circuit, deterministic, polynomial identity testing |
| 1 | Zeev Dvir, Amir Shpilka |
Towards Dimension Expanders over Finite Fields. |
IEEE Conference on Computational Complexity |
2008 |
DBLP DOI BibTeX RDF |
Cayley graphs, expanders, explicit constructions |
| 1 | Zeev Dvir, Amir Shpilka, Amir Yehudayoff |
Hardness-randomness tradeoffs for bounded depth arithmetic circuits. |
STOC |
2008 |
DBLP DOI BibTeX RDF |
bounded depth circuits, hardness-randomness tradeoffs, identity testing, lower bounds, arithmetic circuits |
| 1 | Amir Shpilka, Ilya Volkovich |
Read-once polynomial identity testing. |
STOC |
2008 |
DBLP DOI BibTeX RDF |
bounded depth circuits, identity testing, read-once formulas, reconstruction, arithmetic circuits |
| 1 | Zeev Dvir, Amir Shpilka |
Towards Dimension Expanders Over Finite Fields. |
Electronic Colloquium on Computational Complexity (ECCC) |
2007 |
DBLP BibTeX RDF |
|
| 1 | Zohar 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) |
2007 |
DBLP BibTeX RDF |
|
| 1 | Zeev Dvir, Amir Shpilka, Amir Yehudayoff |
Hardness-Randomness Tradeoffs for Bounded Depth Arithmetic Circuits. |
Electronic Colloquium on Computational Complexity (ECCC) |
2007 |
DBLP BibTeX RDF |
|
| 1 | Ali Juma, Valentine Kabanets, Charles Rackoff, Amir Shpilka |
The black-box query complexity of polynomial summation. |
Electronic Colloquium on Computational Complexity (ECCC) |
2007 |
DBLP BibTeX RDF |
|
| 1 | Zeev Dvir, Amir Shpilka |
An Improved Analysis of Linear Mergers. |
Computational Complexity |
2007 |
DBLP DOI BibTeX RDF |
68W20, Subject classification |
| 1 | Zeev Dvir, Amir Shpilka |
Locally Decodable Codes with Two Queries and Polynomial Identity Testing for Depth 3 Circuits. |
SIAM J. Comput. |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Ran Raz, Amir Shpilka, Amir Yehudayoff |
A Lower Bound for the Size of Syntactically Multilinear Arithmetic Circuits. |
FOCS |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Sofya Raskhodnikova, Dana Ron, Amir Shpilka, Adam Smith |
Strong Lower Bounds for Approximating Distribution Support Size and the Distinct Elements Problem. |
FOCS |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Amir Shpilka |
Interpolation of depth-3 arithmetic circuits with two multiplication gates. |
STOC |
2007 |
DBLP DOI BibTeX RDF |
depth-3, interpolation, arithmetic circuits, exact learning |
| 1 | Ran Raz, Amir Shpilka, Amir Yehudayoff |
A Lower Bound for the Size of Syntactically Multilinear Arithmetic Circuits. |
Electronic Colloquium on Computational Complexity (ECCC) |
2006 |
DBLP BibTeX RDF |
|
| 1 | Adam R. Klivans, Amir Shpilka |
Learning Restricted Models of Arithmetic Circuits. |
Theory of Computing |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Elchanan Mossel, Amir Shpilka, Luca Trevisan |
On epsilon-biased generators in NC0. |
Random Struct. Algorithms |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Amir Shpilka, Avi Wigderson |
Derandomizing Homomorphism Testing in General Groups. |
SIAM J. Comput. |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Amir Shpilka |
Constructions of Low-Degree and Error-Correcting in-Biased Generators. |
IEEE Conference on Computational Complexity |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Zeev Dvir, Amir Shpilka |
An Improved Analysis of Mergers |
Electronic Colloquium on Computational Complexity (ECCC) |
2005 |
DBLP BibTeX RDF |
|
| 1 | Zeev Dvir, Amir Shpilka |
Locally Decodable Codes with 2 queries and Polynomial Identity Testing for depth 3 circuits |
Electronic Colloquium on Computational Complexity (ECCC) |
2005 |
DBLP BibTeX RDF |
|
| 1 | 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) |
2005 |
DBLP BibTeX RDF |
|
| 1 | Amir Shpilka |
Constructions of low-degree and error-correcting epsilon-biased sets |
Electronic Colloquium on Computational Complexity (ECCC) |
2005 |
DBLP BibTeX RDF |
|
| 1 | Ran Raz, Amir Shpilka |
Deterministic polynomial identity testing in non-commutative models. |
Computational Complexity |
2005 |
DBLP DOI BibTeX RDF |
68Q25, Subject classification |
| 1 | László Babai, Amir Shpilka, Daniel Stefankovic |
Locally testable cyclic codes. |
IEEE Transactions on Information Theory |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Zeev Dvir, Amir Shpilka |
An Improved Analysis of Mergers. |
APPROX-RANDOM |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Zeev Dvir, Amir Shpilka |
Locally decodable codes with 2 queries and polynomial identity testing for depth 3 circuits. |
STOC |
2005 |
DBLP DOI BibTeX RDF |
depth 3 circuits, locally decodable codes, polynomial identity testing |
| 1 | Ran Raz, Amir Shpilka |
On the Power of Quantum Proofs. |
IEEE Conference on Computational Complexity |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Ran Raz, Amir Shpilka |
Deterministic Polynomial Identity Testing in Non-Commutative Models. |
IEEE Conference on Computational Complexity |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Amir Shpilka, Avi Wigderson |
Derandomizing homomorphism testing in general groups. |
STOC |
2004 |
DBLP DOI BibTeX RDF |
homomorphism testing, derandomization, linearity testing |
| 1 | Elchanan Mossel, Amir Shpilka, Luca Trevisan |
On epsilon-Biased Generators in NC0 |
Electronic Colloquium on Computational Complexity (ECCC) |
2003 |
DBLP BibTeX RDF |
|
| 1 | Ran Raz, Amir Shpilka |
Lower Bounds for Matrix Product in Bounded Depth Circuits with Arbitrary Gates. |
SIAM J. Comput. |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Amir Shpilka |
Lower Bounds for Matrix Product. |
SIAM J. Comput. |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Adam Klivans, Amir Shpilka |
Learning Arithmetic Circuits via Partial Derivatives. |
COLT |
2003 |
DBLP DOI BibTeX RDF |
learning with queries, PAC learning |
| 1 | László Babai, Amir Shpilka, Daniel Stefankovic |
Locally Testable Cyclic Codes. |
FOCS |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Elchanan Mossel, Amir Shpilka, Luca Trevisan |
On e-Biased Generators in NC0. |
FOCS |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Amir Shpilka |
Lower Bounds for Matrix Product |
CoRR |
2002 |
DBLP BibTeX RDF |
|
| 1 | Amir Shpilka |
Affine projections of symmetric polynomials. |
J. Comput. Syst. Sci. |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Amir Shpilka |
Affine Projections of Symmetric Polynomials |
Electronic Colloquium on Computational Complexity (ECCC) |
2001 |
DBLP BibTeX RDF |
|
| 1 | Amir Shpilka |
Lower bounds for matrix product |
Electronic Colloquium on Computational Complexity (ECCC) |
2001 |
DBLP BibTeX RDF |
|
| 1 | Amir Shpilka, Avi Wigderson |
Depth-3 arithmetic circuits over fields of characteristic zero. |
Computational Complexity |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Amir Shpilka |
Lower Bounds for Matrix Product. |
FOCS |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Amir Shpilka |
Affine Projections of Symmetric Polynomials. (PDF / PS) |
IEEE Conference on Computational Complexity |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Ran Raz, Amir Shpilka |
Lower bounds for matrix product, in bounded depth circuits with arbitrary gates. |
STOC |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Ran Raz, Amir Shpilka |
Lower Bounds for Matrix Product, in Bounded Depth Circuits with Arbitrary Gates |
Electronic Colloquium on Computational Complexity (ECCC) |
2000 |
DBLP BibTeX RDF |
|
| 1 | Amir Shpilka, Avi Wigderson |
Depth-3 Arithmetic Formulae over Fields of Characteristic Zero |
Electronic Colloquium on Computational Complexity (ECCC) |
1999 |
DBLP BibTeX RDF |
|
| 1 | Amir Shpilka, Avi Wigderson |
Depth-3 Arithmetic Formulae over Fields of Characteristic Zero. (PDF / PS) |
IEEE Conference on Computational Complexity |
1999 |
DBLP DOI BibTeX RDF |
|
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")