Google
Google Scholar
Semantic Scholar
MS Academic
CiteSeerX
ORCIDAmir Shpilka
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2021
[j51]Emmanuel Abbe, Amir Shpilka
, Min Ye:
Reed-Muller Codes: Theory and Algorithms. IEEE Trans. Inf. Theory 67(6): 3251-3277 (2021)- [j50]Michael A. Forbes, Amir Shpilka, Iddo Tzameret, Avi Wigderson:
Proof Complexity Lower Bounds from Algebraic Circuit Complexity. Theory Comput. 17: 1-88 (2021) - [c66]Dori Medini, Amir Shpilka:
Hitting Sets and Reconstruction for Dense Orbits in VP_{e} and ΣΠΣ Circuits. Computational Complexity Conference 2021: 19:1-19:27 - [c65]Shai Ben-David, Pavel Hrubes, Shay Moran, Amir Shpilka, Amir Yehudayoff:
Learnability can be independent of set theory (invited paper). STOC 2021: 11 - [c64]Shir Peleg, Amir Shpilka:
Polynomial time deterministic identity testing algorithm for Σ[3]ΠΣΠ[2] circuits via Edelstein-Kelly type theorem for quadratic polynomials. STOC 2021: 259-271 - [i74]Dori Medini, Amir Shpilka:
Hitting Sets and Reconstruction for Dense Orbits in VPe and ΣΠΣ Circuits. CoRR abs/2102.05632 (2021) - [i73]Shir Peleg, Amir Shpilka, Ben Lee Volk:
Lower Bounds on Stabilizer Rank. CoRR abs/2106.03214 (2021) - [i72]Roni Con, Amir Shpilka, Itzhak Tamo:
Linear and Reed Solomon Codes Against Adversarial Insertions and Deletions. CoRR abs/2107.05699 (2021) - [i71]Dori Medini, Amir Shpilka:
Hitting Sets and Reconstruction for Dense Orbits in VP$_e$ and $\Sigma\Pi\Sigma$ Circuits. Electron. Colloquium Comput. Complex. 28: 14 (2021) - [i70]Shir Peleg, Amir Shpilka, Ben Lee Volk:
Lower Bounds on Stabilizer Rank. Electron. Colloquium Comput. Complex. 28: 77 (2021) - 2020
- [c63]Shir Peleg, Amir Shpilka:
A Generalized Sylvester-Gallai Type Theorem for Quadratic Polynomials. Computational Complexity Conference 2020: 8:1-8:33 - [c62]Amir Shpilka:
On Some Recent Advances in Algebraic Complexity (Invited Talk). FSTTCS 2020: 6:1-6:1 - [c61]Roni Con, Amir Shpilka:
Explicit and Efficient Constructions of Coding Schemes for the Binary Deletion Channel. ISIT 2020: 84-89 - [c60]Ori Sberlo, Amir Shpilka:
On the Performance of Reed-Muller Codes with respect to Random Errors and Erasures. SODA 2020: 1357-1376 - [i69]Emmanuel Abbe, Amir Shpilka, Min Ye:
Reed-Muller Codes: Theory and Algorithms. CoRR abs/2002.03317 (2020) - [i68]Shir Peleg, Amir Shpilka:
A generalized Sylvester-Gallai type theorem for quadratic polynomials. CoRR abs/2003.05152 (2020) - [i67]Shir Peleg, Amir Shpilka:
Polynomial time deterministic identity testingalgorithm for Σ[3]ΠΣΠ[2] circuits via Edelstein-Kelly type theorem for quadratic polynomials. CoRR abs/2006.08263 (2020)
2010 – 2019
- 2019
- [j49]Gillat Kol, Shay Moran, Amir Shpilka, Amir Yehudayoff:
Approximate Nonnegative Rank is Equivalent to the Smooth Rectangle Bound. Comput. Complex. 28(1): 1-25 (2019) - [j48]Shai Ben-David, Pavel Hrubes, Shay Moran, Amir Shpilka, Amir Yehudayoff:
Learnability can be undecidable. Nat. Mach. Intell. 1(1): 44-48 (2019) - [j47]Shai Ben-David, Pavel Hrubes, Shay Moran, Amir Shpilka, Amir Yehudayoff:
Author Correction: Learnability can be undecidable. Nat. Mach. Intell. 1(2): 121 (2019) - [c59]Amir Shpilka:
Sylvester-Gallai type theorems for quadratic polynomials. STOC 2019: 1203-1214 - [e1]Amir Shpilka:
34th Computational Complexity Conference, CCC 2019, July 18-20, 2019, New Brunswick, NJ, USA. LIPIcs 137, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2019, ISBN 978-3-95977-116-0 [contents] - [i66]Amir Shpilka:
Sylvester-Gallai type theorems for quadratic polynomials. CoRR abs/1904.06245 (2019) - [i65]Roni Con, Amir Shpilka:
Explicit and Efficient Constructions of Coding Schemes for the Binary Deletion Channel and the Poisson Repeat Channel. CoRR abs/1909.10177 (2019) - 2018
- [j46]Michael A. Forbes, Amir Shpilka, Ben Lee Volk:
Succinct Hitting Sets and Barriers to Proving Lower Bounds for Algebraic Circuits. Theory Comput. 14(1): 1-45 (2018) - [j45]Matthew Anderson, Michael A. Forbes, Ramprasad Saptharishi, Amir Shpilka, Ben Lee Volk:
Identity Testing and Lower Bounds for Read-k Oblivious Algebraic Branching Programs. ACM Trans. Comput. Theory 10(1): 3:1-3:30 (2018) - [c58]Michael A. Forbes, Amir Shpilka:
A PSPACE construction of a hitting set for the closure of small algebraic circuits. STOC 2018: 1180-1192 - [i64]Ori Sberlo, Amir Shpilka:
On the Performance of Reed-Muller Codes with respect to Random Errors and Erasures. CoRR abs/1811.12447 (2018) - 2017
- [j44]Amir Shpilka, Avishay Tal, Ben lee Volk:
On the Structure of Boolean Functions with Small Spectral Norm. Comput. Complex. 26(1): 229-273 (2017) - [j43]Gil Cohen, Amir Shpilka, Avishay Tal:
On the degree of univariate polynomials over the integers. Comb. 37(3): 419-464 (2017) - [j42]Ramprasad Saptharishi, Amir Shpilka, Ben Lee Volk:
Efficiently Decoding Reed-Muller Codes From Random Errors. IEEE Trans. Inf. Theory 63(4): 1954-1960 (2017) - [c57]Michael A. Forbes, Amir Shpilka, Ben Lee Volk:
Succinct hitting sets and barriers to proving algebraic circuits lower bounds. STOC 2017: 653-664 - [i63]Michael A. Forbes, Amir Shpilka, Ben Lee Volk:
Succinct Hitting Sets and Barriers to Proving Algebraic Circuits Lower Bounds. CoRR abs/1701.05328 (2017) - [i62]Shai Ben-David, Pavel Hrubes, Shay Moran, Amir Shpilka, Amir Yehudayoff:
A learning problem that is independent of the set theory ZFC axioms. CoRR abs/1711.05195 (2017) - [i61]Michael A. Forbes, Amir Shpilka:
A PSPACE Construction of a Hitting Set for the Closure of Small Algebraic Circuits. CoRR abs/1712.09967 (2017) - [i60]Michael A. Forbes, Amir Shpilka, Ben Lee Volk:
Succinct Hitting Sets and Barriers to Proving Algebraic Circuits Lower Bounds. Electron. Colloquium Comput. Complex. 24: 7 (2017) - [i59]Michael A. Forbes, Amir Shpilka:
A PSPACE Construction of a Hitting Set for the Closure of Small Algebraic Circuits. Electron. Colloquium Comput. Complex. 24: 163 (2017) - 2016
- [j41]Gillat Kol, Shay Moran, Amir Shpilka, Amir Yehudayoff:
Direct Sum Fails for Zero-Error Average Communication. Algorithmica 76(3): 782-795 (2016) - [j40]Rafael Mendes de Oliveira, Amir Shpilka, Ben lee Volk:
Subexponential Size Hitting Sets for Bounded Depth Multilinear Formulas. Comput. Complex. 25(2): 455-505 (2016) - [j39]Arnab Bhattacharyya, Zeev Dvir, Shubhangi Saraf, Amir Shpilka:
Tight lower bounds for linear 2-query LCCs over finite fields. Comb. 36(1): 1-36 (2016) - [c56]Matthew Anderson, Michael A. Forbes, Ramprasad Saptharishi, Amir Shpilka, Ben Lee Volk:
Identity Testing and Lower Bounds for Read-k Oblivious Algebraic Branching Programs. Computational Complexity Conference 2016: 30:1-30:25 - [c55]Michael A. Forbes, Amir Shpilka, Iddo Tzameret, Avi Wigderson:
Proof Complexity Lower Bounds from Algebraic Circuit Complexity. Computational Complexity Conference 2016: 32:1-32:17 - [c54]Ramprasad Saptharishi, Amir Shpilka, Ben Lee Volk:
Efficiently decoding Reed-Muller codes from random errors. STOC 2016: 227-235 - [i58]Michael A. Forbes, Amir Shpilka, Iddo Tzameret, Avi Wigderson:
Proof Complexity Lower Bounds from Algebraic Circuit Complexity. CoRR abs/1606.05050 (2016) - [i57]Michael A. Forbes, Amir Shpilka, Iddo Tzameret, Avi Wigderson:
Proof Complexity Lower Bounds from Algebraic Circuit Complexity. Electron. Colloquium Comput. Complex. 23: 98 (2016) - 2015
- [j38]Swastik Kopparty, Shubhangi Saraf, Amir Shpilka:
Equivalence of Polynomial Identity Testing and Polynomial Factorization. Comput. Complex. 24(2): 295-331 (2015) - [j37]Amir Shpilka, Ilya Volkovich:
Read-once polynomial identity testing. Comput. Complex. 24(3): 477-532 (2015) - [j36]Michael A. Forbes, Amir Shpilka:
Complexity Theory Column 88: Challenges in Polynomial Factorization1. SIGACT News 46(4): 32-49 (2015) - [j35]Emmanuel Abbe, Amir Shpilka, Avi Wigderson:
Reed-Muller Codes for Random Erasures and Errors. IEEE Trans. Inf. Theory 61(10): 5229-5252 (2015) - [c53]Rafael Mendes de Oliveira, Amir Shpilka, Ben Lee Volk:
Subexponential Size Hitting Sets for Bounded Depth Multilinear Formulas. Computational Complexity Conference 2015: 304-322 - [c52]Shay Moran, Amir Shpilka, Avi Wigderson, Amir Yehudayoff:
Compressing and Teaching for Low VC-Dimension. FOCS 2015: 40-51 - [c51]Emmanuel Abbe, Amir Shpilka, Avi Wigderson:
Reed-Muller Codes for Random Erasures and Errors. STOC 2015: 297-306 - [i56]Shay Moran, Amir Shpilka, Avi Wigderson, Amir Yehudayoff:
Teaching and compressing for low VC-dimension. CoRR abs/1502.06187 (2015) - [i55]Ramprasad Saptharishi, Amir Shpilka, Ben Lee Volk:
Decoding high rate Reed-Muller codes from random errors in near linear time. CoRR abs/1503.09092 (2015) - [i54]Matthew Anderson, Michael A. Forbes, Ramprasad Saptharishi, Amir Shpilka, Ben Lee Volk:
Identity Testing and Lower Bounds for Read-$k$ Oblivious Algebraic Branching Programs. CoRR abs/1511.07136 (2015) - [i53]Shay Moran, Amir Shpilka, Avi Wigderson, Amir Yehudayoff:
Teaching and compressing for low VC-dimension. Electron. Colloquium Comput. Complex. 22: 25 (2015) - [i52]Matthew Anderson, Michael A. Forbes, Ramprasad Saptharishi, Amir Shpilka, Ben Lee Volk:
Identity Testing and Lower Bounds for Read-k Oblivious Algebraic Branching Programs. Electron. Colloquium Comput. Complex. 22: 184 (2015) - 2014
- [j34]Amir Shpilka, Avishay Tal:
On the minimal fourier degree of symmetric Boolean functions. Comb. 34(3): 359-377 (2014) - [j33]Amir Shpilka:
Capacity-Achieving Multiwrite WOM Codes. IEEE Trans. Inf. Theory 60(3): 1481-1487 (2014) - [j32]Eitan Yaakobi, Amir Shpilka:
High Sum-Rate Three-Write and Nonbinary WOM Codes. IEEE Trans. Inf. Theory 60(11): 7006-7015 (2014) - [j31]Amir Shpilka, Ilya Volkovich:
On Reconstruction and Testing of Read-Once Formulas. Theory Comput. 10: 465-514 (2014) - [c50]Swastik Kopparty, Shubhangi Saraf, Amir Shpilka:
Equivalence of Polynomial Identity Testing and Deterministic Multivariate Polynomial Factorization. Computational Complexity Conference 2014: 169-180 - [c49]Zeev Dvir, Rafael Mendes de Oliveira, Amir Shpilka:
Testing Equivalence of Polynomials under Shifts. ICALP (1) 2014: 417-428 - [c48]Gillat Kol, Shay Moran, Amir Shpilka, Amir Yehudayoff:
Approximate Nonnegative Rank Is Equivalent to the Smooth Rectangle Bound. ICALP (1) 2014: 701-712 - [c47]Amir Shpilka, Avishay Tal, Ben lee Volk:
On the structure of boolean functions with small spectral norm. ITCS 2014: 37-48 - [c46]Gillat Kol, Shay Moran, Amir Shpilka, Amir Yehudayoff:
Direct sum fails for zero error average communication. ITCS 2014: 517-522 - [c45]Michael A. Forbes, Ramprasad Saptharishi, Amir Shpilka:
Hitting sets for multilinear read-once algebraic branching programs, in any order. STOC 2014: 867-875 - [i51]Zeev Dvir, Rafael Mendes de Oliveira, Amir Shpilka:
Testing Equivalence of Polynomials under Shifts. CoRR abs/1401.3714 (2014) - [i50]Emmanuel Abbe, Amir Shpilka, Avi Wigderson:
Reed-Muller codes for random erasures and errors. CoRR abs/1411.4590 (2014) - [i49]Rafael Mendes de Oliveira, Amir Shpilka, Ben Lee Volk:
Subexponential Size Hitting Sets for Bounded Depth Multilinear Formulas. CoRR abs/1411.7492 (2014) - [i48]Swastik Kopparty, Shubhangi Saraf, Amir Shpilka:
Equivalence of Polynomial Identity Testing and Deterministic Multivariate Polynomial Factorization. Electron. Colloquium Comput. Complex. 21: 1 (2014) - [i47]Zeev Dvir, Rafael Mendes de Oliveira, Amir Shpilka:
Testing Equivalence of Polynomials under Shifts. Electron. Colloquium Comput. Complex. 21: 3 (2014) - [i46]Gillat Kol, Shay Moran, Amir Shpilka, Amir Yehudayoff:
Approximate Nonnegative Rank is Equivalent to the Smooth Rectangle Bound. Electron. Colloquium Comput. Complex. 21: 46 (2014) - [i45]Rafael Mendes de Oliveira, Amir Shpilka, Ben Lee Volk:
Subexponential Size Hitting Sets for Bounded Depth Multilinear Formulas. Electron. Colloquium Comput. Complex. 21: 157 (2014) - 2013
- [j30]Noga Alon, Amir Shpilka, Christopher Umans:
On sunflowers and matrix multiplication. Comput. Complex. 22(2): 219-243 (2013) - [j29]Shachar Lovett, Partha Mukhopadhyay, Amir Shpilka:
Pseudorandom generators for CC0[p] and the Fourier spectrum of low-degree polynomials over finite fields. Comput. Complex. 22(4): 679-725 (2013) - [j28]Elad Haramaty, Amir Shpilka, Madhu Sudan:
Optimal Testing of Multivariate Polynomials over Small Prime Fields. SIAM J. Comput. 42(2): 536-562 (2013) - [j27]Zohar Shay Karnin, Partha Mukhopadhyay, Amir Shpilka, Ilya Volkovich:
Deterministic Identity Testing of Depth-4 Multilinear Circuits with Bounded Top Fan-in. SIAM J. Comput. 42(6): 2114-2131 (2013) - [j26]Amir Shpilka:
New Constructions of WOM Codes Using the Wozencraft Ensemble. IEEE Trans. Inf. Theory 59(7): 4520-4529 (2013) - [c44]Michael A. Forbes, Amir Shpilka:
Explicit Noether Normalization for Simultaneous Conjugation via Polynomial Identity Testing. APPROX-RANDOM 2013: 527-542 - [c43]Michael A. Forbes, Amir Shpilka:
Quasipolynomial-Time Identity Testing of Non-commutative and Read-Once Oblivious Algebraic Branching Programs. FOCS 2013: 243-252 - [i44]Michael A. Forbes, Amir Shpilka:
Explicit Noether Normalization for Simultaneous Conjugation via Polynomial Identity Testing. CoRR abs/1303.0084 (2013) - [i43]Amir Shpilka, Ben lee Volk:
On the Structure of Boolean Functions with Small Spectral Norm. CoRR abs/1304.0371 (2013) - [i42]Michael A. Forbes, Ramprasad Saptharishi, Amir Shpilka:
Pseudorandomness for Multilinear Read-Once Algebraic Branching Programs, in any Order. CoRR abs/1309.5668 (2013) - [i41]Michael A. Forbes, Amir Shpilka:
Explicit Noether Normalization for Simultaneous Conjugation via Polynomial Identity Testing. Electron. Colloquium Comput. Complex. 20: 33 (2013) - [i40]Amir Shpilka, Ben lee Volk:
On the Structure of Boolean Functions with Small Spectral Norm. Electron. Colloquium Comput. Complex. 20: 49 (2013) - [i39]Gillat Kol, Shay Moran, Amir Shpilka, Amir Yehudayoff:
Direct Sum Fails for Zero Error Average Communication. Electron. Colloquium Comput. Complex. 20: 79 (2013) - [i38]Michael A. Forbes, Ramprasad Saptharishi, Amir Shpilka:
Pseudorandomness for Multilinear Read-Once Algebraic Branching Programs, in any Order. Electron. Colloquium Comput. Complex. 20: 132 (2013) - 2012
- [j25]Zohar Shay Karnin, Yuval Rabani, Amir Shpilka:
Explicit Dimension Reduction and Its Applications. SIAM J. Comput. 41(1): 219-249 (2012) - [c42]Noga Alon, Amir Shpilka, Christopher Umans:
On Sunflowers and Matrix Multiplication. Computational Complexity Conference 2012: 214-223 - [c41]Gil Cohen, Amir Shpilka, Avishay Tal:
On the degree of univariate polynomials over the integers. ITCS 2012: 409-427 - [c40]Eitan Yaakobi, Amir Shpilka:
High sum-rate three-write and non-binary WOM codes. ISIT 2012: 1386-1390 - [c39]Amir Shpilka:
Capacity Achieving Two-Write WOM Codes. LATIN 2012: 631-642 - [c38]Michael A. Forbes, Amir Shpilka:
On identity testing of tensors, low-rank recovery and compressed sensing. STOC 2012: 163-172 - [i37]Amir Shpilka:
Capacity achieving multiwrite WOM codes. CoRR abs/1209.1128 (2012) - [i36]Michael A. Forbes, Amir Shpilka:
Quasipolynomial-time Identity Testing of Non-Commutative and Read-Once Oblivious Algebraic Branching Programs. CoRR abs/1209.2408 (2012) - [i35]Michael A. Forbes, Amir Shpilka:
Quasipolynomial-time Identity Testing of Non-Commutative and Read-Once Oblivious Algebraic Branching Programs. Electron. Colloquium Comput. Complex. 19: 115 (2012) - 2011
- [j24]Zeev Dvir, Amir Shpilka:
Towards dimension expanders over finite fields. Comb. 31(3): 305-320 (2011) - [j23]Zohar Shay Karnin, Amir Shpilka:
Black box polynomial identity testing of generalized depth-3 arithmetic circuits with bounded top fan-in. Comb. 31(3): 333-364 (2011) - [j22]Parikshit Gopalan, Ryan O'Donnell, Rocco A. Servedio, Amir Shpilka, Karl Wimmer:
Testing Fourier Dimensionality and Sparsity. SIAM J. Comput. 40(4): 1075-1100 (2011) - [j21]Zeev Dvir, Amir Shpilka:
Noisy Interpolating Sets for Low-Degree Polynomials. Theory Comput. 7(1): 1-18 (2011) - [c37]Eli Ben-Sasson, Elena Grigorescu, Ghid Maatouk, Amir Shpilka, Madhu Sudan:
On Sums of Locally Testable Affine Invariant Properties. APPROX-RANDOM 2011: 400-411 - [c36]Eli Ben-Sasson, Ghid Maatouk, Amir Shpilka, Madhu Sudan:
Symmetric LDPC Codes are not Necessarily Locally Testable. Computational Complexity Conference 2011: 55-65 - [c35]Amir Shpilka, Avishay Tal:
On the Minimal Fourier Degree of Symmetric Boolean Functions. Computational Complexity Conference 2011: 200-209 - [c34]Zohar Shay Karnin, Yuval Rabani, Amir Shpilka:
Explicit Dimension Reduction and Its Applications. Computational Complexity Conference 2011: 262-272 - [c33]Amir Shpilka:
Recent Results on Polynomial Identity Testing. CSR 2011: 397-400 - [c32]Elad Haramaty, Amir Shpilka, Madhu Sudan:
Optimal Testing of Multivariate Polynomials over Small Prime Fields. FOCS 2011: 629-637 - [c31]Arnab Bhattacharyya, Zeev Dvir, Amir Shpilka, Shubhangi Saraf:
Tight Lower Bounds for 2-query LCCs over Finite Fields. FOCS 2011: 638-647 - [i34]Amir Shpilka:
New constructions of WOM codes using the Wozencraft ensemble. CoRR abs/1110.6590 (2011) - [i33]Michael A. Forbes, Amir Shpilka:
On Identity Testing of Tensors, Low-rank Recovery and Compressed Sensing. CoRR abs/1111.0663 (2011) - [i32]Gil Cohen, Amir Shpilka, Avishay Tal:
On the Degree of Univariate Polynomials Over the Integers. Electron. Colloquium Comput. Complex. 18: 2 (2011) - [i31]Arnab Bhattacharyya, Zeev Dvir, Shubhangi Saraf, Amir Shpilka:
Tight lower bounds for 2-query LCCs over finite fields. Electron. Colloquium Comput. Complex. 18: 54 (2011) - [i30]Elad Haramaty, Amir Shpilka, Madhu Sudan:
Optimal testing of multivariate polynomials over small prime fields. Electron. Colloquium Comput. Complex. 18: 59 (2011) - [i29]Noga Alon, Amir Shpilka, Christopher Umans:
On Sunflowers and Matrix Multiplication. Electron. Colloquium Comput. Complex. 18: 67 (2011) - [i28]Eli Ben-Sasson, Elena Grigorescu, Ghid Maatouk, Amir Shpilka, Madhu Sudan:
On Sums of Locally Testable Affine Invariant Properties. Electron. Colloquium Comput. Complex. 18: 79 (2011) - [i27]Michael A. Forbes, Amir Shpilka:
On Identity Testing of Tensors, Low-rank Recovery and Compressed Sensing. Electron. Colloquium Comput. Complex. 18: 147 (2011) - 2010
- [j20]Parikshit Gopalan, Amir Shpilka, Shachar Lovett:
The Complexity of Boolean Functions in Different Characteristics. Comput. Complex. 19(2): 235-263 (2010) - [j19]Amir Shpilka, Amir Yehudayoff:
Arithmetic Circuits: A survey of recent results and open questions. Found. Trends Theor. Comput. Sci. 5(3-4): 207-388 (2010) - [j18]Yuval Rabani, Amir Shpilka:
Explicit Construction of a Small Epsilon-Net for Linear Threshold Functions. SIAM J. Comput. 39(8): 3501-3520 (2010) - [c30]Shachar Lovett, Partha Mukhopadhyay, Amir Shpilka:
Pseudorandom Generators for CC0[p] and the Fourier Spectrum of Low-Degree Polynomials over Finite Fields. FOCS 2010: 695-704 - [c29]Amir Shpilka, Ilya Volkovich:
On the Relation between Polynomial Identity Testing and Finding Variable Disjoint Factors. ICALP (1) 2010: 408-419 - [c28]Elad Haramaty, Amir Shpilka:
On the structure of cubic and quartic polynomials. STOC 2010: 331-340 - [c27]Zohar Shay Karnin, Partha Mukhopadhyay, Amir Shpilka, Ilya Volkovich:
Deterministic identity testing of depth-4 multilinear circuits with bounded top fan-in. STOC 2010: 649-658 - [i26]Amir Shpilka, Ilya Volkovich:
Read-Once Polynomial Identity Testing. Electron. Colloquium Comput. Complex. 17: 11 (2010) - [i25]Shachar Lovett, Partha Mukhopadhyay, Amir Shpilka:
Pseudorandom generators for CC0[p] and the Fourier spectrum of low-degree polynomials over finite fields. Electron. Colloquium Comput. Complex. 17: 33 (2010) - [i24]Amir Shpilka, Ilya Volkovich:
On the Relation between Polynomial Identity Testing and Finding Variable Disjoint Factors. Electron. Colloquium Comput. Complex. 17: 36 (2010) - [i23]Gil Cohen, Amir Shpilka:
On the degree of symmetric functions on the Boolean cube. Electron. Colloquium Comput. Complex. 17: 39 (2010) - [i22]Amir Shpilka, Avishay Tal:
On the Minimal Fourier Degree of Symmetric Boolean Functions. Electron. Colloquium Comput. Complex. 17: 178 (2010) - [i21]Eli Ben-Sasson, Ghid Maatouk, Amir Shpilka, Madhu Sudan:
Symmetric LDPC codes are not necessarily locally testable. Electron. Colloquium Comput. Complex. 17: 199 (2010)
2000 – 2009
- 2009
- [j17]Ali Juma, Valentine Kabanets, Charles Rackoff, Amir Shpilka:
The Black-Box Query Complexity of Polynomial Summation. Comput. Complex. 18(1): 59-79 (2009) - [j16]Amir Shpilka:
Constructions of Low-degree and Error-Correcting epsilon-Biased Generators. Comput. Complex. 18(4): 495-525 (2009) - [j15]Amir Shpilka:
Interpolation of Depth-3 Arithmetic Circuits with Two Multiplication Gates. SIAM J. Comput. 38(6): 2130-2161 (2009) - [j14]Sofya Raskhodnikova, Dana Ron, Amir Shpilka, Adam D. Smith:
Strong Lower Bounds for Approximating Distribution Support Size and the Distinct Elements Problem. SIAM J. Comput. 39(3): 813-842 (2009) - [j13]Zeev Dvir, Amir Shpilka, Amir Yehudayoff:
Hardness-Randomness Tradeoffs for Bounded Depth Arithmetic Circuits. SIAM J. Comput. 39(4): 1279-1293 (2009) - [c26]Amir Shpilka, Ilya Volkovich:
Improved Polynomial Identity Testing for Read-Once Formulas. APPROX-RANDOM 2009: 700-713 - [c25]Parikshit Gopalan, Shachar Lovett, Amir Shpilka:
On the Complexity of Boolean Functions in Different Characteristics. Computational Complexity Conference 2009: 173-183 - [c24]Zohar Shay Karnin, Amir Shpilka:
Reconstruction of Generalized Depth-3 Arithmetic Circuits with Bounded Top Fan-in. Computational Complexity Conference 2009: 274-285 - [c23]Parikshit Gopalan, Ryan O'Donnell, Rocco A. Servedio, Amir Shpilka, Karl Wimmer:
Testing Fourier Dimensionality and Sparsity. ICALP (1) 2009: 500-512 - [c22]