( en | de | ru )

 

Disambiguation of "Shpilka, Amir"

Author of the publication

copydeleteadd this publication to your clipboard
Reed-Muller Codes: Theory and Algorithms.

, , and . CoRR, (2020)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Manutschehr Amirfeyz

Iradj Amirzadeh-Asl

Mahmud Amirian-Khaffadjeh

Mansoor Anwer Ismail Amir

Belal Amireh

 

Other publications of authors with the same name

Capacity achieving multiwrite WOM codes. CoRR, (2012)Lower Bounds on Stabilizer Rank., , and . ITCS, volume 215 of LIPIcs, page 110:1-110:4. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2022)Noisy Interpolating Sets for Low Degree Polynomials., and . CCC, page 140-148. IEEE Computer Society, (2008)Black Box Polynomial Identity Testing of Generalized Depth-3 Arithmetic Circuits with Bounded Top Fan-In., and . CCC, page 280-291. IEEE Computer Society, (2008)Subexponential Size Hitting Sets for Bounded Depth Multilinear Formulas., , and . CCC, volume 33 of LIPIcs, page 304-322. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2015)Proof Complexity Lower Bounds from Algebraic Circuit Complexity., , , and . CCC, volume 50 of LIPIcs, page 32:1-32:17. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2016)Depth-3 Arithmetic Formulae over Fields of Characteristic Zero., and . CCC, page 87-. IEEE Computer Society, (1999)Symmetric LDPC Codes are not Necessarily Locally Testable., , , and . CCC, page 55-65. IEEE Computer Society, (2011)Explicit Dimension Reduction and Its Applications., , and . CCC, page 262-272. IEEE Computer Society, (2011)Explicit construction of a small epsilon-net for linear threshold functions., and . STOC, page 649-658. ACM, (2009)