The SCEAS System
| |||||||

## Search the dblp DataBase
Tali Kaufman:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
## Publications of Author- Tali Kaufman, Simon Litsyn
**Long Extended BCH Codes Are Spanned by Minimum Weight Words.**[Citation Graph (0, 0)][DBLP] AAECC, 2006, pp:285-294 [Conf] - Tali Kaufman, Simon Litsyn
**Almost Orthogonal Linear Codes are Locally Testable.**[Citation Graph (0, 0)][DBLP] FOCS, 2005, pp:317-326 [Conf] - Tali Kaufman, Dana Ron
**Testing Polynomials over General Fields.**[Citation Graph (0, 0)][DBLP] FOCS, 2004, pp:413-422 [Conf] - Noga Alon, Tali Kaufman, Michael Krivelevich, Simon Litsyn, Dana Ron
**Testing Low-Degree Polynomials over GF(2(.**[Citation Graph (0, 0)][DBLP] RANDOM-APPROX, 2003, pp:188-199 [Conf] - Tali Kaufman, Michael Krivelevich, Dana Ron
**Tight Bounds for Testing Bipartiteness in General Graphs.**[Citation Graph (0, 0)][DBLP] RANDOM-APPROX, 2003, pp:341-353 [Conf] - Noga Alon, Venkatesan Guruswami, Tali Kaufman, Madhu Sudan
**Guessing secrets efficiently via list decoding.**[Citation Graph (0, 0)][DBLP] SODA, 2002, pp:254-262 [Conf] - Noga Alon, Tali Kaufman, Michael Krivelevich, Dana Ron
**Testing triangle-freeness in general graphs.**[Citation Graph (0, 0)][DBLP] SODA, 2006, pp:279-288 [Conf] - Tali Kaufman, Michael Krivelevich, Dana Ron
**Tight Bounds for Testing Bipartiteness in General Graphs.**[Citation Graph (0, 0)][DBLP] SIAM J. Comput., 2004, v:33, n:6, pp:1441-1483 [Journal] - Tali Kaufman, Dana Ron
**Testing Polynomials over General Fields.**[Citation Graph (0, 0)][DBLP] SIAM J. Comput., 2006, v:36, n:3, pp:779-802 [Journal] - Noga Alon, Tali Kaufman, Michael Krivelevich, Simon Litsyn, Dana Ron
**Testing Reed-Muller codes.**[Citation Graph (0, 0)][DBLP] IEEE Transactions on Information Theory, 2005, v:51, n:11, pp:4032-4039 [Journal] - Tali Kaufman, Dana Ron
**A characterization of low-weight words that span generalized reed-muller codes.**[Citation Graph (0, 0)][DBLP] IEEE Transactions on Information Theory, 2005, v:51, n:11, pp:4039-4043 [Journal] - Noga Alon, Alexandr Andoni, Tali Kaufman, Kevin Matulef, Ronitt Rubinfeld, Ning Xie
**Testing k-wise and almost k-wise independence.**[Citation Graph (0, 0)][DBLP] STOC, 2007, pp:496-505 [Conf] - Shafi Goldwasser, Dan Gutfreund, Alexander Healy, Tali Kaufman, Guy N. Rothblum
**Verifying and decoding in constant depth.**[Citation Graph (0, 0)][DBLP] STOC, 2007, pp:440-449 [Conf] **Breaking the epsilon-Soundness Bound of the Linearity Test over GF(2).**[Citation Graph (, )][DBLP]**Succinct Representation of Codes with Applications to Testing.**[Citation Graph (, )][DBLP]**Locally Testable vs. Locally Decodable Codes.**[Citation Graph (, )][DBLP]**2-Transitivity Is Insufficient for Local Testability.**[Citation Graph (, )][DBLP]**Locally Testable Codes Require Redundant Testers.**[Citation Graph (, )][DBLP]**Worst Case to Average Case Reductions for Polynomials.**[Citation Graph (, )][DBLP]**Sparse Random Linear Codes are Locally Decodable and Testable.**[Citation Graph (, )][DBLP]**Comparing the strength of query types in property testing: the case of testing**[Citation Graph (, )][DBLP]*k*-colorability.**Algebraic property testing: the role of invariance.**[Citation Graph (, )][DBLP]**A (de)constructive approach to program checking.**[Citation Graph (, )][DBLP]**Weight Distribution and List-Decoding Size of Reed-Muller Codes.**[Citation Graph (, )][DBLP]**Symmetric LDPC Codes and Local Testing.**[Citation Graph (, )][DBLP]**The List-Decoding Size of Reed-Muller Codes**[Citation Graph (, )][DBLP]**Succinct Representation of Codes with Applications to Testing**[Citation Graph (, )][DBLP]**The List-Decoding Size of Reed-Muller Codes.**[Citation Graph (, )][DBLP]**2-Transitivity is Insufficient for Local Testability.**[Citation Graph (, )][DBLP]**Worst case to Average case reductions for polynomials.**[Citation Graph (, )][DBLP]**Sparse Random Linear Codes are Locally Decodable and Testable.**[Citation Graph (, )][DBLP]**Algebraic Property Testing: The Role of Invariance.**[Citation Graph (, )][DBLP]**A (De)constructive Approach to Program Checking.**[Citation Graph (, )][DBLP]**Breaking the $\epsilon$-Soundness Bound of the Linearity Test over GF(2).**[Citation Graph (, )][DBLP]
Search in 0.004secs, Finished in 0.005secs | |||||||

| |||||||

| |||||||

System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002 for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002 |