Tali Kaufman

	2009
32		Elena Grigorescu, Tali Kaufman, Madhu Sudan: Succinct Representation of Codes with Applications to Testing. APPROX-RANDOM 2009: 534-547
31		Elena Grigorescu, Tali Kaufman, Madhu Sudan: Succinct Representation of Codes with Applications to Testing CoRR abs/0905.2919: (2009)
	2008
30		Tali Kaufman, Simon Litsyn, Ning Xie: Breaking the epsilon-Soundness Bound of the Linearity Test over GF(2). APPROX-RANDOM 2008: 498-511
29		Tali Kaufman, Shachar Lovett: Worst Case to Average Case Reductions for Polynomials. FOCS 2008: 166-175
28		Elena Grigorescu, Tali Kaufman, Madhu Sudan: 2-Transitivity Is Insufficient for Local Testability. IEEE Conference on Computational Complexity 2008: 259-267
27		Ido Ben-Eliezer, Tali Kaufman, Michael Krivelevich, Dana Ron: Comparing the strength of query types in property testing: the case of testing k-colorability. SODA 2008: 1213-1222
26		Shafi Goldwasser, Dan Gutfreund, Alexander Healy, Tali Kaufman, Guy N. Rothblum: A (de)constructive approach to program checking. STOC 2008: 143-152
25		Tali Kaufman, Madhu Sudan: Algebraic property testing: the role of invariance. STOC 2008: 403-412
24		Tali Kaufman, Shachar Lovett: The List-Decoding Size of Reed-Muller Codes CoRR abs/0811.2356: (2008)
23		Elena Grigorescu, Tali Kaufman, Madhu Sudan: 2-Transitivity is Insufficient for Local Testability. Electronic Colloquium on Computational Complexity (ECCC) 15(033): (2008)
22		Shachar Lovett, Tali Kaufman: Worst case to Average case reductions for polynomials. Electronic Colloquium on Computational Complexity (ECCC) 15(072): (2008)
21		Shachar Lovett, Tali Kaufman: The List-Decoding Size of Reed-Muller Codes. Electronic Colloquium on Computational Complexity (ECCC) 15(111): (2008)
20		Noga Alon, Tali Kaufman, Michael Krivelevich, Dana Ron: Testing Triangle-Freeness in General Graphs. SIAM J. Discrete Math. 22(2): 786-819 (2008)
	2007
19		Tali Kaufman, Madhu Sudan: Sparse Random Linear Codes are Locally Decodable and Testable. FOCS 2007: 590-600
18		Shafi Goldwasser, Dan Gutfreund, Alexander Healy, Tali Kaufman, Guy N. Rothblum: Verifying and decoding in constant depth. STOC 2007: 440-449
17		Noga Alon, Alexandr Andoni, Tali Kaufman, Kevin Matulef, Ronitt Rubinfeld, Ning Xie: Testing k-wise and almost k-wise independence. STOC 2007: 496-505
16		Noga Alon, Venkatesan Guruswami, Tali Kaufman, Madhu Sudan: Guessing secrets efficiently via list decoding. ACM Transactions on Algorithms 3(4): (2007)
15		Shafi Goldwasser, Dan Gutfreund, Alexander Healy, Tali Kaufman, Guy N. Rothblum: A (De)constructive Approach to Program Checking. Electronic Colloquium on Computational Complexity (ECCC) 14(047): (2007)
14		Tali Kaufman, Madhu Sudan: Sparse Random Linear Codes are Locally Decodable and Testable. Electronic Colloquium on Computational Complexity (ECCC) 14(060): (2007)
13		Tali Kaufman, Simon Litsyn, Ning Xie: Breaking the $\epsilon$-Soundness Bound of the Linearity Test over GF(2). Electronic Colloquium on Computational Complexity (ECCC) 14(098): (2007)
12		Tali Kaufman, Madhu Sudan: Algebraic Property Testing: The Role of Invariance. Electronic Colloquium on Computational Complexity (ECCC) 14(111): (2007)
	2006
11		Tali Kaufman, Simon Litsyn: Long Extended BCH Codes Are Spanned by Minimum Weight Words. AAECC 2006: 285-294
10		Noga Alon, Tali Kaufman, Michael Krivelevich, Dana Ron: Testing triangle-freeness in general graphs. SODA 2006: 279-288
9		Tali Kaufman, Dana Ron: Testing Polynomials over General Fields. SIAM J. Comput. 36(3): 779-802 (2006)
	2005
8		Tali Kaufman, Simon Litsyn: Almost Orthogonal Linear Codes are Locally Testable. FOCS 2005: 317-326
7		Noga Alon, Tali Kaufman, Michael Krivelevich, Simon Litsyn, Dana Ron: Testing Reed-Muller codes. IEEE Transactions on Information Theory 51(11): 4032-4039 (2005)
6		Tali Kaufman, Dana Ron: A characterization of low-weight words that span generalized reed-muller codes. IEEE Transactions on Information Theory 51(11): 4039-4043 (2005)
	2004
5		Tali Kaufman, Dana Ron: Testing Polynomials over General Fields. FOCS 2004: 413-422
4		Tali Kaufman, Michael Krivelevich, Dana Ron: Tight Bounds for Testing Bipartiteness in General Graphs. SIAM J. Comput. 33(6): 1441-1483 (2004)
	2003
3		Noga Alon, Tali Kaufman, Michael Krivelevich, Simon Litsyn, Dana Ron: Testing Low-Degree Polynomials over GF(2(. RANDOM-APPROX 2003: 188-199
2		Tali Kaufman, Michael Krivelevich, Dana Ron: Tight Bounds for Testing Bipartiteness in General Graphs. RANDOM-APPROX 2003: 341-353
	2002
1		Noga Alon, Venkatesan Guruswami, Tali Kaufman, Madhu Sudan: Guessing secrets efficiently via list decoding. SODA 2002: 254-262

Coauthor Index

1	Noga Alon	[1] [3] [7] [10] [16] [17] [20]
2	Alexandr Andoni	[17]
3	Ido Ben-Eliezer	[27]
4	Shafi Goldwasser	[15] [18] [26]
5	Elena Grigorescu	[23] [28] [31] [32]
6	Venkatesan Guruswami	[1] [16]
7	Dan Gutfreund (Danny Gutfreund)	[15] [18] [26]
8	Alexander Healy	[15] [18] [26]
9	Michael Krivelevich	[2] [3] [4] [7] [10] [20] [27]
10	Simon Litsyn	[3] [7] [8] [11] [13] [30]
11	Shachar Lovett	[21] [22] [24] [29]
12	Kevin Matulef	[17]
13	Dana Ron	[2] [3] [4] [5] [6] [7] [9] [10] [20] [27]
14	Guy N. Rothblum	[15] [18] [26]
15	Ronitt Rubinfeld	[17]
16	Madhu Sudan	[1] [12] [14] [16] [19] [23] [25] [28] [31] [32]
17	Ning Xie	[13] [17] [30]