Tali Kaufman

From MaRDI portal
(Redirected from Person:295847)



List of research outcomes

This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!

PublicationDate of PublicationType
NLTS Hamiltonians and strongly-explicit SoS lower bounds from low-rate quantum LDPC codes2025-11-04Paper
Fine grained analysis of high dimensional random walks2025-01-14Paper
List agreement expansion from coboundary expansion2024-09-25Paper
Garland's technique for posets and high dimensional Grassmannian expanders2024-09-25Paper
Double balanced sets in high dimensional expanders2024-08-22Paper
High dimensional expansion implies amplified local testability2024-08-22Paper
Eigenstripping, spectral decay, and edge-expansion on posets2024-08-22Paper
High dimensional expanders: eigenstripping, pseudorandomness, and unique games2024-07-19Paper
Scalar and matrix Chernoff bounds from \(\ell_\infty\)-independence2024-07-19Paper
Nowhere to go but high: a perspective on high-dimensional expanders
International Congress of Mathematicians
2024-03-20Paper
scientific article; zbMATH DE number 7788629 (Why is no real title available?)
(available as arXiv preprint)
2024-01-15Paper
Hypercontractivity on high dimensional expanders
Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing
2023-12-08Paper
Combinatorics via closed orbits: number theoretic Ramanujan graphs are not unique neighbor expanders
Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing
2023-12-08Paper
Combinatorics via closed orbits: number theoretic Ramanujan graphs are not unique neighbor expanders
Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing
2023-12-08Paper
New cosystolic expanders from tensors imply explicit Quantum LDPC codes with Ω(√ n log k n ) distance
Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing
2023-11-14Paper
scientific article; zbMATH DE number 7758327 (Why is no real title available?)2023-10-31Paper
Bounded degree cosystolic expanders of every dimension
Journal of the American Mathematical Society
2023-10-19Paper
High dimensional expanders and coset geometries
European Journal of Combinatorics
2023-07-18Paper
Testing Odd Direct Sums Using High Dimensional Expanders2023-02-03Paper
scientific article; zbMATH DE number 7650422 (Why is no real title available?)2023-02-03Paper
Double Balanced Sets in High Dimensional Expanders2022-11-17Paper
Free Flags Over Local Rings and Powering of High-dimensional Expanders
IMRN. International Mathematics Research Notices
2022-10-06Paper
Fine Grained Analysis of High Dimensional Random Walks2022-08-05Paper
The Cheeger Inequality and Coboundary Expansion: Beyond Constant Coefficients2022-08-02Paper
On Good $2$-Query Locally Testable Codes from Sheaves on High Dimensional Expanders2022-08-02Paper
From local to robust testing via agreement testing
Theory of Computing
2022-07-26Paper
From Local to Robust Testing via Agreement Testing2022-07-18Paper
Decodable Quantum LDPC Codes beyond the $\sqrt{n}$ Distance Barrier Using High-Dimensional Expanders
SIAM Journal on Computing
2022-07-08Paper
Eigenstripping, Spectral Decay, and Edge-Expansion on Posets2022-05-02Paper
Improved Optimal Testing Results from Global Hypercontractivity2022-02-17Paper
Erratum to: ``High order random walks: beyond spectral gap
Combinatorica
2022-01-06Paper
High order random walks: beyond spectral gap
(available as arXiv preprint)
2021-08-04Paper
High dimensional expansion implies amplified local testability2021-07-22Paper
List-Decoding with Double Samplers
SIAM Journal on Computing
2021-03-24Paper
Garland's Technique for Posets and High Dimensional Grassmannian Expanders2021-01-29Paper
High Dimensional Expanders: Eigenstripping, Pseudorandomness, and Unique Games2020-11-09Paper
High order random walks: beyond spectral gap
Combinatorica
2020-10-02Paper
Transitive bounded-degree 2-expanders from regular 2-expanders2020-04-23Paper
High dimensional expansion using zig-zag product2020-01-23Paper
List decoding with double samplers
Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms
2019-10-15Paper
Construction of new local spectral high dimensional expanders
Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing
2019-08-22Paper
Coboundary and cosystolic expansion from strong symmetry2019-07-02Paper
Guessing secrets efficiently via list decoding
ACM Transactions on Algorithms
2018-11-05Paper
On expansion and topological overlap
Geometriae Dedicata
2018-08-23Paper
High dimensional random walks and colorful expansion
(available as arXiv preprint)
2018-05-03Paper
Good Distance Lattices from High Dimensional Expanders2018-03-07Paper
On expansion and topological overlap
(available as arXiv preprint)
2018-01-30Paper
Bounded degree cosystolic expanders of every dimension
Proceedings of the forty-eighth annual ACM symposium on Theory of Computing
2017-09-29Paper
Weight Distribution and List-Decoding Size of Reed–Muller Codes
IEEE Transactions on Information Theory
2017-07-12Paper
Explicit Low-Weight Bases for BCH Codes
IEEE Transactions on Information Theory
2017-07-12Paper
High Order Random Walks: Beyond Spectral Gap
(available as arXiv preprint)
2017-07-10Paper
High dimensional expanders and property testing
Proceedings of the 5th conference on Innovations in theoretical computer science
2017-05-19Paper
Symmetric LDPC codes and local testing
Combinatorica
2017-03-31Paper
Isoperimetric inequalities for Ramanujan complexes and topological expanders
Geometric and Functional Analysis. GAFA
2016-06-14Paper
Walking on the Edge and Cosystolic Expansion2016-06-06Paper
Ramanujan Complexes and bounded degree topological expanders2014-08-27Paper
New Extension of the Weil Bound for Character Sums with Applications to Coding
2011 IEEE 52nd Annual Symposium on Foundations of Computer Science
2014-07-30Paper
Edge transitive Ramanujan graphs and symmetric LDPC good codes
Proceedings of the forty-fourth annual ACM symposium on Theory of computing
2014-05-13Paper
2-transitivity is insufficient for local testability
Computational Complexity
2013-04-11Paper
Comparing the strength of query types in property testing: the case of \(k\)-colorability
Computational Complexity
2013-04-11Paper
Succinct representation of codes with applications to testing
SIAM Journal on Discrete Mathematics
2013-04-09Paper
Proximity oblivious testing and the role of invariances
Studies in Complexity and Cryptography. Miscellanea on the Interplay between Randomness and Computation
2011-08-19Paper
Dense locally testable codes cannot have constant rate and distance
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
2011-08-17Paper
Proximity Oblivious Testing and the Role of Invariances
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
2011-08-17Paper
Locally Testable Codes Require Redundant Testers
SIAM Journal on Computing
2011-04-04Paper
Breaking the \(\epsilon\)-soundness bound of the linearity test over GF(2)
SIAM Journal on Computing
2010-11-04Paper
Symmetric LDPC codes and local testing
Property Testing
2010-10-12Paper
Comparing the strength of query types in property testing: the case of testing \(k\)-colorability
Property Testing
2010-10-12Paper
Locally testable vs. locally decodable codes
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
2010-09-10Paper
Testing triangle-freeness in general graphs
Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm - SODA '06
2010-08-16Paper
scientific article; zbMATH DE number 5764842 (Why is no real title available?)2010-08-06Paper
Approximation, Randomization, and Combinatorial Optimization.. Algorithms and Techniques
Lecture Notes in Computer Science
2010-05-26Paper
Approximation, Randomization, and Combinatorial Optimization.. Algorithms and Techniques
Lecture Notes in Computer Science
2010-05-26Paper
Succinct Representation of Codes with Applications to Testing
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
2009-10-28Paper
Succinct Representation of Codes with Applications to Testing
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
2009-10-28Paper
Testing Triangle-Freeness in General Graphs
SIAM Journal on Discrete Mathematics
2009-05-27Paper
Algebraic property testing: the role of invariance2009-01-05Paper
scientific article; zbMATH DE number 5485485 (Why is no real title available?)2009-01-05Paper
Verifying and decoding in constant depth2009-01-05Paper
scientific article; zbMATH DE number 5485525 (Why is no real title available?)2009-01-05Paper
Testing Reed–Muller Codes
IEEE Transactions on Information Theory
2008-12-21Paper
A Characterization of Low-Weight Words That Span Generalized Reed–Muller Codes
IEEE Transactions on Information Theory
2008-12-21Paper
Breaking the ε-Soundness Bound of the Linearity Test over GF(2)
Lecture Notes in Computer Science
2008-11-27Paper
Testing Polynomials over General Fields
SIAM Journal on Computing
2007-06-26Paper
Applied Algebra, Algebraic Algorithms and Error-Correcting Codes
Lecture Notes in Computer Science
2007-02-12Paper
Tight Bounds for Testing Bipartiteness in General Graphs
SIAM Journal on Computing
2005-02-21Paper
scientific article; zbMATH DE number 2119669 (Why is no real title available?)2004-11-29Paper
Cosystolic Expansion of Sheaves on Posets with Applications to Good 2-Query Locally Testable Codes and Lifted Codes
(available as arXiv preprint)
N/APaper


Research outcomes over time


This page was built for person: Tali Kaufman