The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Tali Kaufman: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. 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]
  2. Tali Kaufman, Simon Litsyn
    Almost Orthogonal Linear Codes are Locally Testable. [Citation Graph (0, 0)][DBLP]
    FOCS, 2005, pp:317-326 [Conf]
  3. Tali Kaufman, Dana Ron
    Testing Polynomials over General Fields. [Citation Graph (0, 0)][DBLP]
    FOCS, 2004, pp:413-422 [Conf]
  4. 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]
  5. 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]
  6. 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]
  7. 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]
  8. 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]
  9. 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]
  10. 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]
  11. 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]
  12. 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]
  13. 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]

  14. Breaking the epsilon-Soundness Bound of the Linearity Test over GF(2). [Citation Graph (, )][DBLP]


  15. Succinct Representation of Codes with Applications to Testing. [Citation Graph (, )][DBLP]


  16. Locally Testable vs. Locally Decodable Codes. [Citation Graph (, )][DBLP]


  17. 2-Transitivity Is Insufficient for Local Testability. [Citation Graph (, )][DBLP]


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


  19. Worst Case to Average Case Reductions for Polynomials. [Citation Graph (, )][DBLP]


  20. Sparse Random Linear Codes are Locally Decodable and Testable. [Citation Graph (, )][DBLP]


  21. Comparing the strength of query types in property testing: the case of testing k-colorability. [Citation Graph (, )][DBLP]


  22. Algebraic property testing: the role of invariance. [Citation Graph (, )][DBLP]


  23. A (de)constructive approach to program checking. [Citation Graph (, )][DBLP]


  24. Weight Distribution and List-Decoding Size of Reed-Muller Codes. [Citation Graph (, )][DBLP]


  25. Symmetric LDPC Codes and Local Testing. [Citation Graph (, )][DBLP]


  26. The List-Decoding Size of Reed-Muller Codes [Citation Graph (, )][DBLP]


  27. Succinct Representation of Codes with Applications to Testing [Citation Graph (, )][DBLP]


  28. The List-Decoding Size of Reed-Muller Codes. [Citation Graph (, )][DBLP]


  29. 2-Transitivity is Insufficient for Local Testability. [Citation Graph (, )][DBLP]


  30. Worst case to Average case reductions for polynomials. [Citation Graph (, )][DBLP]


  31. Sparse Random Linear Codes are Locally Decodable and Testable. [Citation Graph (, )][DBLP]


  32. Algebraic Property Testing: The Role of Invariance. [Citation Graph (, )][DBLP]


  33. A (De)constructive Approach to Program Checking. [Citation Graph (, )][DBLP]


  34. Breaking the $\epsilon$-Soundness Bound of the Linearity Test over GF(2). [Citation Graph (, )][DBLP]


Search in 0.004secs, Finished in 0.006secs
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