The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Alex Samorodnitsky: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Eldar Fischer, Guy Kindler, Dana Ron, Shmuel Safra, Alex Samorodnitsky
    Testing Juntas. [Citation Graph (0, 0)][DBLP]
    FOCS, 2002, pp:103-112 [Conf]
  2. Michael Navon, Alex Samorodnitsky
    On Delsarte's Linear Programming Bounds for Binary Codes. [Citation Graph (0, 0)][DBLP]
    FOCS, 2005, pp:327-338 [Conf]
  3. Michal Parnas, Dana Ron, Alex Samorodnitsky
    Proclaiming Dictators and Juntas or Testing Boolean Formulae. [Citation Graph (0, 0)][DBLP]
    RANDOM-APPROX, 2001, pp:273-284 [Conf]
  4. Yevgeniy Dodis, Oded Goldreich, Eric Lehman, Sofya Raskhodnikova, Dana Ron, Alex Samorodnitsky
    Improved Testing Algorithms for Monotonicity. [Citation Graph (0, 0)][DBLP]
    RANDOM-APPROX, 1999, pp:97-108 [Conf]
  5. Eldar Fischer, Eric Lehman, Ilan Newman, Sofya Raskhodnikova, Ronitt Rubinfeld, Alex Samorodnitsky
    Monotonicity testing over general poset domains. [Citation Graph (0, 0)][DBLP]
    STOC, 2002, pp:474-483 [Conf]
  6. Leonid Gurvits, Alex Samorodnitsky
    A deterministic polynomial-time algorithm for approximating mixed discriminant and mixed volume. [Citation Graph (0, 0)][DBLP]
    STOC, 2000, pp:48-57 [Conf]
  7. Nathan Linial, Alex Samorodnitsky, Avi Wigderson
    A Deterministic Strongly Polynomial Algorithm for Matrix Scaling and Approximate Permanents. [Citation Graph (0, 0)][DBLP]
    STOC, 1998, pp:644-652 [Conf]
  8. Alex Samorodnitsky, Luca Trevisan
    A PCP characterization of NP with optimal amortized query complexity. [Citation Graph (0, 0)][DBLP]
    STOC, 2000, pp:191-199 [Conf]
  9. Alex Samorodnitsky, Luca Trevisan
    Gowers uniformity, influence of variables, and PCPs. [Citation Graph (0, 0)][DBLP]
    STOC, 2006, pp:11-20 [Conf]
  10. Oded Goldreich, Shafi Goldwasser, Eric Lehman, Dana Ron, Alex Samorodnitsky
    Testing Monotonicity. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 2000, v:20, n:3, pp:301-337 [Journal]
  11. Jeff Kahn, Nathan Linial, Alex Samorodnitsky
    Inclusion-Exclusion: Exact and Approximate. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 1996, v:16, n:4, pp:465-477 [Journal]
  12. Nathan Linial, Alex Samorodnitsky
    Linear Codes and Character Sums. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 2002, v:22, n:4, pp:497-522 [Journal]
  13. Nathan Linial, Alex Samorodnitsky, Avi Wigderson
    A Deterministic Strongly Polynomial Algorithm for Matrix Scaling and Approximate Permanents. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 2000, v:20, n:4, pp:545-568 [Journal]
  14. Michael E. Saks, Alex Samorodnitsky, Leonid Zosin
    A Lower Bound On The Integrality Gap For Minimum Multicut In Directed Networks. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 2004, v:24, n:3, pp:525-530 [Journal]
  15. Leonid Gurvits, Alex Samorodnitsky
    A Deterministic Algorithm for Approximating the Mixed Discriminant and Mixed Volume, and a Combinatorial Corollary. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 2002, v:27, n:4, pp:531-550 [Journal]
  16. Alex Samorodnitsky
    On Linear Programming Bounds for Spherical Codes and Designs. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 2004, v:31, n:3, pp:385-394 [Journal]
  17. Michal Parnas, Dana Ron, Alex Samorodnitsky
    Proclaiming Dictators and Juntas or Testing Boolean Formulae [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 2001, v:8, n:063, pp:- [Journal]
  18. Alexander I. Barvinok, Alex Samorodnitsky
    Random Weighting, Asymptotic Counting, and Inverse Isoperimetry [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 2005, v:, n:065, pp:- [Journal]
  19. Mickey Brautbar, Alex Samorodnitsky
    Approximating the entropy of large alphabets [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 2005, v:, n:084, pp:- [Journal]
  20. Alex Samorodnitsky, Luca Trevisan
    Gowers Uniformity, Influence of Variables, and PCPs [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 2005, v:, n:116, pp:- [Journal]
  21. Dvir Falik, Alex Samorodnitsky
    Edge-isoperimetric inequalities and influences [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 2005, v:, n:163, pp:- [Journal]
  22. Yevgeniy Dodis, Oded Goldreich, Eric Lehman, Sofya Raskhodnikova, Dana Ron, Alex Samorodnitsky
    Improved Testing Algorithms for Monotonicity. [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 1999, v:6, n:17, pp:- [Journal]
  23. Eldar Fischer, Guy Kindler, Dana Ron, Shmuel Safra, Alex Samorodnitsky
    Testing juntas. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 2004, v:68, n:4, pp:753-787 [Journal]
  24. Alex Samorodnitsky
    On the Optimum of Delsarte's Linear Program. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 2001, v:96, n:2, pp:261-287 [Journal]
  25. Michal Parnas, Dana Ron, Alex Samorodnitsky
    Testing Basic Boolean Formulae. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 2002, v:16, n:1, pp:20-46 [Journal]
  26. Mickey Brautbar, Alex Samorodnitsky
    Approximating entropy from sublinear samples. [Citation Graph (0, 0)][DBLP]
    SODA, 2007, pp:366-375 [Conf]
  27. Alex Samorodnitsky
    Low-degree tests at large distances. [Citation Graph (0, 0)][DBLP]
    STOC, 2007, pp:506-515 [Conf]

  28. Learning and Smoothed Analysis. [Citation Graph (, )][DBLP]


  29. A new perspective on implementation by voting trees. [Citation Graph (, )][DBLP]


  30. Inverse conjecture for the gowers norm is false. [Citation Graph (, )][DBLP]


  31. Gowers Uniformity, Influence of Variables, and PCPs [Citation Graph (, )][DBLP]


  32. Edge-Isoperimetric Inequalities and Influences. [Citation Graph (, )][DBLP]


  33. Linear Programming Bounds for Codes via a Covering Argument. [Citation Graph (, )][DBLP]


  34. Linear programming bounds for codes via a covering argument. [Citation Graph (, )][DBLP]


  35. Inverse Conjecture for the Gowers norm is false. [Citation Graph (, )][DBLP]


  36. Low-degree tests at large distances. [Citation Graph (, )][DBLP]


Search in 0.025secs, Finished in 0.027secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002