Research output per year
Research output per year
Personal profile
Research interests
Research fields
Complications, Code Theory, Combinatorics and Randomization in Computation, Sublinear Algorithms
Education/Academic qualification
Oct 2002 → Sep 2005
Oct 1998 → Sep 2001
Bachelor
Oct 1994 → 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
-
Garland's Technique for Posets and High Dimensional Grassmannian Expanders
Kaufman, T. & Tessler, R. J., 1 Jan 2023, 14th Innovations in Theoretical Computer Science Conference, ITCS 2023. Kalai, Y. T. (ed.). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 78. (Leibniz International Proceedings in Informatics, LIPIcs; vol. 251).Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review
-
High dimensional expanders and coset geometries
Kaufman, T. & Oppenheim, I., Jun 2023, In: European Journal of Combinatorics. 111, 103696.Bar-Ilan University, Ben-Gurion University of the Negev
Research output: Contribution to journal › Article › peer-review
-
List Agreement Expansion from Coboundary Expansion
Kaufman, T., 1 Jan 2023, 14th Innovations in Theoretical Computer Science Conference, ITCS 2023. Kalai, Y. T. (ed.). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 61. (Leibniz International Proceedings in Informatics, LIPIcs; vol. 251).Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review
-
Combinatorics via closed orbits: number theoretic Ramanujan graphs are not unique neighbor expanders
Kamber, A. & Kaufman, T., 6 Sep 2022, STOC 2022 - Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing. Leonardi, S. & Gupta, A. (eds.). p. 426-435 10 p. (Proceedings of the Annual ACM Symposium on Theory of Computing).Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review
-
Double Balanced Sets in High Dimensional Expanders
Kaufman, T., 1 Sep 2022, Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2022. Chakrabarti, A. & Swamy, C. (eds.). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 3. (Leibniz International Proceedings in Informatics, LIPIcs; vol. 245).Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review