Amir Shpilka
Orcid: 0000-0003-2384-425X
According to our database1,
Amir Shpilka
authored at least 119 papers
between 1999 and 2024.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
Online presence:
-
on orcid.org
On csauthors.net:
Bibliography
2024
IEEE Trans. Inf. Theory, July, 2024
New Bounds on Quotient Polynomials with Applications to Exact Division and Divisibility Testing of Sparse Polynomials.
Proceedings of the 2024 International Symposium on Symbolic and Algebraic Computation, 2024
Proceedings of the 15th Innovations in Theoretical Computer Science Conference, 2024
Proceedings of the 39th Computational Complexity Conference, 2024
2023
IEEE Trans. Inf. Theory, May, 2023
Electron. Colloquium Comput. Complex., 2023
New Bounds on Quotient Polynomials with Applications to Exact Divisibility and Divisibility Testing of Sparse Polynomials.
CoRR, 2023
2022
Corrigendum: Explicit Construction of a Small Epsilon-Net for Linear Threshold Functions.
SIAM J. Comput., December, 2022
Explicit and Efficient Constructions of Linear Codes Against Adversarial Insertions and Deletions.
IEEE Trans. Inf. Theory, 2022
Improved Constructions of Coding Schemes for the Binary Deletion Channel and the Poisson Repeat Channel.
IEEE Trans. Inf. Theory, 2022
Electron. Colloquium Comput. Complex., 2022
Electron. Colloquium Comput. Complex., 2022
Proceedings of the 38th International Symposium on Computational Geometry, 2022
2021
Hitting Sets and Reconstruction for Dense Orbits in VP$_e$ and $\Sigma\Pi\Sigma$ Circuits.
Electron. Colloquium Comput. Complex., 2021
CoRR, 2021
CoRR, 2021
Polynomial time deterministic identity testing algorithm for Σ<sup>[3]</sup>ΠΣΠ<sup>[2]</sup> circuits via Edelstein-Kelly type theorem for quadratic polynomials.
Proceedings of the STOC '21: 53rd Annual ACM SIGACT Symposium on Theory of Computing, 2021
Proceedings of the STOC '21: 53rd Annual ACM SIGACT Symposium on Theory of Computing, 2021
Proceedings of the 36th Computational Complexity Conference, 2021
2020
Polynomial time deterministic identity testingalgorithm for Σ<sup>[3]</sup>ΠΣΠ<sup>[2]</sup> circuits via Edelstein-Kelly type theorem for quadratic polynomials.
CoRR, 2020
Proceedings of the 2020 ACM-SIAM Symposium on Discrete Algorithms, 2020
Explicit and Efficient Constructions of Coding Schemes for the Binary Deletion Channel.
Proceedings of the IEEE International Symposium on Information Theory, 2020
Proceedings of the 40th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2020
Proceedings of the 35th Computational Complexity Conference, 2020
2019
Explicit and Efficient Constructions of Coding Schemes for the Binary Deletion Channel and the Poisson Repeat Channel.
CoRR, 2019
Comput. Complex., 2019
Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing, 2019
2018
Theory Comput., 2018
2017
IEEE Trans. Inf. Theory, 2017
Electron. Colloquium Comput. Complex., 2017
Electron. Colloquium Comput. Complex., 2017
Comput. Complex., 2017
2016
Electron. Colloquium Comput. Complex., 2016
Comput. Complex., 2016
Proceedings of the 31st Conference on Computational Complexity, 2016
2015
SIGACT News, 2015
Electron. Colloquium Comput. Complex., 2015
Identity Testing and Lower Bounds for Read-<i>k</i> Oblivious Algebraic Branching Programs.
Electron. Colloquium Comput. Complex., 2015
CoRR, 2015
Comput. Complex., 2015
Proceedings of the IEEE 56th Annual Symposium on Foundations of Computer Science, 2015
2014
Equivalence of Polynomial Identity Testing and Deterministic Multivariate Polynomial Factorization.
Electron. Colloquium Comput. Complex., 2014
Electron. Colloquium Comput. Complex., 2014
Proceedings of the Symposium on Theory of Computing, 2014
2013
IEEE Trans. Inf. Theory, 2013
Deterministic Identity Testing of Depth-4 Multilinear Circuits with Bounded Top Fan-in.
SIAM J. Comput., 2013
SIAM J. Comput., 2013
Electron. Colloquium Comput. Complex., 2013
Electron. Colloquium Comput. Complex., 2013
Pseudorandomness for Multilinear Read-Once Algebraic Branching Programs, in any Order.
Electron. Colloquium Comput. Complex., 2013
Explicit Noether Normalization for Simultaneous Conjugation via Polynomial Identity Testing.
Electron. Colloquium Comput. Complex., 2013
Pseudorandom generators for CC0[p] and the Fourier spectrum of low-degree polynomials over finite fields.
Comput. Complex., 2013
2012
Quasipolynomial-time Identity Testing of Non-Commutative and Read-Once Oblivious Algebraic Branching Programs.
Electron. Colloquium Comput. Complex., 2012
Proceedings of the LATIN 2012: Theoretical Informatics, 2012
Proceedings of the 2012 IEEE International Symposium on Information Theory, 2012
2011
Electron. Colloquium Comput. Complex., 2011
Electron. Colloquium Comput. Complex., 2011
Electron. Colloquium Comput. Complex., 2011
Electron. Colloquium Comput. Complex., 2011
Black box polynomial identity testing of generalized depth-3 arithmetic circuits with bounded top fan-in.
Comb., 2011
Proceedings of the Computer Science - Theory and Applications, 2011
2010
SIAM J. Comput., 2010
Found. Trends Theor. Comput. Sci., 2010
On the Relation between Polynomial Identity Testing and Finding Variable Disjoint Factors.
Electron. Colloquium Comput. Complex., 2010
Electron. Colloquium Comput. Complex., 2010
Pseudorandom generators for CC<sub>0</sub>[p] and the Fourier spectrum of low-degree polynomials over finite fields.
Electron. Colloquium Comput. Complex., 2010
Electron. Colloquium Comput. Complex., 2010
Electron. Colloquium Comput. Complex., 2010
Comput. Complex., 2010
2009
SIAM J. Comput., 2009
Strong Lower Bounds for Approximating Distribution Support Size and the Distinct Elements Problem.
SIAM J. Comput., 2009
SIAM J. Comput., 2009
Electron. Colloquium Comput. Complex., 2009
Comput. Complex., 2009
Proceedings of the 24th Annual IEEE Conference on Computational Complexity, 2009
Proceedings of the Approximation, 2009
2008
SIAM J. Comput., 2008
Electron. Colloquium Comput. Complex., 2008
2007
Locally Decodable Codes with Two Queries and Polynomial Identity Testing for Depth 3 Circuits.
SIAM J. Comput., 2007
Black Box Polynomial Identity Testing of Depth-3 Arithmetic Circuits with Bounded Top Fan-in.
Electron. Colloquium Comput. Complex., 2007
Electron. Colloquium Comput. Complex., 2007
2006
Proceedings of the 21st Annual IEEE Conference on Computational Complexity (CCC 2006), 2006
2005
Electron. Colloquium Comput. Complex., 2005
Sublinear Algorithms for Approximating String Compressibility and the Distribution Support Size
Electron. Colloquium Comput. Complex., 2005
Locally Decodable Codes with 2 queries and Polynomial Identity Testing for depth 3 circuits
Electron. Colloquium Comput. Complex., 2005
Comput. Complex., 2005
2004
Proceedings of the 19th Annual IEEE Conference on Computational Complexity (CCC 2004), 2004
2003
SIAM J. Comput., 2003
Proceedings of the 44th Symposium on Foundations of Computer Science (FOCS 2003), 2003
Proceedings of the Computational Learning Theory and Kernel Machines, 2003
2002
2001
Lower bounds for small depth arithmetic and Boolean circuits. (חסמים תחתונים למעגלים אריתמטים ובוליאנים מעומק חסום.).
PhD thesis, 2001
Comput. Complex., 2001
1999
Electron. Colloquium Comput. Complex., 1999