Eli Ben-Sasson

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

Coauthor Index

1	Michael Alekhnovich	[1] [7] [8] [9] [13] [26] [27] [31]
2	Mikhail Alekhnovich	[43]
3	Yonatan Bilu	[14]
4	Nicola Galesi	[11] [12] [19]
5	Oded Goldreich	[20] [25] [30] [34] [38] [39]
6	Prahladh Harsha	[21] [22] [24] [30] [34] [36] [38] [39] [44] [46]
7	Russell Impagliazzo	[5] [6] [32]
8	Adam Tauman Kalai (Adam Kalai)	[41]
9	Ehud Kalai	[41]
10	Swastik Kopparty	[42]
11	Oded Lachish	[44] [46]
12	Arie Matsliah	[44] [46]
13	Jakob Nordström	[47]
14	Jaikumar Radhakrishnan	[42]
15	Sofya Raskhodnikova	[21] [24] [36]
16	Alexander A. Razborov	[1] [7] [8] [9] [13] [27]
17	Madhu Sudan	[20] [23] [25] [28] [29] [30] [33] [34] [35] [37] [38] [39] [40] [45]
18	Salil P. Vadhan	[23] [30] [34] [38] [39]
19	Michael Viderman	[48]
20	Avi Wigderson	[1] [2] [3] [4] [6] [7] [8] [9] [10] [13] [23] [27] [32]

Colors in the list of coauthors