Searching for authors named "Tali Kaufman" – sorted by Relevance.
12 documents found, showing 1 through 10.
Next 10 →
-
Sparse random linear codes are locally decodable and testable
- …Sparse Random Linear Codes are Locally Decodable and Testable Tali Kaufman Institute for Advanced…
- Cited by 2 (0 self) – Add To MetaCart
-
Algebraic Property Testing: The Role of Invariance
- …Algebraic Property Testing: The Role of Invariance Tali Kaufman ∗ Madhu Sudan † November 2, 2007…
- Cited by 2 (0 self) – Add To MetaCart
-
Verifying and decoding in constant depth
- … Institute shafi@(email omitted); Tali Kaufman CSAIL, MIT kaufmant@(email omitted); We develop a general approach…
- Cited by 3 (1 self) – Add To MetaCart
-
Guessing Secrets Efficiently via List Decoding
- … y Tali Kaufman z Madhu Sudan x Abstract We consider the guessing secrets problem dened by Chung…
- Cited by 4 (0 self) – Add To MetaCart
-
Testing low-degree polynomials over
- …Testing Low-Degree Polynomials over ¢¡¤£¦¥¨§ Noga Alon©�� , Tali Kaufman����� , Michael…
- Cited by 1 (0 self) – Add To MetaCart
-
Testing triangle-freeness in general graphs
- …Testing Triangle-Freeness in General Graphs (Extended Abstract) Noga Alon ∗ Tali Kaufman † Michael…
- Cited by 10 (2 self) – Add To MetaCart
-
Tight Bounds for Testing Bipartiteness in General Graphs
- …Tight Bounds for Testing Bipartiteness in General Graphs Tali Kaufman Dept. of Computer Science…
- Cited by 20 (8 self) – Add To MetaCart
-
Testing low-degree polynomials over GF(2), booktitle
- …Testing Low-Degree Polynomials over GF (2) Noga Alon ∗ Tali Kaufman † Michael Krivelevich ‡ Simon…
- Cited by 1 (0 self) – Add To MetaCart
-
Testing low-degree polynomials over GF(2)
- … ¡ ¢£¤ Testing Low-Degree Polynomials over Noga Alon¥¦, Tali Kaufman§¦¦, Michael Krivelevich…
- Cited by 20 (2 self) – Add To MetaCart
-
Testing Reed Muller Codes ∗
- …Testing Reed Muller Codes ∗ Noga Alon † Tali Kaufman ‡ Michael Krivelevich § Simon Litsyn ¶ Dana…
- Add To MetaCart
Showing 1 through 10.
Next 10 →
