Research output per year
Research output per year
Personal profile
About Me
Research fields
Complications, Code Theory, Combinatorics and Randomization in Computation, Sublinear Algorithms
Education/Academic qualification
PhD, Tel Aviv University
Oct 2002 → Sep 2005
Award Date: 30 Sep 2005
Master's Degree, Tel Aviv University
Oct 1998 → Sep 2001
Award Date: 30 Sep 2001
Bachelor, Tel Aviv University
Oct 1994 → Sep 1998
Award Date: 30 Sep 1998
Fingerprint
Dive into the research topics where Tali Kaufman is active. These topic labels come from the works of this person. Together they form a unique fingerprint.
- 1 Similar Profiles
Collaborations and top research areas from the last five years
Recent external collaboration on country/territory level. Dive into details by clicking on the dots or
-
BOUNDED DEGREE COSYSTOLIC EXPANDERS OF EVERY DIMENSION
Evra, S. & Kaufman, T., 2024, In: Journal of the American Mathematical Society. 37, 1, p. 39-68 30 p.Research output: Contribution to journal › Article › peer-review
Open Access2 Scopus citations -
Cosystolic Expansion of Sheaves on Posets with Applications to Good 2-Query Locally Testable Codes and Lifted Codes
First, U. A. & Kaufman, T., 10 Jun 2024, STOC 2024 - Proceedings of the 56th Annual ACM Symposium on Theory of Computing. Mohar, B., Shinkar, I. & O�Donnell, R. (eds.). Association for Computing Machinery, p. 1446-1457 12 p. (Proceedings of the Annual ACM Symposium on Theory of Computing).Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review
Open Access -
DECODABLE QUANTUM LDPC CODES BEYOND THE /n DISTANCE BARRIER USING HIGH-DIMENSIONAL EXPANDERS
Evra, S., Kaufman, T. & Zemor, G., 2024, In: SIAM Journal on Computing. 53, 6, p. FOCS20-276 and FOCS20-316Research output: Contribution to journal › Article › peer-review
Open Access8 Scopus citations -
NLTS Hamiltonians and Strongly-Explicit SoS Lower Bounds from Low-Rate Quantum LDPC Codes
Golowich, L. & Kaufman, T., Jan 2024, 15th Innovations in Theoretical Computer Science Conference, ITCS 2024. Guruswami, V. (ed.). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 54. (Leibniz International Proceedings in Informatics, LIPIcs; vol. 287).Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review
-
Fine Grained Analysis of High Dimensional Random Walks
Gotlib, R. & Kaufman, T., Sep 2023, Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2023. Megow, N. & Smith, A. (eds.). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 49. (Leibniz International Proceedings in Informatics, LIPIcs; vol. 275).Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review
1 Scopus citations
Prizes
-
Conference Invited Keynote
Kaufman, T. (Keynote speaker)
10 Apr 2017 → 14 Apr 2017Activity: Talk or presentation › Invited talk
-
Departmental Seminar/Colloquium: na
Kaufman, T. (Speaker)
2017 → …Activity: Talk or presentation › Oral presentation
-
Conference Invited Keynote
Kaufman, T. (Keynote speaker)
30 Jan 2017 → 3 Feb 2017Activity: Talk or presentation › Invited talk
-
Departmental Seminar/Colloquium: na
Kaufman, T. (Speaker)
2016 → …Activity: Talk or presentation › Oral presentation
-
Simons Collaboration on Algorithms and Geometry Second Annual Meeting
Kaufman, T. (Participation - Conference participant)
13 May 2016Activity: Participating in or organizing an event › Organizing a conference, workshop, ...
Thesis
-
Approximating the SVD and Relevant Applications
KAUFMAN, T. (Author), Fiat, A. (Supervisor), 2001Student thesis: Thesis