| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | Tali Kaufman, Shachar Lovett, Ely Porat |
Weight Distribution and List-Decoding Size of Reed-Muller Codes.  |
IEEE Transactions on Information Theory  |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Elena Grigorescu, Tali Kaufman |
Explicit Low-Weight Bases for BCH Codes. |
IEEE Transactions on Information Theory |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Tali Kaufman, Alexander Lubotzky |
Edge transitive ramanujan graphs and symmetric LDPC good codes. |
STOC |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Irit Dinur, Tali Kaufman |
Dense locally testable codes cannot have constant rate and distance. |
Electronic Colloquium on Computational Complexity (ECCC) |
2011 |
DBLP BibTeX RDF |
|
| 1 | Tali Kaufman, Alexander Lubotzky |
Edge Transitive Ramanujan Graphs and Highly Symmetric LDPC Good Codes |
CoRR |
2011 |
DBLP BibTeX RDF |
|
| 1 | Oded Goldreich, Tali Kaufman |
Proximity Oblivious Testing and the Role of Invariances. |
Studies in Complexity and Cryptography |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Irit Dinur, Tali Kaufman |
Dense Locally Testable Codes Cannot Have Constant Rate and Distance. |
APPROX-RANDOM |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Oded Goldreich, Tali Kaufman |
Proximity Oblivious Testing and the Role of Invariances. |
APPROX-RANDOM |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Tali Kaufman, Shachar Lovett |
New Extension of the Weil Bound for Character Sums with Applications to Coding. |
FOCS |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Tali Kaufman, Michael Viderman |
Locally Testable vs. Locally Decodable Codes. |
Electronic Colloquium on Computational Complexity (ECCC) |
2010 |
DBLP BibTeX RDF |
|
| 1 | Oded Goldreich, Tali Kaufman |
Proximity Oblivious Testing and the Role of Invariances. |
Electronic Colloquium on Computational Complexity (ECCC) |
2010 |
DBLP BibTeX RDF |
|
| 1 | Tali Kaufman, Shachar Lovett |
Testing of exponentially large codes, by a new extension to Weil bound for character sums. |
Electronic Colloquium on Computational Complexity (ECCC) |
2010 |
DBLP BibTeX RDF |
|
| 1 | Irit Dinur, Tali Kaufman |
Dense locally testable codes cannot have constant rate and distance |
CoRR |
2010 |
DBLP BibTeX RDF |
|
| 1 | Eli Ben-Sasson, Venkatesan Guruswami, Tali Kaufman, Madhu Sudan, Michael Viderman |
Locally Testable Codes Require Redundant Testers. |
SIAM J. Comput. |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Tali Kaufman, Simon Litsyn, Ning Xie |
Breaking the Epsilon-Soundness Bound of the Linearity Test over GF(2). |
SIAM J. Comput. |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Ido Ben-Eliezer, Tali Kaufman, Michael Krivelevich, Dana Ron |
Comparing the Strength of Query Types in Property Testing: The Case of Testing k-Colorability. |
Property Testing |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Tali Kaufman, Avi Wigderson |
Symmetric LDPC Codes and Local Testing. |
Property Testing |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Tali Kaufman, Michael Viderman |
Locally Testable vs. Locally Decodable Codes. |
APPROX-RANDOM |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Tali Kaufman, Avi Wigderson |
Symmetric LDPC Codes and Local Testing. |
ICS |
2010 |
DBLP BibTeX RDF |
|
| 1 | Tali Kaufman, Shachar Lovett, Ely Porat |
Weight Distribution and List-Decoding Size of Reed-Muller Codes. |
ICS |
2010 |
DBLP BibTeX RDF |
|
| 1 | Elena Grigorescu, Tali Kaufman, Madhu Sudan |
Succinct Representation of Codes with Applications to Testing. |
Electronic Colloquium on Computational Complexity (ECCC) |
2009 |
DBLP BibTeX RDF |
|
| 1 | Eli Ben-Sasson, Venkatesan Guruswami, Tali Kaufman, Madhu Sudan, Michael Viderman |
Locally Testable Codes Require Redundant Testers. |
Electronic Colloquium on Computational Complexity (ECCC) |
2009 |
DBLP BibTeX RDF |
|
| 1 | Elena Grigorescu, Tali Kaufman, Madhu Sudan |
Succinct Representation of Codes with Applications to Testing |
CoRR |
2009 |
DBLP BibTeX RDF |
|
| 1 | Elena Grigorescu, Tali Kaufman, Madhu Sudan |
Succinct Representation of Codes with Applications to Testing. |
APPROX-RANDOM |
2009 |
DBLP DOI BibTeX RDF |
affine/cyclic invariance, single orbit, Locally testable codes |
| 1 | Eli Ben-Sasson, Venkatesan Guruswami, Tali Kaufman, Madhu Sudan, Michael Viderman |
Locally Testable Codes Require Redundant Testers. |
IEEE Conference on Computational Complexity |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Shachar Lovett, Tali Kaufman |
Worst case to Average case reductions for polynomials. |
Electronic Colloquium on Computational Complexity (ECCC) |
2008 |
DBLP BibTeX RDF |
|
| 1 | Elena Grigorescu, Tali Kaufman, Madhu Sudan |
2-Transitivity is Insufficient for Local Testability. |
Electronic Colloquium on Computational Complexity (ECCC) |
2008 |
DBLP BibTeX RDF |
|
| 1 | Shachar Lovett, Tali Kaufman |
The List-Decoding Size of Reed-Muller Codes. |
Electronic Colloquium on Computational Complexity (ECCC) |
2008 |
DBLP BibTeX RDF |
|
| 1 | Tali Kaufman, Shachar Lovett |
The List-Decoding Size of Reed-Muller Codes |
CoRR |
2008 |
DBLP BibTeX RDF |
|
| 1 | Noga Alon, Tali Kaufman, Michael Krivelevich, Dana Ron |
Testing Triangle-Freeness in General Graphs. |
SIAM J. Discrete Math. |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | 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 |
DBLP DOI BibTeX RDF |
|
| 1 | Tali Kaufman, Simon Litsyn, Ning Xie |
Breaking the epsilon-Soundness Bound of the Linearity Test over GF(2). |
APPROX-RANDOM |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Tali Kaufman, Shachar Lovett |
Worst Case to Average Case Reductions for Polynomials. |
FOCS |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Elena Grigorescu, Tali Kaufman, Madhu Sudan |
2-Transitivity Is Insufficient for Local Testability. |
IEEE Conference on Computational Complexity |
2008 |
DBLP DOI BibTeX RDF |
error correcting codes, property testing, sublinear time algorithms |
| 1 | Tali Kaufman, Madhu Sudan |
Algebraic property testing: the role of invariance. |
STOC |
2008 |
DBLP DOI BibTeX RDF |
error-correcting codes, locally testable codes, sublinear time algorithms |
| 1 | Shafi Goldwasser, Dan Gutfreund, Alexander Healy, Tali Kaufman, Guy N. Rothblum |
A (de)constructive approach to program checking. |
STOC |
2008 |
DBLP DOI BibTeX RDF |
program testing, program correcting, program checking |
| 1 | Shafi Goldwasser, Dan Gutfreund, Alexander Healy, Tali Kaufman, Guy N. Rothblum |
A (De)constructive Approach to Program Checking. |
Electronic Colloquium on Computational Complexity (ECCC) |
2007 |
DBLP BibTeX RDF |
|
| 1 | Tali Kaufman, Madhu Sudan |
Algebraic Property Testing: The Role of Invariance. |
Electronic Colloquium on Computational Complexity (ECCC) |
2007 |
DBLP BibTeX RDF |
|
| 1 | Tali Kaufman, Madhu Sudan |
Sparse Random Linear Codes are Locally Decodable and Testable. |
Electronic Colloquium on Computational Complexity (ECCC) |
2007 |
DBLP BibTeX RDF |
|
| 1 | Tali Kaufman, Simon Litsyn, Ning Xie |
Breaking the $\epsilon$-Soundness Bound of the Linearity Test over GF(2). |
Electronic Colloquium on Computational Complexity (ECCC) |
2007 |
DBLP BibTeX RDF |
|
| 1 | Noga Alon, Venkatesan Guruswami, Tali Kaufman, Madhu Sudan |
Guessing secrets efficiently via list decoding. |
ACM Transactions on Algorithms |
2007 |
DBLP DOI BibTeX RDF |
?-biased spaces, 20 questions, k-universal sets, error-correcting codes, decoding algorithms |
| 1 | Tali Kaufman, Madhu Sudan |
Sparse Random Linear Codes are Locally Decodable and Testable. |
FOCS |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Noga Alon, Alexandr Andoni, Tali Kaufman, Kevin Matulef, Ronitt Rubinfeld, Ning Xie |
Testing k-wise and almost k-wise independence. |
STOC |
2007 |
DBLP DOI BibTeX RDF |
almost k-wise independence, hidden clique, property testing, Fourier analysis, k-wise independence |
| 1 | Shafi Goldwasser, Dan Gutfreund, Alexander Healy, Tali Kaufman, Guy N. Rothblum |
Verifying and decoding in constant depth. |
STOC |
2007 |
DBLP DOI BibTeX RDF |
error-correcting codes, interactive proofs, constant-depth circuits |
| 1 | Tali Kaufman, Dana Ron |
Testing Polynomials over General Fields. |
SIAM J. Comput. |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Noga Alon, Tali Kaufman, Michael Krivelevich, Dana Ron |
Testing triangle-freeness in general graphs. |
SODA |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Tali Kaufman, Simon Litsyn |
Long Extended BCH Codes Are Spanned by Minimum Weight Words. |
AAECC |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Noga Alon, Tali Kaufman, Michael Krivelevich, Simon Litsyn, Dana Ron |
Testing Reed-Muller codes. |
IEEE Transactions on Information Theory |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Tali Kaufman, Dana Ron |
A characterization of low-weight words that span generalized reed-muller codes. |
IEEE Transactions on Information Theory |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Tali Kaufman, Simon Litsyn |
Almost Orthogonal Linear Codes are Locally Testable. |
FOCS |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Tali Kaufman, Michael Krivelevich, Dana Ron |
Tight Bounds for Testing Bipartiteness in General Graphs. |
SIAM J. Comput. |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Tali Kaufman, Dana Ron |
Testing Polynomials over General Fields. |
FOCS |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Tali Kaufman, Michael Krivelevich, Dana Ron |
Tight Bounds for Testing Bipartiteness in General Graphs. |
RANDOM-APPROX |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Noga Alon, Tali Kaufman, Michael Krivelevich, Simon Litsyn, Dana Ron |
Testing Low-Degree Polynomials over GF(2(. |
RANDOM-APPROX |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Noga Alon, Venkatesan Guruswami, Tali Kaufman, Madhu Sudan |
Guessing secrets efficiently via list decoding. |
SODA |
2002 |
DBLP DOI BibTeX RDF |
|
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")