The SCEAS System
Navigation Menu
Introduction
Collection Based
Clustering
Ranking
Paper Based
Journals
Conferences
DB Status
Statistics
Search

Search the dblp DataBase

Title:
Author:
Eli Ben-Sasson: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Eli Ben-Sasson, Madhu Sudan
    Robust Locally Testable Codes and Products of Codes. [Citation Graph (0, 0)][DBLP]
    APPROX-RANDOM, 2004, pp:286-297 [Conf]
  2. Eli Ben-Sasson
    Hard Examples for Bounded Depth Frege. [Citation Graph (0, 0)][DBLP]
    IEEE Conference on Computational Complexity, 2002, pp:4- [Conf]
  3. Eli Ben-Sasson, Nicola Galesi
    Space Complexity of Random Formulae in Resolution. [Citation Graph (0, 0)][DBLP]
    IEEE Conference on Computational Complexity, 2001, pp:42-51 [Conf]
  4. Eli Ben-Sasson, Oded Goldreich, Prahladh Harsha, Madhu Sudan, Salil P. Vadhan
    Short PCPs Verifiable in Polylogarithmic Time. [Citation Graph (0, 0)][DBLP]
    IEEE Conference on Computational Complexity, 2005, pp:120-134 [Conf]
  5. Eli Ben-Sasson, Avi Wigderson
    Short Proofs Are Narrow - Resolution Made Simple (Abstract). [Citation Graph (0, 0)][DBLP]
    IEEE Conference on Computational Complexity, 1999, pp:2- [Conf]
  6. Michael Alekhnovich, Eli Ben-Sasson
    Linear Upper Bounds for Random Walk on Small Density Random 3-CNF. [Citation Graph (0, 0)][DBLP]
    FOCS, 2003, pp:352-361 [Conf]
  7. Michael Alekhnovich, Eli Ben-Sasson, Alexander A. Razborov, Avi Wigderson
    Pseudorandom Generators in Propositional Proof Complexity. [Citation Graph (0, 0)][DBLP]
    FOCS, 2000, pp:43-53 [Conf]
  8. Eli Ben-Sasson, Russell Impagliazzo
    Random CNF's are Hard for the Polynomial Calculus. [Citation Graph (0, 0)][DBLP]
    FOCS, 1999, pp:415-421 [Conf]
  9. Eli Ben-Sasson, Swastik Kopparty, Jaikumar Radhakrishnan
    Subspace Polynomials and List Decoding of Reed-Solomon Codes. [Citation Graph (0, 0)][DBLP]
    FOCS, 2006, pp:207-216 [Conf]
  10. Eli Ben-Sasson, Oded Goldreich, Madhu Sudan
    Bounds on 2-Query Codeword Testing. [Citation Graph (0, 0)][DBLP]
    RANDOM-APPROX, 2003, pp:216-227 [Conf]
  11. Michael Alekhnovich, Eli Ben-Sasson, Alexander A. Razborov, Avi Wigderson
    Space complexity in propositional calculus. [Citation Graph (0, 0)][DBLP]
    STOC, 2000, pp:358-367 [Conf]
  12. Eli Ben-Sasson
    Size space tradeoffs for resolution. [Citation Graph (0, 0)][DBLP]
    STOC, 2002, pp:457-464 [Conf]
  13. Eli Ben-Sasson
    Hard examples for bounded depth frege. [Citation Graph (0, 0)][DBLP]
    STOC, 2002, pp:563-572 [Conf]
  14. Eli Ben-Sasson, Oded Goldreich, Prahladh Harsha, Madhu Sudan, Salil P. Vadhan
    Robust pcps of proximity, shorter pcps and applications to coding. [Citation Graph (0, 0)][DBLP]
    STOC, 2004, pp:1-10 [Conf]
  15. Eli Ben-Sasson, Prahladh Harsha, Sofya Raskhodnikova
    Some 3CNF properties are hard to test. [Citation Graph (0, 0)][DBLP]
    STOC, 2003, pp:345-354 [Conf]
  16. Eli Ben-Sasson, Madhu Sudan
    Simple PCPs with poly-log rate and query complexity. [Citation Graph (0, 0)][DBLP]
    STOC, 2005, pp:266-275 [Conf]
  17. Eli Ben-Sasson, Madhu Sudan, Salil P. Vadhan, Avi Wigderson
    Randomness-efficient low degree tests and short PCPs via epsilon-biased sets. [Citation Graph (0, 0)][DBLP]
    STOC, 2003, pp:612-621 [Conf]
  18. Eli Ben-Sasson, Avi Wigderson
    Short Proofs are Narrow - Resolution Made Simple. [Citation Graph (0, 0)][DBLP]
    STOC, 1999, pp:517-526 [Conf]
  19. Eli Ben-Sasson
    Hard examples for the bounded depth Frege proof system. [Citation Graph (0, 0)][DBLP]
    Computational Complexity, 2002, v:11, n:3-4, pp:109-136 [Journal]
  20. Eli Ben-Sasson, Russell Impagliazzo, Avi Wigderson
    Near Optimal Separation Of Tree-Like And General Resolution. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 2004, v:24, n:4, pp:585-603 [Journal]
  21. Eli Ben-Sasson, Madhu Sudan
    Robust Locally Testable Codes and Products of Codes [Citation Graph (0, 0)][DBLP]
    CoRR, 2004, v:0, n:, pp:- [Journal]
  22. Eli Ben-Sasson, Russell Impagliazzo, Avi Wigderson
    Near-Optimal Separation of Treelike and General Resolution [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 2000, v:7, n:5, pp:- [Journal]
  23. Michael Alekhnovich, Eli Ben-Sasson, Alexander A. Razborov, Avi Wigderson
    Pseudorandom Generators in Propositional Proof Complexity [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 2000, v:7, n:23, pp:- [Journal]
  24. Eli Ben-Sasson, Nicola Galesi
    Space Complexity of Random Formulae in Resolution [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 2001, v:8, n:31, pp:- [Journal]
  25. Eli Ben-Sasson, Yonatan Bilu
    A Gap in Average Proof Complexity [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 2002, v:, n:003, pp:- [Journal]
  26. Eli Ben-Sasson, Prahladh Harsha
    Lower Bounds for Bounded-Depth Frege Proofs via Buss-Pudlack Games [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 2003, v:10, n:004, pp:- [Journal]
  27. Eli Ben-Sasson, Prahladh Harsha, Sofya Raskhodnikova
    3CNF Properties are Hard to Test [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 2003, v:10, n:006, pp:- [Journal]
  28. Eli Ben-Sasson, Oded Goldreich, Madhu Sudan
    Bounds on 2-Query Codeword Testing. [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 2003, v:10, n:019, pp:- [Journal]
  29. Michael Alekhnovich, Eli Ben-Sasson
    Linear Upper Bounds for Random Walk on Small Density Random 3CNFs [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 2004, v:, n:016, pp:- [Journal]
  30. Eli Ben-Sasson, Oded Goldreich, Prahladh Harsha, Madhu Sudan, Salil P. Vadhan
    Robust PCPs of Proximity, Shorter PCPs and Applications to Coding [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 2004, v:, n:021, pp:- [Journal]
  31. Eli Ben-Sasson, Madhu Sudan
    Robust Locally Testable Codes and Products of Codes [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 2004, v:, n:046, pp:- [Journal]
  32. Eli Ben-Sasson, Madhu Sudan
    Simple PCPs with Poly-log Rate and Query Complexity [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 2004, v:, n:060, pp:- [Journal]
  33. Michael Alekhnovich, Eli Ben-Sasson, Alexander A. Razborov, Avi Wigderson
    Space Complexity in Propositional Calculus [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 1999, v:, n:40, pp:- [Journal]
  34. Eli Ben-Sasson, Avi Wigderson
    Short proofs are narrow - resolution made simple. [Citation Graph (0, 0)][DBLP]
    J. ACM, 2001, v:48, n:2, pp:149-169 [Journal]
  35. Eli Ben-Sasson, Nicola Galesi
    Space complexity of random formulae in resolution. [Citation Graph (0, 0)][DBLP]
    Random Struct. Algorithms, 2003, v:23, n:1, pp:92-109 [Journal]
  36. Eli Ben-Sasson, Madhu Sudan
    Robust locally testable codes and products of codes. [Citation Graph (0, 0)][DBLP]
    Random Struct. Algorithms, 2006, v:28, n:4, pp:387-402 [Journal]
  37. Michael Alekhnovich, Eli Ben-Sasson, Alexander A. Razborov, Avi Wigderson
    Space Complexity in Propositional Calculus. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2002, v:31, n:4, pp:1184-1211 [Journal]
  38. Michael Alekhnovich, Eli Ben-Sasson, Alexander A. Razborov, Avi Wigderson
    Pseudorandom Generators in Propositional Proof Complexity. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2004, v:34, n:1, pp:67-88 [Journal]
  39. Eli Ben-Sasson, Prahladh Harsha, Sofya Raskhodnikova
    Some 3CNF Properties Are Hard to Test. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2005, v:35, n:1, pp:1-21 [Journal]
  40. Eli Ben-Sasson, Oded Goldreich, Prahladh Harsha, Madhu Sudan, Salil P. Vadhan
    Robust PCPs of Proximity, Shorter PCPs, and Applications to Coding. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2006, v:36, n:4, pp:889-974 [Journal]
  41. Mikhail Alekhnovich, Eli Ben-Sasson
    Linear Upper Bounds for Random Walk on Small Density Random 3-CNFs. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2007, v:36, n:5, pp:1248-1263 [Journal]
  42. Eli Ben-Sasson, Adam Tauman Kalai, Ehud Kalai
    An Approach to Bounded Rationality. [Citation Graph (0, 0)][DBLP]
    NIPS, 2006, pp:145-152 [Conf]

  43. Tensor Products of Weakly Smooth Codes Are Robust. [Citation Graph (, )][DBLP]


  44. Composition of Semi-LTCs by Two-Wise Tensor Products. [Citation Graph (, )][DBLP]


  45. Low Rate Is Insufficient for Local Testability. [Citation Graph (, )][DBLP]


  46. Locally Testable Codes Require Redundant Testers. [Citation Graph (, )][DBLP]


  47. Short Proofs May Be Spacious: An Optimal Separation of Space and Length in Resolution. [Citation Graph (, )][DBLP]


  48. Sound 3-Query PCPPs Are Long. [Citation Graph (, )][DBLP]


  49. Lower Bounds for Width-Restricted Clause Learning on Small Width Formulas. [Citation Graph (, )][DBLP]


  50. Affine dispersers from subspace polynomials. [Citation Graph (, )][DBLP]


  51. Understanding Space in Proof Complexity: Separations and Trade-offs via Substitutions [Citation Graph (, )][DBLP]


  52. Sound 3-query PCPPs are Long. [Citation Graph (, )][DBLP]


Search in 0.050secs, Finished in 0.052secs
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
 
Introduction Collection Based Clustering Ranking Paper Based Journals Conferences DB Status Statistics Search
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002