Tali Kaufman

Research activity per year

If you made any changes in Pure these will be visible here soon.

Filter

2011
Dense Locally Testable Codes Cannot Have Constant Rate and Distance
Dinur, I. & Kaufman, T., 2011, Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques: Algorithms and Techniques - 14th International Workshop, APPROX 2011 and 15th International Workshop, RANDOM 2011, Proceedings. p. 507-518 12 p. (Lecture Notes in Computer Science).
Weizmann Institute Of Science, Bar-Ilan University
Research output: Chapter in Book/Report/Conference proceeding › Chapter
Proximity oblivious testing and the role of invariances
Goldreich, O. & Kaufman, T., 2011, Studies in Complexity and Cryptography: Miscellanea on the Interplay between Randomness and Computation. Goldreich, O. (ed.). p. 173-190 18 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 6650 LNCS).
Bar-Ilan University
Research output: Chapter in Book/Report/Conference proceeding › Chapter › peer-review

Research output