| 2009 |
|---|
| 35 | EE | Michael Navon,
Alex Samorodnitsky:
Linear Programming Bounds for Codes via a Covering Argument.
Discrete & Computational Geometry 41(2): 199-207 (2009) |
| 2008 |
|---|
| 34 | EE | Shachar Lovett,
Roy Meshulam,
Alex Samorodnitsky:
Inverse conjecture for the gowers norm is false.
STOC 2008: 547-556 |
| 33 | EE | Alex Samorodnitsky:
An upper bound for permanents of nonnegative matrices.
J. Comb. Theory, Ser. A 115(2): 279-292 (2008) |
| 2007 |
|---|
| 32 | EE | Mickey Brautbar,
Alex Samorodnitsky:
Approximating entropy from sublinear samples.
SODA 2007: 366-375 |
| 31 | EE | Alex Samorodnitsky:
Low-degree tests at large distances.
STOC 2007: 506-515 |
| 30 | EE | Dvir Falik,
Alex Samorodnitsky:
Edge-Isoperimetric Inequalities and Influences.
Combinatorics, Probability & Computing 16(5): 693-712 (2007) |
| 29 | EE | Michael Navon,
Alex Samorodnitsky:
Linear programming bounds for codes via a covering argument.
Electronic Colloquium on Computational Complexity (ECCC) 14(033): (2007) |
| 28 | EE | Shachar Lovett,
Roy Meshulam,
Alex Samorodnitsky:
Inverse Conjecture for the Gowers norm is false.
Electronic Colloquium on Computational Complexity (ECCC) 14(123): (2007) |
| 2006 |
|---|
| 27 | EE | Alex Samorodnitsky,
Luca Trevisan:
Gowers uniformity, influence of variables, and PCPs.
STOC 2006: 11-20 |
| 26 | EE | Alex Samorodnitsky:
Low-degree tests at large distances.
Electronic Colloquium on Computational Complexity (ECCC) 13(054): (2006) |
| 2005 |
|---|
| 25 | EE | Michael Navon,
Alex Samorodnitsky:
On Delsarte's Linear Programming Bounds for Binary Codes.
FOCS 2005: 327-338 |
| 24 | EE | Alex Samorodnitsky,
Luca Trevisan:
Gowers Uniformity, Influence of Variables, and PCPs
CoRR abs/math/0510264: (2005) |
| 23 | EE | Alexander I. Barvinok,
Alex Samorodnitsky:
Random Weighting, Asymptotic Counting, and Inverse Isoperimetry
Electronic Colloquium on Computational Complexity (ECCC)(065): (2005) |
| 22 | EE | Mickey Brautbar,
Alex Samorodnitsky:
Approximating the entropy of large alphabets
Electronic Colloquium on Computational Complexity (ECCC)(084): (2005) |
| 21 | EE | Alex Samorodnitsky,
Luca Trevisan:
Gowers Uniformity, Influence of Variables, and PCPs
Electronic Colloquium on Computational Complexity (ECCC)(116): (2005) |
| 20 | EE | Dvir Falik,
Alex Samorodnitsky:
Edge-isoperimetric inequalities and influences
Electronic Colloquium on Computational Complexity (ECCC)(163): (2005) |
| 2004 |
|---|
| 19 | EE | Michael E. Saks,
Alex Samorodnitsky,
Leonid Zosin:
A Lower Bound On The Integrality Gap For Minimum Multicut In Directed Networks.
Combinatorica 24(3): 525-530 (2004) |
| 18 | EE | Alex Samorodnitsky:
On Linear Programming Bounds for Spherical Codes and Designs.
Discrete & Computational Geometry 31(3): 385-394 (2004) |
| 17 | EE | Eldar Fischer,
Guy Kindler,
Dana Ron,
Shmuel Safra,
Alex Samorodnitsky:
Testing juntas.
J. Comput. Syst. Sci. 68(4): 753-787 (2004) |
| 2002 |
|---|
| 16 | EE | Eldar Fischer,
Guy Kindler,
Dana Ron,
Shmuel Safra,
Alex Samorodnitsky:
Testing Juntas.
FOCS 2002: 103-112 |
| 15 | EE | Eldar Fischer,
Eric Lehman,
Ilan Newman,
Sofya Raskhodnikova,
Ronitt Rubinfeld,
Alex Samorodnitsky:
Monotonicity testing over general poset domains.
STOC 2002: 474-483 |
| 14 | EE | Nathan Linial,
Alex Samorodnitsky:
Linear Codes and Character Sums.
Combinatorica 22(4): 497-522 (2002) |
| 13 | EE | Leonid Gurvits,
Alex Samorodnitsky:
A Deterministic Algorithm for Approximating the Mixed Discriminant and Mixed Volume, and a Combinatorial Corollary.
Discrete & Computational Geometry 27(4): 531-550 (2002) |
| 12 | EE | Michal Parnas,
Dana Ron,
Alex Samorodnitsky:
Testing Basic Boolean Formulae.
SIAM J. Discrete Math. 16(1): 20-46 (2002) |
| 2001 |
|---|
| 11 | EE | Michal Parnas,
Dana Ron,
Alex Samorodnitsky:
Proclaiming Dictators and Juntas or Testing Boolean Formulae.
RANDOM-APPROX 2001: 273-284 |
| 10 | EE | Michal Parnas,
Dana Ron,
Alex Samorodnitsky:
Proclaiming Dictators and Juntas or Testing Boolean Formulae
Electronic Colloquium on Computational Complexity (ECCC) 8(063): (2001) |
| 9 | EE | Alex Samorodnitsky:
On the Optimum of Delsarte's Linear Program.
J. Comb. Theory, Ser. A 96(2): 261-287 (2001) |
| 2000 |
|---|
| 8 | EE | Alex Samorodnitsky,
Luca Trevisan:
A PCP characterization of NP with optimal amortized query complexity.
STOC 2000: 191-199 |
| 7 | EE | Leonid Gurvits,
Alex Samorodnitsky:
A deterministic polynomial-time algorithm for approximating mixed discriminant and mixed volume.
STOC 2000: 48-57 |
| 6 | EE | Oded Goldreich,
Shafi Goldwasser,
Eric Lehman,
Dana Ron,
Alex Samorodnitsky:
Testing Monotonicity.
Combinatorica 20(3): 301-337 (2000) |
| 5 | EE | Nathan Linial,
Alex Samorodnitsky,
Avi Wigderson:
A Deterministic Strongly Polynomial Algorithm for Matrix Scaling and Approximate Permanents.
Combinatorica 20(4): 545-568 (2000) |
| 1999 |
|---|
| 4 | | Yevgeniy Dodis,
Oded Goldreich,
Eric Lehman,
Sofya Raskhodnikova,
Dana Ron,
Alex Samorodnitsky:
Improved Testing Algorithms for Monotonicity.
RANDOM-APPROX 1999: 97-108 |
| 3 | EE | Yevgeniy Dodis,
Oded Goldreich,
Eric Lehman,
Sofya Raskhodnikova,
Dana Ron,
Alex Samorodnitsky:
Improved Testing Algorithms for Monotonicity.
Electronic Colloquium on Computational Complexity (ECCC) 6(17): (1999) |
| 1998 |
|---|
| 2 | EE | Nathan Linial,
Alex Samorodnitsky,
Avi Wigderson:
A Deterministic Strongly Polynomial Algorithm for Matrix Scaling and Approximate Permanents.
STOC 1998: 644-652 |
| 1996 |
|---|
| 1 | | Jeff Kahn,
Nathan Linial,
Alex Samorodnitsky:
Inclusion-Exclusion: Exact and Approximate.
Combinatorica 16(4): 465-477 (1996) |
