5 citations · 13 across the 8 of their papers we have counts for
15 papers
Robust Sylvester-Gallai type theorem for quadratic polynomials
Shir Peleg, Amir Shpilka
In this work, we extend the robust version of the Sylvester-Gallai theorem, obtained by Barak, Dvir, Wigderson and Yehudayoff, and by Dvir, Saraf and Wigderson, to the case of quad…
Explicit and Efficient Constructions of linear Codes Against Adversarial Insertions and Deletions
Roni Con, Amir Shpilka, Itzhak Tamo
In this work, we study linear error-correcting codes against adversarial insertion-deletion (insdel) errors, a topic that has recently gained a lot of attention. We construct linea…
Hitting Sets and Reconstruction for Dense Orbits in and Circuits
Dori Medini, Amir Shpilka
In this paper we study polynomials in (polynomial-sized formulas) and in (polynomial-size depth- circuits) whose orbits, under the action of the affine group…
Polynomial time deterministic identity testingalgorithm for circuits via Edelstein-Kelly type theorem for quadratic polynomials
Shir Peleg, Amir Shpilka
In this work we resolve conjectures of Beecken, Mitmann and Saxena [BMS13] and Gupta [Gup14], by proving an analog of a theorem of Edelstein and Kelly for quadratic polynomials. As…
A generalized Sylvester-Gallai type theorem for quadratic polynomials
Shir Peleg, Amir Shpilka
In this work we prove a version of the Sylvester-Gallai theorem for quadratic polynomials that takes us one step closer to obtaining a deterministic polynomial time algorithm for t…
Reed-Muller Codes: Theory and Algorithms
Emmanuel Abbe, Amir Shpilka, Min Ye
Reed-Muller (RM) codes are among the oldest, simplest and perhaps most ubiquitous family of codes. They are used in many areas of coding theory in both electrical engineering and c…