- CSB - MetaPress - Google - Bing - Yahoo
 | 2012 | |
|---|---|---|
| j20 |      | Alex Samorodnitsky, Sergey Yekhanin: A note on the Newton radius. Discrete Mathematics 312(15): 2392-2393 (2012) |
| j19 | | Dana Ron, Ronitt Rubinfeld, Muli Safra, Alex Samorodnitsky, Omri Weinstein: Approximating the Influence of Monotone Boolean Functions in O(√n) Query Complexity. TOCT 4(4): 11 (2012) |
| 2011 | ||
| j18 | | Alexander I. Barvinok, Alex Samorodnitsky: Computing the Partition Function for Perfect Matchings in a Hypergraph. Combinatorics, Probability & Computing 20(6): 815-835 (2011) |
| j17 | | Felix A. Fischer, Ariel D. Procaccia, Alex Samorodnitsky: A new perspective on implementation by voting trees. Random Struct. Algorithms 39(1): 59-82 (2011) |
| j16 | | Shachar Lovett, Roy Meshulam, Alex Samorodnitsky: Inverse Conjecture for the Gowers Norm is False. Theory of Computing 7(1): 131-145 (2011) |
| 2010 | ||
| j15 | | Alexander I. Barvinok, Zur Luria, Alex Samorodnitsky, Alexander Yong: An approximation algorithm for counting contingency tables. Random Struct. Algorithms 37(1): 25-66 (2010) |
| i11 | | Noa Eidelstein, Alex Samorodnitsky: Lower bounds for designs in symmetric spaces. Electronic Colloquium on Computational Complexity (ECCC) 17: 120 (2010) |
| 2009 | ||
| j14 | | Michael Navon, Alex Samorodnitsky: Linear Programming Bounds for Codes via a Covering Argument. Discrete & Computational Geometry 41(2): 199-207 (2009) |
| j13 | | Alex Samorodnitsky, Luca Trevisan: Gowers Uniformity, Influence of Variables, and PCPs. SIAM J. Comput. 39(1): 323-360 (2009) |
| c14 | | Adam Tauman Kalai, Alex Samorodnitsky, Shang-Hua Teng: Learning and Smoothed Analysis. FOCS 2009: 395-404 |
| c13 | | Felix A. Fischer, Ariel D. Procaccia, Alex Samorodnitsky: A new perspective on implementation by voting trees. ACM Conference on Electronic Commerce 2009: 31-40 |
| 2008 | ||
| j12 | | Alex Samorodnitsky: An upper bound for permanents of nonnegative matrices. J. Comb. Theory, Ser. A 115(2): 279-292 (2008) |
| c12 | | Shachar Lovett, Roy Meshulam, Alex Samorodnitsky: Inverse conjecture for the gowers norm is false. STOC 2008: 547-556 |
| 2007 | ||
| j11 | | Dvir Falik, Alex Samorodnitsky: Edge-Isoperimetric Inequalities and Influences. Combinatorics, Probability & Computing 16(5): 693-712 (2007) |
| c11 | | Mickey Brautbar, Alex Samorodnitsky: Approximating entropy from sublinear samples. SODA 2007: 366-375 |
| c10 | | |
| i10 | | Michael Navon, Alex Samorodnitsky: Linear programming bounds for codes via a covering argument. Electronic Colloquium on Computational Complexity (ECCC) 14(033) (2007) |
| i9 | | Shachar Lovett, Roy Meshulam, Alex Samorodnitsky: Inverse Conjecture for the Gowers norm is false. Electronic Colloquium on Computational Complexity (ECCC) 14(123) (2007) |
| 2006 | ||
| c9 | | Alex Samorodnitsky, Luca Trevisan: Gowers uniformity, influence of variables, and PCPs. STOC 2006: 11-20 |
| i8 | | Alex Samorodnitsky: Low-degree tests at large distances. Electronic Colloquium on Computational Complexity (ECCC) 13(054) (2006) |
| 2005 | ||
| c8 | | Michael Navon, Alex Samorodnitsky: On Delsarte's Linear Programming Bounds for Binary Codes. FOCS 2005: 327-338 |
| i7 | | Alex Samorodnitsky, Luca Trevisan: Gowers Uniformity, Influence of Variables, and PCPs. CoRR abs/math/0510264 (2005) |
| i6 | | Alexander I. Barvinok, Alex Samorodnitsky: Random Weighting, Asymptotic Counting, and Inverse Isoperimetry . Electronic Colloquium on Computational Complexity (ECCC)(065) (2005) |
| i5 | | Mickey Brautbar, Alex Samorodnitsky: Approximating the entropy of large alphabets. Electronic Colloquium on Computational Complexity (ECCC)(084) (2005) |
| i4 | | Alex Samorodnitsky, Luca Trevisan: Gowers Uniformity, Influence of Variables, and PCPs. Electronic Colloquium on Computational Complexity (ECCC)(116) (2005) |
| i3 | | Dvir Falik, Alex Samorodnitsky: Edge-isoperimetric inequalities and influences. Electronic Colloquium on Computational Complexity (ECCC)(163) (2005) |
| 2004 | ||
| j10 | | 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) |
| j9 | | Alex Samorodnitsky: On Linear Programming Bounds for Spherical Codes and Designs. Discrete & Computational Geometry 31(3): 385-394 (2004) |
| j8 | | Eldar Fischer, Guy Kindler, Dana Ron, Shmuel Safra, Alex Samorodnitsky: Testing juntas. J. Comput. Syst. Sci. 68(4): 753-787 (2004) |
| 2002 | ||
| j7 | | Nathan Linial, Alex Samorodnitsky: Linear Codes and Character Sums. Combinatorica 22(4): 497-522 (2002) |
| j6 | | 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) |
| j5 | | Michal Parnas, Dana Ron, Alex Samorodnitsky: Testing Basic Boolean Formulae. SIAM J. Discrete Math. 16(1): 20-46 (2002) |
| c7 | | Eldar Fischer, Guy Kindler, Dana Ron, Shmuel Safra, Alex Samorodnitsky: Testing Juntas. FOCS 2002: 103-112 |
| c6 | | Eldar Fischer, Eric Lehman, Ilan Newman, Sofya Raskhodnikova, Ronitt Rubinfeld, Alex Samorodnitsky: Monotonicity testing over general poset domains. STOC 2002: 474-483 |
| 2001 | ||
| j4 | | Alex Samorodnitsky: On the Optimum of Delsarte's Linear Program. J. Comb. Theory, Ser. A 96(2): 261-287 (2001) |
| c5 | | Michal Parnas, Dana Ron, Alex Samorodnitsky: Proclaiming Dictators and Juntas or Testing Boolean Formulae. RANDOM-APPROX 2001: 273-284 |
| i2 | | Michal Parnas, Dana Ron, Alex Samorodnitsky: Proclaiming Dictators and Juntas or Testing Boolean Formulae. Electronic Colloquium on Computational Complexity (ECCC) 8(063) (2001) |
| 2000 | ||
| j3 | | Oded Goldreich, Shafi Goldwasser, Eric Lehman, Dana Ron, Alex Samorodnitsky: Testing Monotonicity. Combinatorica 20(3): 301-337 (2000) |
| j2 | | Nathan Linial, Alex Samorodnitsky, Avi Wigderson: A Deterministic Strongly Polynomial Algorithm for Matrix Scaling and Approximate Permanents. Combinatorica 20(4): 545-568 (2000) |
| c4 | | Leonid Gurvits, Alex Samorodnitsky: A deterministic polynomial-time algorithm for approximating mixed discriminant and mixed volume. STOC 2000: 48-57 |
| c3 | | Alex Samorodnitsky, Luca Trevisan: A PCP characterization of NP with optimal amortized query complexity. STOC 2000: 191-199 |
| 1999 | ||
| c2 |  | Yevgeniy Dodis, Oded Goldreich, Eric Lehman, Sofya Raskhodnikova, Dana Ron, Alex Samorodnitsky: Improved Testing Algorithms for Monotonicity. RANDOM-APPROX 1999: 97-108 |
| i1 | | 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 | ||
| c1 | | Nathan Linial, Alex Samorodnitsky, Avi Wigderson: A Deterministic Strongly Polynomial Algorithm for Matrix Scaling and Approximate Permanents. STOC 1998: 644-652 |
| 1996 | ||
| j1 | | Jeff Kahn, Nathan Linial, Alex Samorodnitsky: Inclusion-Exclusion: Exact and Approximate. Combinatorica 16(4): 465-477 (1996) |
Colors in the list of coauthors
Last update Thu May 23 14:37:23 2013 CET by the DBLP Team —
Data released under the ODC-BY 1.0 license — See also our legal information page