Testing Low-Degree Polynomials over GF(2(. - Noga Alon; Tali Kaufman; Michael Krivelevich; Simon Litsyn; Dana Ron (RANDOM-APPROX, 2003)

Tight Bounds for Testing Bipartiteness in General Graphs. - Tali Kaufman; Michael Krivelevich; Dana Ron (SIAM J. Comput., 2004)

Almost Orthogonal Linear Codes are Locally Testable. - Tali Kaufman; Simon Litsyn (FOCS, 2005)

Testing Reed-Muller codes. - Noga Alon; Tali Kaufman; Michael Krivelevich; Simon Litsyn; Dana Ron (IEEE Trans. Inf. Theory, 2005)

A characterization of low-weight words that span generalized reed-muller codes. - Tali Kaufman; Dana Ron (IEEE Trans. Inf. Theory, 2005)

Property testing of graphs and codes - Tali Kaufman (2005)

Long Extended BCH Codes Are Spanned by Minimum Weight Words. - Tali Kaufman; Simon Litsyn (AAECC, 2006)

Testing Polynomials over General Fields. - Tali Kaufman; Dana Ron (SIAM J. Comput., 2006)

Testing k-wise and almost k-wise independence. - Noga Alon; Alexandr Andoni; Tali Kaufman; Kevin Matulef; Ronitt Rubinfeld; Ning Xie 002 (STOC, 2007)

Verifying and decoding in constant depth. - Shafi Goldwasser; Dan Gutfreund; Alexander Healy; Tali Kaufman; Guy N. Rothblum (STOC, 2007)

A (De)constructive Approach to Program Checking. - Shafi Goldwasser; Dan Gutfreund; Alexander Healy; Tali Kaufman; Guy N. Rothblum (Electron. Colloquium Comput. Complex., 2007)

Breaking the ε-Soundness Bound of the Linearity Test over GF(2). - Tali Kaufman; Simon Litsyn; Ning Xie 002 (Electron. Colloquium Comput. Complex., 2007)

Sparse Random Linear Codes are Locally Decodable and Testable. - Tali Kaufman; Madhu Sudan 001 (Electron. Colloquium Comput. Complex., 2007)

Algebraic Property Testing: The Role of Invariance. - Tali Kaufman; Madhu Sudan 001 (Electron. Colloquium Comput. Complex., 2007)

Guessing secrets efficiently via list decoding. - Noga Alon; Venkatesan Guruswami; Tali Kaufman; Madhu Sudan 001 (ACM Trans. Algorithms, 2007)

Comparing the strength of query types in property testing: the case of testing k-colorability. - Ido Ben-Eliezer; Tali Kaufman; Michael Krivelevich; Dana Ron (SODA, 2008)

Worst case to Average case reductions for polynomials. - Shachar Lovett; Tali Kaufman (Electron. Colloquium Comput. Complex., 2008)

The List-Decoding Size of Reed-Muller Codes. - Shachar Lovett; Tali Kaufman (Electron. Colloquium Comput. Complex., 2008)

Testing Triangle-Freeness in General Graphs. - Noga Alon; Tali Kaufman; Michael Krivelevich; Dana Ron (SIAM J. Discret. Math., 2008)

Succinct Representation of Codes with Applications to Testing. - Elena Grigorescu; Tali Kaufman; Madhu Sudan 001 (Electron. Colloquium Comput. Complex., 2009)

Local computation in codes. - Tali Kaufman (ITW, 2010)

Comparing the Strength of Query Types in Property Testing: The Case of Testing k-Colorability. - Ido Ben-Eliezer; Tali Kaufman; Michael Krivelevich; Dana Ron (Property Testing, 2010)

Symmetric LDPC Codes and Local Testing. - Tali Kaufman; Avi Wigderson (Property Testing, 2010)

Proximity Oblivious Testing and the Role of Invariances. - Oded Goldreich 001; Tali Kaufman (Electron. Colloquium Comput. Complex., 2010)

Testing of exponentially large codes, by a new extension to Weil bound for character sums. - Tali Kaufman; Shachar Lovett (Electron. Colloquium Comput. Complex., 2010)

Locally Testable vs. Locally Decodable Codes. - Tali Kaufman; Michael Viderman (Electron. Colloquium Comput. Complex., 2010)

Locally Testable Codes Require Redundant Testers. - Eli Ben-Sasson; Venkatesan Guruswami; Tali Kaufman; Madhu Sudan 001; Michael Viderman (SIAM J. Comput., 2010)

Breaking the Epsilon-Soundness Bound of the Linearity Test over GF(2). - Tali Kaufman; Simon Litsyn; Ning Xie 002 (SIAM J. Comput., 2010)

Proximity Oblivious Testing and the Role of Invariances. - Oded Goldreich 001; Tali Kaufman (Studies in Complexity and Cryptography, 2011)

New Extension of the Weil Bound for Character Sums with Applications to Coding. - Tali Kaufman; Shachar Lovett (FOCS, 2011)

Edge Transitive Ramanujan Graphs and Highly Symmetric LDPC Good Codes - Tali Kaufman; Alexander Lubotzky (CoRR, 2011)

Dense locally testable codes cannot have constant rate and distance. - Irit Dinur; Tali Kaufman (Electron. Colloquium Comput. Complex., 2011)

Edge transitive ramanujan graphs and symmetric LDPC good codes. - Tali Kaufman; Alexander Lubotzky (STOC, 2012)

Explicit Low-Weight Bases for BCH Codes. - Elena Grigorescu; Tali Kaufman (IEEE Trans. Inf. Theory, 2012)

Weight Distribution and List-Decoding Size of Reed-Muller Codes. - Tali Kaufman; Shachar Lovett; Ely Porat (IEEE Trans. Inf. Theory, 2012)

Comparing the strength of query types in property testing: The case of k-colorability. - Ido Ben-Eliezer; Tali Kaufman; Michael Krivelevich; Dana Ron (Comput. Complex., 2013)

2-Transitivity is Insufficient for Local Testability. - Elena Grigorescu; Tali Kaufman; Madhu Sudan 001 (Comput. Complex., 2013)

Ramanujan Complexes and Bounded Degree Topological Expanders. - Tali Kaufman; David Kazhdan; Alexander Lubotzky (FOCS, 2014)

High dimensional expanders and property testing. - Tali Kaufman; Alexander Lubotzky (ITCS, 2014)

Isoperimetric Inequalities for Ramanujan Complexes and Topological Expanders. - Tali Kaufman; David Kazhdan; Alexander Lubotzky (CoRR, 2014)

Systolic Expanders of Every Dimension. - Shai Evra; Tali Kaufman (CoRR, 2015)

On Expansion and Topological Overlap. - Dominic Dotterrer; Tali Kaufman; Uli Wagner 001 (SoCG, 2016)

Bounded degree cosystolic expanders of every dimension. - Shai Evra; Tali Kaufman (STOC, 2016)

Symmetric LDPC codes and local testing. - Tali Kaufman; Avi Wigderson (Comb., 2016)

High Dimensional Combinatorial Random Walks and Colorful Expansion. - Tali Kaufman; David Mass (CoRR, 2016)

Walking on the Edge and Cosystolic Expansion. - Tali Kaufman; David Mass (CoRR, 2016)

High Dimensional Random Walks and Colorful Expansion. - Tali Kaufman; David Mass (ITCS, 2017)

High dimensional expanders imply agreement expanders. - Irit Dinur; Tali Kaufman (Electron. Colloquium Comput. Complex., 2017)

Construction of new local spectral high dimensional expanders. - Tali Kaufman; Izhar Oppenheim (STOC, 2018)

Good Distance Lattices from High Dimensional Expanders. - Tali Kaufman; David Mass (CoRR, 2018)

From Local to Robust Testing via Agreement Testing. - Irit Dinur; Tali Kaufman; Noga Ron-Zewi (Electron. Colloquium Comput. Complex., 2018)

Cosystolic Expanders over any Abelian Group. - Tali Kaufman; David Mass (Electron. Colloquium Comput. Complex., 2018)

Testing Odd Direct Sums Using High Dimensional Expanders. - Roy Gotlib; Tali Kaufman (Electron. Colloquium Comput. Complex., 2019)

Chernoff Bound for High-Dimensional Expanders. - Tali Kaufman; Ella Sharakanski (APPROX-RANDOM, 2020)

Decodable quantum LDPC codes beyond the square root distance barrier using high dimensional expanders. - Shai Evra; Tali Kaufman; Gilles Zémor (FOCS, 2020)

Local-To-Global Agreement Expansion via the Variance Method. - Tali Kaufman; David Mass (ITCS, 2020)

High Order Random Walks: Beyond Spectral Gap. - Tali Kaufman; Izhar Oppenheim (Comb., 2020)

Decodable quantum LDPC codes beyond the √n distance barrier using high dimensional expanders. - Shai Evra; Tali Kaufman; Gilles Zémor (CoRR, 2020)

Quantum LDPC codes with Ω(√n logkn) distance, for any k. - Tali Kaufman; Ran J. Tessler (CoRR, 2020)

High Dimensional Expanders: Random Walks, Pseudorandomness, and Unique Games. - Max Hopkins; Tali Kaufman; Shachar Lovett (Electron. Colloquium Comput. Complex., 2020)

Coboundary and Cosystolic Expansion from Strong Symmetry. - Tali Kaufman; Izhar Oppenheim (ICALP, 2021)

Unique-Neighbor-Like Expansion and Group-Independent Cosystolic Expansion. - Tali Kaufman; David Mass (ISAAC, 2021)

New cosystolic expanders from tensors imply explicit Quantum LDPC codes with Ω(√n logk n) distance. - Tali Kaufman; Ran J. Tessler (STOC, 2021)

Erratum to: High Order Random Walks: Beyond Spectral Gap. - Tali Kaufman; Izhar Oppenheim (Comb., 2021)

Local to global high dimensional expansion and Garland's method for general posets. - Tali Kaufman; Ran J. Tessler (CoRR, 2021)

Hypercontractivity on High Dimensional Expanders: a Local-to-Global Approach for Higher Moments. - Mitali Bafna; Max Hopkins; Tali Kaufman; Shachar Lovett (Electron. Colloquium Comput. Complex., 2021)

List-Decoding with Double Samplers. - Irit Dinur; Prahladh Harsha; Tali Kaufman; Inbal Livni Navon; Amnon Ta-Shma (SIAM J. Comput., 2021)

Eigenstripping, Spectral Decay, and Edge-Expansion on Posets. - Jason Gaitonde; Max Hopkins; Tali Kaufman; Shachar Lovett; Ruizhe Zhang 001 (APPROX/RANDOM, 2022)

Double Balanced Sets in High Dimensional Expanders. - Tali Kaufman; David Mass (APPROX/RANDOM, 2022)

High Dimensional Expansion Implies Amplified Local Testability. - Tali Kaufman; Izhar Oppenheim (APPROX/RANDOM, 2022)

High Dimensional Expanders: Eigenstripping, Pseudorandomness, and Unique Games. - Mitali Bafna; Max Hopkins; Tali Kaufman; Shachar Lovett (SODA, 2022)

Scalar and Matrix Chernoff Bounds from ℓ∞-Independence. - Tali Kaufman; Rasmus Kyng; Federico Soldà (SODA, 2022)

Hypercontractivity on high dimensional expanders. - Mitali Bafna; Max Hopkins; Tali Kaufman; Shachar Lovett (STOC, 2022)

Combinatorics via closed orbits: number theoretic Ramanujan graphs are not unique neighbor expanders. - Amitay Kamber; Tali Kaufman (STOC, 2022)

Couboundary Expansion of Sheaves on Graphs and Weighted Mixing Lemmas. - Uriya A. First; Tali Kaufman (CoRR, 2022)

On Good 2-Query Locally Testable Codes from Sheaves on High Dimensional Expanders. - Uriya A. First; Tali Kaufman (CoRR, 2022)

Beyond the Worst Case: Structured Convergence of High Dimensional Random Walks. - Roy Gotlib; Tali Kaufman (CoRR, 2022)

From Local to Robust Testing via Agreement Testing. - Irit Dinur; Prahladh Harsha; Tali Kaufman; Noga Ron-Zewi (Adv. Math. Commun., 2022)

Fine Grained Analysis of High Dimensional Random Walks. - Roy Gotlib; Tali Kaufman (APPROX/RANDOM, 2023)

List Agreement Expansion from Coboundary Expansion. - Roy Gotlib; Tali Kaufman (ITCS, 2023)

Garland's Technique for Posets and High Dimensional Grassmannian Expanders. - Tali Kaufman; Ran J. Tessler (ITCS, 2023)

No Where to Go But High: A Perspective on High Dimensional Expanders. - Roy Gotlib; Tali Kaufman (CoRR, 2023)

NLTS Hamiltonians and Strongly-Explicit SoS Lower Bounds from Low-Rate Quantum LDPC Codes. - Louis Golowich; Tali Kaufman (Electron. Colloquium Comput. Complex., 2023)

High dimensional expanders and coset geometries. - Tali Kaufman; Izhar Oppenheim (Eur. J. Comb., 2023)

Cosystolic Expansion of Sheaves on Posets with Applications to Good 2-Query Locally Testable Codes and Lifted Codes. - Uriya A. First; Tali Kaufman (STOC, 2024)

Decodable Quantum LDPC Codes beyond the $ sqrt{n}$ Distance Barrier Using High-Dimensional Expanders. - Shai Evra; Tali Kaufman; Gilles Zémor (SIAM J. Comput., 2024)

List Decoding Quotient Reed-Muller Codes. - Omri Gotlib; Tali Kaufman; Shachar Lovett (CCC, 2025)

Coboundary Expansion of Coset Complexes. - Tali Kaufman; Izhar Oppenheim; Shmuel Weinberger (STOC, 2025)

Improved Optimal Testing Results from Global Hypercontractivity. - Tali Kaufman; Dor Minzer (SIAM J. Comput., 2025)