Tali Kaufman
According to our database1,
Tali Kaufman
authored at least 88 papers
between 2003 and 2024.
Collaborative distances:
Collaborative distances:
Timeline
2005
2010
2015
2020
0
5
10
1
2
2
3
4
4
4
1
3
1
3
1
1
2
2
2
5
1
3
5
1
2
1
1
3
8
3
3
1
1
2
2
1
1
1
1
2
1
1
1
1
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
On csauthors.net:
Bibliography
2024
Decodable Quantum LDPC Codes beyond the $\sqrt{n}$ Distance Barrier Using High-Dimensional Expanders.
SIAM J. Comput., 2024
Cosystolic Expansion of Sheaves on Posets with Applications to Good 2-Query Locally Testable Codes and Lifted Codes.
Proceedings of the 56th Annual ACM Symposium on Theory of Computing, 2024
2023
NLTS Hamiltonians and Strongly-Explicit SoS Lower Bounds from Low-Rate Quantum LDPC Codes.
Electron. Colloquium Comput. Complex., 2023
Proceedings of the 14th Innovations in Theoretical Computer Science Conference, 2023
Proceedings of the 14th Innovations in Theoretical Computer Science Conference, 2023
Proceedings of the Approximation, 2023
2022
CoRR, 2022
CoRR, 2022
Combinatorics via closed orbits: number theoretic Ramanujan graphs are not unique neighbor expanders.
Proceedings of the STOC '22: 54th Annual ACM SIGACT Symposium on Theory of Computing, Rome, Italy, June 20, 2022
Proceedings of the STOC '22: 54th Annual ACM SIGACT Symposium on Theory of Computing, Rome, Italy, June 20, 2022
Proceedings of the 2022 ACM-SIAM Symposium on Discrete Algorithms, 2022
Proceedings of the 2022 ACM-SIAM Symposium on Discrete Algorithms, 2022
Proceedings of the 63rd IEEE Annual Symposium on Foundations of Computer Science, 2022
Proceedings of the Approximation, 2022
Proceedings of the Approximation, 2022
Proceedings of the Approximation, 2022
2021
Hypercontractivity on High Dimensional Expanders: a Local-to-Global Approach for Higher Moments.
Electron. Colloquium Comput. Complex., 2021
CoRR, 2021
New cosystolic expanders from tensors imply explicit Quantum LDPC codes with Ω(√<i>n</i> log<sup><i>k</i></sup> <i>n</i>) distance.
Proceedings of the STOC '21: 53rd Annual ACM SIGACT Symposium on Theory of Computing, 2021
Proceedings of the 32nd International Symposium on Algorithms and Computation, 2021
Proceedings of the 48th International Colloquium on Automata, Languages, and Programming, 2021
2020
Electron. Colloquium Comput. Complex., 2020
Decodable quantum LDPC codes beyond the √n distance barrier using high dimensional expanders.
CoRR, 2020
Proceedings of the 11th Innovations in Theoretical Computer Science Conference, 2020
Decodable quantum LDPC codes beyond the square root distance barrier using high dimensional expanders.
Proceedings of the 61st IEEE Annual Symposium on Foundations of Computer Science, 2020
Proceedings of the Approximation, 2020
2019
Electron. Colloquium Comput. Complex., 2019
2018
Electron. Colloquium Comput. Complex., 2018
Electron. Colloquium Comput. Complex., 2018
Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing, 2018
2017
Electron. Colloquium Comput. Complex., 2017
Proceedings of the 8th Innovations in Theoretical Computer Science Conference, 2017
2016
Proceedings of the 48th Annual ACM SIGACT Symposium on Theory of Computing, 2016
Proceedings of the 32nd International Symposium on Computational Geometry, 2016
2015
2014
CoRR, 2014
Proceedings of the Innovations in Theoretical Computer Science, 2014
Proceedings of the 55th IEEE Annual Symposium on Foundations of Computer Science, 2014
2013
Comparing the strength of query types in property testing: The case of k-colorability.
Comput. Complex., 2013
2012
IEEE Trans. Inf. Theory, 2012
Proceedings of the 44th Symposium on Theory of Computing Conference, 2012
2011
Electron. Colloquium Comput. Complex., 2011
Proceedings of the IEEE 52nd Annual Symposium on Foundations of Computer Science, 2011
Proceedings of the Studies in Complexity and Cryptography. Miscellanea on the Interplay between Randomness and Computation, 2011
2010
SIAM J. Comput., 2010
Electron. Colloquium Comput. Complex., 2010
Testing of exponentially large codes, by a new extension to Weil bound for character sums.
Electron. Colloquium Comput. Complex., 2010
Electron. Colloquium Comput. Complex., 2010
Proceedings of the Property Testing - Current Research and Surveys, 2010
Comparing the Strength of Query Types in Property Testing: The Case of Testing <i>k</i>-Colorability.
Proceedings of the Property Testing - Current Research and Surveys, 2010
Proceedings of the 2010 IEEE Information Theory Workshop, 2010
2009
Electron. Colloquium Comput. Complex., 2009
2008
Electron. Colloquium Comput. Complex., 2008
Electron. Colloquium Comput. Complex., 2008
Comparing the strength of query types in property testing: the case of testing <i>k</i>-colorability.
Proceedings of the Nineteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2008
2007
Electron. Colloquium Comput. Complex., 2007
Electron. Colloquium Comput. Complex., 2007
Electron. Colloquium Comput. Complex., 2007
Electron. Colloquium Comput. Complex., 2007
Proceedings of the 39th Annual ACM Symposium on Theory of Computing, 2007
Proceedings of the 39th Annual ACM Symposium on Theory of Computing, 2007
2006
Proceedings of the Applied Algebra, 2006
2005
IEEE Trans. Inf. Theory, 2005
Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2005), 2005
2004
2003