default search action
BibTeX records: Tali Kaufman
@inproceedings{DBLP:conf/innovations/GolowichK24, author = {Louis Golowich and Tali Kaufman}, editor = {Venkatesan Guruswami}, title = {{NLTS} Hamiltonians and Strongly-Explicit SoS Lower Bounds from Low-Rate Quantum {LDPC} Codes}, booktitle = {15th Innovations in Theoretical Computer Science Conference, {ITCS} 2024, January 30 to February 2, 2024, Berkeley, CA, {USA}}, series = {LIPIcs}, volume = {287}, pages = {54:1--54:23}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2024}, url = {https://doi.org/10.4230/LIPIcs.ITCS.2024.54}, doi = {10.4230/LIPICS.ITCS.2024.54}, timestamp = {Wed, 21 Aug 2024 22:46:00 +0200}, biburl = {https://dblp.org/rec/conf/innovations/GolowichK24.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stoc/FirstK24, author = {Uriya A. First and Tali Kaufman}, editor = {Bojan Mohar and Igor Shinkar and Ryan O'Donnell}, title = {Cosystolic Expansion of Sheaves on Posets with Applications to Good 2-Query Locally Testable Codes and Lifted Codes}, booktitle = {Proceedings of the 56th Annual {ACM} Symposium on Theory of Computing, {STOC} 2024, Vancouver, BC, Canada, June 24-28, 2024}, pages = {1446--1457}, publisher = {{ACM}}, year = {2024}, url = {https://doi.org/10.1145/3618260.3649625}, doi = {10.1145/3618260.3649625}, timestamp = {Thu, 20 Jun 2024 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/stoc/FirstK24.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-2403-19388, author = {Uriya A. First and Tali Kaufman}, title = {Cosystolic Expansion of Sheaves on Posets with Applications to Good 2-Query Locally Testable Codes and Lifted Codes}, journal = {CoRR}, volume = {abs/2403.19388}, year = {2024}, url = {https://doi.org/10.48550/arXiv.2403.19388}, doi = {10.48550/ARXIV.2403.19388}, eprinttype = {arXiv}, eprint = {2403.19388}, timestamp = {Thu, 11 Apr 2024 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-2403-19388.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ejc/KaufmanO23, author = {Tali Kaufman and Izhar Oppenheim}, title = {High dimensional expanders and coset geometries}, journal = {Eur. J. Comb.}, volume = {111}, pages = {103696}, year = {2023}, url = {https://doi.org/10.1016/j.ejc.2023.103696}, doi = {10.1016/J.EJC.2023.103696}, timestamp = {Sun, 12 Nov 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/ejc/KaufmanO23.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/approx/GotlibK23, author = {Roy Gotlib and Tali Kaufman}, editor = {Nicole Megow and Adam D. Smith}, title = {Fine Grained Analysis of High Dimensional Random Walks}, booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, {APPROX/RANDOM} 2023, September 11-13, 2023, Atlanta, Georgia, {USA}}, series = {LIPIcs}, volume = {275}, pages = {49:1--49:22}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2023}, url = {https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2023.49}, doi = {10.4230/LIPICS.APPROX/RANDOM.2023.49}, timestamp = {Wed, 21 Aug 2024 22:46:00 +0200}, biburl = {https://dblp.org/rec/conf/approx/GotlibK23.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/innovations/GotlibK23, author = {Roy Gotlib and Tali Kaufman}, editor = {Yael Tauman Kalai}, title = {List Agreement Expansion from Coboundary Expansion}, booktitle = {14th Innovations in Theoretical Computer Science Conference, {ITCS} 2023, January 10-13, 2023, MIT, Cambridge, Massachusetts, {USA}}, series = {LIPIcs}, volume = {251}, pages = {61:1--61:23}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2023}, url = {https://doi.org/10.4230/LIPIcs.ITCS.2023.61}, doi = {10.4230/LIPICS.ITCS.2023.61}, timestamp = {Wed, 21 Aug 2024 22:46:00 +0200}, biburl = {https://dblp.org/rec/conf/innovations/GotlibK23.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/innovations/KaufmanT23, author = {Tali Kaufman and Ran J. Tessler}, editor = {Yael Tauman Kalai}, title = {Garland's Technique for Posets and High Dimensional Grassmannian Expanders}, booktitle = {14th Innovations in Theoretical Computer Science Conference, {ITCS} 2023, January 10-13, 2023, MIT, Cambridge, Massachusetts, {USA}}, series = {LIPIcs}, volume = {251}, pages = {78:1--78:22}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2023}, url = {https://doi.org/10.4230/LIPIcs.ITCS.2023.78}, doi = {10.4230/LIPICS.ITCS.2023.78}, timestamp = {Thu, 02 Feb 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/innovations/KaufmanT23.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-2304-10106, author = {Roy Gotlib and Tali Kaufman}, title = {No Where to Go But High: {A} Perspective on High Dimensional Expanders}, journal = {CoRR}, volume = {abs/2304.10106}, year = {2023}, url = {https://doi.org/10.48550/arXiv.2304.10106}, doi = {10.48550/ARXIV.2304.10106}, eprinttype = {arXiv}, eprint = {2304.10106}, timestamp = {Wed, 26 Apr 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-2304-10106.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-2311-09503, author = {Louis Golowich and Tali Kaufman}, title = {{NLTS} Hamiltonians and Strongly-Explicit SoS Lower Bounds from Low-Rate Quantum {LDPC} Codes}, journal = {CoRR}, volume = {abs/2311.09503}, year = {2023}, url = {https://doi.org/10.48550/arXiv.2311.09503}, doi = {10.48550/ARXIV.2311.09503}, eprinttype = {arXiv}, eprint = {2311.09503}, timestamp = {Thu, 23 Nov 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/corr/abs-2311-09503.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/GolowichK23, author = {Louis Golowich and Tali Kaufman}, title = {{NLTS} Hamiltonians and Strongly-Explicit SoS Lower Bounds from Low-Rate Quantum {LDPC} Codes}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR23-178}}, year = {2023}, url = {https://eccc.weizmann.ac.il/report/2023/178}, eprinttype = {ECCC}, eprint = {TR23-178}, timestamp = {Wed, 10 Jan 2024 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/eccc/GolowichK23.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/toc/DinurHKR22, author = {Irit Dinur and Prahladh Harsha and Tali Kaufman and Noga Ron{-}Zewi}, title = {From Local to Robust Testing via Agreement Testing}, journal = {Theory Comput.}, volume = {18}, pages = {1--25}, year = {2022}, url = {https://theoryofcomputing.org/articles/v018a012/}, timestamp = {Thu, 02 Mar 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/toc/DinurHKR22.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/approx/KaufmanM22, author = {Tali Kaufman and David Mass}, editor = {Amit Chakrabarti and Chaitanya Swamy}, title = {Double Balanced Sets in High Dimensional Expanders}, booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, {APPROX/RANDOM} 2022, September 19-21, 2022, University of Illinois, Urbana-Champaign, {USA} (Virtual Conference)}, series = {LIPIcs}, volume = {245}, pages = {3:1--3:17}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2022}, url = {https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2022.3}, doi = {10.4230/LIPICS.APPROX/RANDOM.2022.3}, timestamp = {Wed, 21 Aug 2024 22:46:00 +0200}, biburl = {https://dblp.org/rec/conf/approx/KaufmanM22.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/approx/KaufmanO22, author = {Tali Kaufman and Izhar Oppenheim}, editor = {Amit Chakrabarti and Chaitanya Swamy}, title = {High Dimensional Expansion Implies Amplified Local Testability}, booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, {APPROX/RANDOM} 2022, September 19-21, 2022, University of Illinois, Urbana-Champaign, {USA} (Virtual Conference)}, series = {LIPIcs}, volume = {245}, pages = {5:1--5:10}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2022}, url = {https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2022.5}, doi = {10.4230/LIPICS.APPROX/RANDOM.2022.5}, timestamp = {Sun, 12 Nov 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/approx/KaufmanO22.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/approx/GaitondeHKLZ22, author = {Jason Gaitonde and Max Hopkins and Tali Kaufman and Shachar Lovett and Ruizhe Zhang}, editor = {Amit Chakrabarti and Chaitanya Swamy}, title = {Eigenstripping, Spectral Decay, and Edge-Expansion on Posets}, booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, {APPROX/RANDOM} 2022, September 19-21, 2022, University of Illinois, Urbana-Champaign, {USA} (Virtual Conference)}, series = {LIPIcs}, volume = {245}, pages = {16:1--16:24}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2022}, url = {https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2022.16}, doi = {10.4230/LIPICS.APPROX/RANDOM.2022.16}, timestamp = {Mon, 26 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/approx/GaitondeHKLZ22.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/focs/KaufmanM22, author = {Tali Kaufman and Dor Minzer}, title = {Improved Optimal Testing Results from Global Hypercontractivity}, booktitle = {63rd {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS} 2022, Denver, CO, USA, October 31 - November 3, 2022}, pages = {98--109}, publisher = {{IEEE}}, year = {2022}, url = {https://doi.org/10.1109/FOCS54457.2022.00017}, doi = {10.1109/FOCS54457.2022.00017}, timestamp = {Sat, 31 Dec 2022 17:14:50 +0100}, biburl = {https://dblp.org/rec/conf/focs/KaufmanM22.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/soda/BafnaHKL22, author = {Mitali Bafna and Max Hopkins and Tali Kaufman and Shachar Lovett}, editor = {Joseph (Seffi) Naor and Niv Buchbinder}, title = {High Dimensional Expanders: Eigenstripping, Pseudorandomness, and Unique Games}, booktitle = {Proceedings of the 2022 {ACM-SIAM} Symposium on Discrete Algorithms, {SODA} 2022, Virtual Conference / Alexandria, VA, USA, January 9 - 12, 2022}, pages = {1069--1128}, publisher = {{SIAM}}, year = {2022}, url = {https://doi.org/10.1137/1.9781611977073.47}, doi = {10.1137/1.9781611977073.47}, timestamp = {Tue, 12 Apr 2022 11:24:56 +0200}, biburl = {https://dblp.org/rec/conf/soda/BafnaHKL22.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/soda/KaufmanKS22, author = {Tali Kaufman and Rasmus Kyng and Federico Sold{\`{a}}}, editor = {Joseph (Seffi) Naor and Niv Buchbinder}, title = {Scalar and Matrix Chernoff Bounds from {\(\mathscr{l}\)}\({}_{\mbox{{\(\infty\)}}}\)-Independence}, booktitle = {Proceedings of the 2022 {ACM-SIAM} Symposium on Discrete Algorithms, {SODA} 2022, Virtual Conference / Alexandria, VA, USA, January 9 - 12, 2022}, pages = {3732--3753}, publisher = {{SIAM}}, year = {2022}, url = {https://doi.org/10.1137/1.9781611977073.147}, doi = {10.1137/1.9781611977073.147}, timestamp = {Tue, 12 Apr 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/soda/KaufmanKS22.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stoc/BafnaHKL22, author = {Mitali Bafna and Max Hopkins and Tali Kaufman and Shachar Lovett}, editor = {Stefano Leonardi and Anupam Gupta}, title = {Hypercontractivity on high dimensional expanders}, booktitle = {{STOC} '22: 54th Annual {ACM} {SIGACT} Symposium on Theory of Computing, Rome, Italy, June 20 - 24, 2022}, pages = {185--194}, publisher = {{ACM}}, year = {2022}, url = {https://doi.org/10.1145/3519935.3520040}, doi = {10.1145/3519935.3520040}, timestamp = {Tue, 27 Dec 2022 09:06:31 +0100}, biburl = {https://dblp.org/rec/conf/stoc/BafnaHKL22.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stoc/KamberK22, author = {Amitay Kamber and Tali Kaufman}, editor = {Stefano Leonardi and Anupam Gupta}, title = {Combinatorics via closed orbits: number theoretic Ramanujan graphs are not unique neighbor expanders}, booktitle = {{STOC} '22: 54th Annual {ACM} {SIGACT} Symposium on Theory of Computing, Rome, Italy, June 20 - 24, 2022}, pages = {426--435}, publisher = {{ACM}}, year = {2022}, url = {https://doi.org/10.1145/3519935.3519992}, doi = {10.1145/3519935.3519992}, timestamp = {Tue, 14 Jun 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/stoc/KamberK22.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-2202-08688, author = {Tali Kaufman and Dor Minzer}, title = {Improved Optimal Testing Results from Global Hypercontractivity}, journal = {CoRR}, volume = {abs/2202.08688}, year = {2022}, url = {https://arxiv.org/abs/2202.08688}, eprinttype = {arXiv}, eprint = {2202.08688}, timestamp = {Tue, 01 Mar 2022 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/corr/abs-2202-08688.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-2205-00644, author = {Jason Gaitonde and Max Hopkins and Tali Kaufman and Shachar Lovett and Ruizhe Zhang}, title = {Eigenstripping, Spectral Decay, and Edge-Expansion on Posets}, journal = {CoRR}, volume = {abs/2205.00644}, year = {2022}, url = {https://doi.org/10.48550/arXiv.2205.00644}, doi = {10.48550/ARXIV.2205.00644}, eprinttype = {arXiv}, eprint = {2205.00644}, timestamp = {Tue, 03 May 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-2205-00644.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-2208-01776, author = {Uriya A. First and Tali Kaufman}, title = {Couboundary Expansion of Sheaves on Graphs and Weighted Mixing Lemmas}, journal = {CoRR}, volume = {abs/2208.01776}, year = {2022}, url = {https://doi.org/10.48550/arXiv.2208.01776}, doi = {10.48550/ARXIV.2208.01776}, eprinttype = {arXiv}, eprint = {2208.01776}, timestamp = {Wed, 10 Aug 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-2208-01776.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-2208-01778, author = {Uriya A. First and Tali Kaufman}, title = {On Good 2-Query Locally Testable Codes from Sheaves on High Dimensional Expanders}, journal = {CoRR}, volume = {abs/2208.01778}, year = {2022}, url = {https://doi.org/10.48550/arXiv.2208.01778}, doi = {10.48550/ARXIV.2208.01778}, eprinttype = {arXiv}, eprint = {2208.01778}, timestamp = {Wed, 10 Aug 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-2208-01778.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-2208-03241, author = {Roy Gotlib and Tali Kaufman}, title = {Beyond the Worst Case: Structured Convergence of High Dimensional Random Walks}, journal = {CoRR}, volume = {abs/2208.03241}, year = {2022}, url = {https://doi.org/10.48550/arXiv.2208.03241}, doi = {10.48550/ARXIV.2208.03241}, eprinttype = {arXiv}, eprint = {2208.03241}, timestamp = {Wed, 10 Aug 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-2208-03241.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-2210-15714, author = {Roy Gotlib and Tali Kaufman}, title = {List Agreement Expansion from Coboundary Expansion}, journal = {CoRR}, volume = {abs/2210.15714}, year = {2022}, url = {https://doi.org/10.48550/arXiv.2210.15714}, doi = {10.48550/ARXIV.2210.15714}, eprinttype = {arXiv}, eprint = {2210.15714}, timestamp = {Wed, 02 Nov 2022 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/corr/abs-2210-15714.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-2211-09482, author = {Tali Kaufman and David Mass}, title = {Unique-Neighbor-Like Expansion and Group-Independent Cosystolic Expansion}, journal = {CoRR}, volume = {abs/2211.09482}, year = {2022}, url = {https://doi.org/10.48550/arXiv.2211.09482}, doi = {10.48550/ARXIV.2211.09482}, eprinttype = {arXiv}, eprint = {2211.09482}, timestamp = {Wed, 23 Nov 2022 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/corr/abs-2211-09482.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-2211-09485, author = {Tali Kaufman and David Mass}, title = {Double Balanced Sets in High Dimensional Expanders}, journal = {CoRR}, volume = {abs/2211.09485}, year = {2022}, url = {https://doi.org/10.48550/arXiv.2211.09485}, doi = {10.48550/ARXIV.2211.09485}, eprinttype = {arXiv}, eprint = {2211.09485}, timestamp = {Wed, 23 Nov 2022 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/corr/abs-2211-09485.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/combinatorica/KaufmanO21, author = {Tali Kaufman and Izhar Oppenheim}, title = {Erratum to: High Order Random Walks: Beyond Spectral Gap}, journal = {Comb.}, volume = {41}, number = {5}, pages = {749--753}, year = {2021}, url = {https://doi.org/10.1007/s00493-021-4451-7}, doi = {10.1007/S00493-021-4451-7}, timestamp = {Sun, 12 Nov 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/combinatorica/KaufmanO21.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/siamcomp/DinurHKNT21, author = {Irit Dinur and Prahladh Harsha and Tali Kaufman and Inbal Livni Navon and Amnon Ta{-}Shma}, title = {List-Decoding with Double Samplers}, journal = {{SIAM} J. Comput.}, volume = {50}, number = {2}, pages = {301--349}, year = {2021}, url = {https://doi.org/10.1137/19M1276650}, doi = {10.1137/19M1276650}, timestamp = {Sat, 30 Sep 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/siamcomp/DinurHKNT21.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/icalp/KaufmanO21, author = {Tali Kaufman and Izhar Oppenheim}, editor = {Nikhil Bansal and Emanuela Merelli and James Worrell}, title = {Coboundary and Cosystolic Expansion from Strong Symmetry}, booktitle = {48th International Colloquium on Automata, Languages, and Programming, {ICALP} 2021, July 12-16, 2021, Glasgow, Scotland (Virtual Conference)}, series = {LIPIcs}, volume = {198}, pages = {84:1--84:16}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2021}, url = {https://doi.org/10.4230/LIPIcs.ICALP.2021.84}, doi = {10.4230/LIPICS.ICALP.2021.84}, timestamp = {Wed, 21 Aug 2024 22:46:00 +0200}, biburl = {https://dblp.org/rec/conf/icalp/KaufmanO21.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/isaac/KaufmanM21, author = {Tali Kaufman and David Mass}, editor = {Hee{-}Kap Ahn and Kunihiko Sadakane}, title = {Unique-Neighbor-Like Expansion and Group-Independent Cosystolic Expansion}, booktitle = {32nd International Symposium on Algorithms and Computation, {ISAAC} 2021, December 6-8, 2021, Fukuoka, Japan}, series = {LIPIcs}, volume = {212}, pages = {56:1--56:17}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2021}, url = {https://doi.org/10.4230/LIPIcs.ISAAC.2021.56}, doi = {10.4230/LIPICS.ISAAC.2021.56}, timestamp = {Wed, 21 Aug 2024 22:46:00 +0200}, biburl = {https://dblp.org/rec/conf/isaac/KaufmanM21.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stoc/KaufmanT21, author = {Tali Kaufman and Ran J. Tessler}, editor = {Samir Khuller and Virginia Vassilevska Williams}, title = {New cosystolic expanders from tensors imply explicit Quantum {LDPC} codes with {\(\Omega\)}({\(\surd\)}\emph{n} log\({}^{\mbox{\emph{k}}}\) \emph{n}) distance}, booktitle = {{STOC} '21: 53rd Annual {ACM} {SIGACT} Symposium on Theory of Computing, Virtual Event, Italy, June 21-25, 2021}, pages = {1317--1329}, publisher = {{ACM}}, year = {2021}, url = {https://doi.org/10.1145/3406325.3451029}, doi = {10.1145/3406325.3451029}, timestamp = {Tue, 22 Jun 2021 19:47:11 +0200}, biburl = {https://dblp.org/rec/conf/stoc/KaufmanT21.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-2101-12621, author = {Tali Kaufman and Ran J. Tessler}, title = {Local to global high dimensional expansion and Garland's method for general posets}, journal = {CoRR}, volume = {abs/2101.12621}, year = {2021}, url = {https://arxiv.org/abs/2101.12621}, eprinttype = {arXiv}, eprint = {2101.12621}, timestamp = {Tue, 02 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/corr/abs-2101-12621.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-2107-10488, author = {Tali Kaufman and Izhar Oppenheim}, title = {High dimensional expansion implies amplified local testability}, journal = {CoRR}, volume = {abs/2107.10488}, year = {2021}, url = {https://arxiv.org/abs/2107.10488}, eprinttype = {arXiv}, eprint = {2107.10488}, timestamp = {Thu, 29 Jul 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-2107-10488.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-2111-02177, author = {Tali Kaufman and Rasmus Kyng and Federico Sold{\`{a}}}, title = {Scalar and Matrix Chernoff Bounds from {\unicode{120001}}\({}_{\mbox{{\(\infty\)}}}\)-Independence}, journal = {CoRR}, volume = {abs/2111.02177}, year = {2021}, url = {https://arxiv.org/abs/2111.02177}, eprinttype = {arXiv}, eprint = {2111.02177}, timestamp = {Fri, 05 Nov 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/corr/abs-2111-02177.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-2111-09444, author = {Mitali Bafna and Max Hopkins and Tali Kaufman and Shachar Lovett}, title = {Hypercontractivity on High Dimensional Expanders: a Local-to-Global Approach for Higher Moments}, journal = {CoRR}, volume = {abs/2111.09444}, year = {2021}, url = {https://arxiv.org/abs/2111.09444}, eprinttype = {arXiv}, eprint = {2111.09444}, timestamp = {Fri, 26 Nov 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/corr/abs-2111-09444.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/BafnaHKL21, author = {Mitali Bafna and Max Hopkins and Tali Kaufman and Shachar Lovett}, title = {Hypercontractivity on High Dimensional Expanders: a Local-to-Global Approach for Higher Moments}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR21-169}}, year = {2021}, url = {https://eccc.weizmann.ac.il/report/2021/169}, eprinttype = {ECCC}, eprint = {TR21-169}, timestamp = {Tue, 27 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/BafnaHKL21.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/combinatorica/KaufmanO20, author = {Tali Kaufman and Izhar Oppenheim}, title = {High Order Random Walks: Beyond Spectral Gap}, journal = {Comb.}, volume = {40}, number = {2}, pages = {245--281}, year = {2020}, url = {https://doi.org/10.1007/s00493-019-3847-0}, doi = {10.1007/S00493-019-3847-0}, timestamp = {Sun, 25 Jul 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/combinatorica/KaufmanO20.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/approx/KaufmanS20, author = {Tali Kaufman and Ella Sharakanski}, editor = {Jaroslaw Byrka and Raghu Meka}, title = {Chernoff Bound for High-Dimensional Expanders}, booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, {APPROX/RANDOM} 2020, August 17-19, 2020, Virtual Conference}, series = {LIPIcs}, volume = {176}, pages = {25:1--25:22}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2020}, url = {https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2020.25}, doi = {10.4230/LIPICS.APPROX/RANDOM.2020.25}, timestamp = {Wed, 21 Aug 2024 22:46:00 +0200}, biburl = {https://dblp.org/rec/conf/approx/KaufmanS20.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/focs/EvraKZ20, author = {Shai Evra and Tali Kaufman and Gilles Z{\'{e}}mor}, editor = {Sandy Irani}, title = {Decodable quantum {LDPC} codes beyond the square root distance barrier using high dimensional expanders}, booktitle = {61st {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS} 2020, Durham, NC, USA, November 16-19, 2020}, pages = {218--227}, publisher = {{IEEE}}, year = {2020}, url = {https://doi.org/10.1109/FOCS46700.2020.00029}, doi = {10.1109/FOCS46700.2020.00029}, timestamp = {Wed, 15 Dec 2021 10:49:16 +0100}, biburl = {https://dblp.org/rec/conf/focs/EvraKZ20.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/innovations/KaufmanM20, author = {Tali Kaufman and David Mass}, editor = {Thomas Vidick}, title = {Local-To-Global Agreement Expansion via the Variance Method}, booktitle = {11th Innovations in Theoretical Computer Science Conference, {ITCS} 2020, January 12-14, 2020, Seattle, Washington, {USA}}, series = {LIPIcs}, volume = {151}, pages = {74:1--74:14}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2020}, url = {https://doi.org/10.4230/LIPIcs.ITCS.2020.74}, doi = {10.4230/LIPICS.ITCS.2020.74}, timestamp = {Wed, 21 Aug 2024 22:46:00 +0200}, biburl = {https://dblp.org/rec/conf/innovations/KaufmanM20.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-2004-07935, author = {Shai Evra and Tali Kaufman and Gilles Z{\'{e}}mor}, title = {Decodable quantum {LDPC} codes beyond the {\(\surd\)}n distance barrier using high dimensional expanders}, journal = {CoRR}, volume = {abs/2004.07935}, year = {2020}, url = {https://arxiv.org/abs/2004.07935}, eprinttype = {arXiv}, eprint = {2004.07935}, timestamp = {Thu, 23 Apr 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-2004-07935.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-2008-09495, author = {Tali Kaufman and Ran J. Tessler}, title = {Quantum {LDPC} codes with {\(\Omega\)}({\(\surd\)}n log\({}^{\mbox{k}}\)n) distance, for any k}, journal = {CoRR}, volume = {abs/2008.09495}, year = {2020}, url = {https://arxiv.org/abs/2008.09495}, eprinttype = {arXiv}, eprint = {2008.09495}, timestamp = {Fri, 28 Aug 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-2008-09495.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-2011-04658, author = {Max Hopkins and Tali Kaufman and Shachar Lovett}, title = {High Dimensional Expanders: Random Walks, Pseudorandomness, and Unique Games}, journal = {CoRR}, volume = {abs/2011.04658}, year = {2020}, url = {https://arxiv.org/abs/2011.04658}, eprinttype = {arXiv}, eprint = {2011.04658}, timestamp = {Thu, 12 Nov 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/corr/abs-2011-04658.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/HopkinsKL20, author = {Max Hopkins and Tali Kaufman and Shachar Lovett}, title = {High Dimensional Expanders: Random Walks, Pseudorandomness, and Unique Games}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR20-170}}, year = {2020}, url = {https://eccc.weizmann.ac.il/report/2020/170}, eprinttype = {ECCC}, eprint = {TR20-170}, timestamp = {Tue, 27 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/HopkinsKL20.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/approx/GotlibK19, author = {Roy Gotlib and Tali Kaufman}, editor = {Dimitris Achlioptas and L{\'{a}}szl{\'{o}} A. V{\'{e}}gh}, title = {Testing Odd Direct Sums Using High Dimensional Expanders}, booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, {APPROX/RANDOM} 2019, September 20-22, 2019, Massachusetts Institute of Technology, Cambridge, MA, {USA}}, series = {LIPIcs}, volume = {145}, pages = {50:1--50:20}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2019}, url = {https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2019.50}, doi = {10.4230/LIPICS.APPROX-RANDOM.2019.50}, timestamp = {Wed, 21 Aug 2024 22:46:00 +0200}, biburl = {https://dblp.org/rec/conf/approx/GotlibK19.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/innovations/DinurHKR19, author = {Irit Dinur and Prahladh Harsha and Tali Kaufman and Noga Ron{-}Zewi}, editor = {Avrim Blum}, title = {From Local to Robust Testing via Agreement Testing}, booktitle = {10th Innovations in Theoretical Computer Science Conference, {ITCS} 2019, January 10-12, 2019, San Diego, California, {USA}}, series = {LIPIcs}, volume = {124}, pages = {29:1--29:18}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2019}, url = {https://doi.org/10.4230/LIPIcs.ITCS.2019.29}, doi = {10.4230/LIPICS.ITCS.2019.29}, timestamp = {Sat, 30 Sep 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/innovations/DinurHKR19.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/soda/DinurHKNT19, author = {Irit Dinur and Prahladh Harsha and Tali Kaufman and Inbal Livni Navon and Amnon Ta{-}Shma}, editor = {Timothy M. Chan}, title = {List Decoding with Double Samplers}, booktitle = {Proceedings of the Thirtieth Annual {ACM-SIAM} Symposium on Discrete Algorithms, {SODA} 2019, San Diego, California, USA, January 6-9, 2019}, pages = {2134--2153}, publisher = {{SIAM}}, year = {2019}, url = {https://doi.org/10.1137/1.9781611975482.129}, doi = {10.1137/1.9781611975482.129}, timestamp = {Sat, 30 Sep 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/soda/DinurHKNT19.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/GotlibK19, author = {Roy Gotlib and Tali Kaufman}, title = {Testing Odd Direct Sums Using High Dimensional Expanders}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR19-124}}, year = {2019}, url = {https://eccc.weizmann.ac.il/report/2019/124}, eprinttype = {ECCC}, eprint = {TR19-124}, timestamp = {Tue, 27 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/GotlibK19.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/approx/KaufmanO18, author = {Tali Kaufman and Izhar Oppenheim}, editor = {Eric Blais and Klaus Jansen and Jos{\'{e}} D. P. Rolim and David Steurer}, title = {High Order Random Walks: Beyond Spectral Gap}, booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, {APPROX/RANDOM} 2018, August 20-22, 2018 - Princeton, NJ, {USA}}, series = {LIPIcs}, volume = {116}, pages = {47:1--47:17}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2018}, url = {https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2018.47}, doi = {10.4230/LIPICS.APPROX-RANDOM.2018.47}, timestamp = {Tue, 21 Sep 2021 09:36:24 +0200}, biburl = {https://dblp.org/rec/conf/approx/KaufmanO18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stoc/KaufmanO18, author = {Tali Kaufman and Izhar Oppenheim}, editor = {Ilias Diakonikolas and David Kempe and Monika Henzinger}, title = {Construction of new local spectral high dimensional expanders}, booktitle = {Proceedings of the 50th Annual {ACM} {SIGACT} Symposium on Theory of Computing, {STOC} 2018, Los Angeles, CA, USA, June 25-29, 2018}, pages = {773--786}, publisher = {{ACM}}, year = {2018}, url = {https://doi.org/10.1145/3188745.3188782}, doi = {10.1145/3188745.3188782}, timestamp = {Wed, 25 Sep 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/stoc/KaufmanO18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-1803-02849, author = {Tali Kaufman and David Mass}, title = {Good Distance Lattices from High Dimensional Expanders}, journal = {CoRR}, volume = {abs/1803.02849}, year = {2018}, url = {http://arxiv.org/abs/1803.02849}, eprinttype = {arXiv}, eprint = {1803.02849}, timestamp = {Mon, 13 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-1803-02849.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-1808-00425, author = {Irit Dinur and Prahladh Harsha and Tali Kaufman and Inbal Livni Navon and Amnon Ta{-}Shma}, title = {List Decoding with Double Samplers}, journal = {CoRR}, volume = {abs/1808.00425}, year = {2018}, url = {http://arxiv.org/abs/1808.00425}, eprinttype = {arXiv}, eprint = {1808.00425}, timestamp = {Sun, 02 Sep 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-1808-00425.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/DinurHKNT18, author = {Irit Dinur and Prahladh Harsha and Tali Kaufman and Inbal Livni Navon and Amnon Ta{-}Shma}, title = {List Decoding with Double Samplers}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR18-136}}, year = {2018}, url = {https://eccc.weizmann.ac.il/report/2018/136}, eprinttype = {ECCC}, eprint = {TR18-136}, timestamp = {Tue, 27 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/DinurHKNT18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/DinurKR18, author = {Irit Dinur and Tali Kaufman and Noga Ron{-}Zewi}, title = {From Local to Robust Testing via Agreement Testing}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR18-198}}, year = {2018}, url = {https://eccc.weizmann.ac.il/report/2018/198}, eprinttype = {ECCC}, eprint = {TR18-198}, timestamp = {Tue, 27 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/DinurKR18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/KaufmanM18, author = {Tali Kaufman and David Mass}, title = {Cosystolic Expanders over any Abelian Group}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR18-134}}, year = {2018}, url = {https://eccc.weizmann.ac.il/report/2018/134}, eprinttype = {ECCC}, eprint = {TR18-134}, timestamp = {Tue, 27 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/KaufmanM18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/focs/DinurK17, author = {Irit Dinur and Tali Kaufman}, editor = {Chris Umans}, title = {High Dimensional Expanders Imply Agreement Expanders}, booktitle = {58th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS} 2017, Berkeley, CA, USA, October 15-17, 2017}, pages = {974--985}, publisher = {{IEEE} Computer Society}, year = {2017}, url = {https://doi.org/10.1109/FOCS.2017.94}, doi = {10.1109/FOCS.2017.94}, timestamp = {Sat, 30 Sep 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/focs/DinurK17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/innovations/KaufmanM17, author = {Tali Kaufman and David Mass}, editor = {Christos H. Papadimitriou}, title = {High Dimensional Random Walks and Colorful Expansion}, booktitle = {8th Innovations in Theoretical Computer Science Conference, {ITCS} 2017, January 9-11, 2017, Berkeley, CA, {USA}}, series = {LIPIcs}, volume = {67}, pages = {4:1--4:27}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2017}, url = {https://doi.org/10.4230/LIPIcs.ITCS.2017.4}, doi = {10.4230/LIPICS.ITCS.2017.4}, timestamp = {Tue, 11 Feb 2020 15:52:14 +0100}, biburl = {https://dblp.org/rec/conf/innovations/KaufmanM17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/DinurK17, author = {Irit Dinur and Tali Kaufman}, title = {High dimensional expanders imply agreement expanders}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR17-089}}, year = {2017}, url = {https://eccc.weizmann.ac.il/report/2017/089}, eprinttype = {ECCC}, eprint = {TR17-089}, timestamp = {Tue, 27 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/DinurK17.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/combinatorica/KaufmanW16, author = {Tali Kaufman and Avi Wigderson}, title = {Symmetric {LDPC} codes and local testing}, journal = {Comb.}, volume = {36}, number = {1}, pages = {91--120}, year = {2016}, url = {https://doi.org/10.1007/s00493-014-2715-1}, doi = {10.1007/S00493-014-2715-1}, timestamp = {Wed, 22 Jul 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/combinatorica/KaufmanW16.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/compgeom/DotterrerKW16, author = {Dominic Dotterrer and Tali Kaufman and Uli Wagner}, editor = {S{\'{a}}ndor P. Fekete and Anna Lubiw}, title = {On Expansion and Topological Overlap}, booktitle = {32nd International Symposium on Computational Geometry, SoCG 2016, June 14-18, 2016, Boston, MA, {USA}}, series = {LIPIcs}, volume = {51}, pages = {35:1--35:10}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2016}, url = {https://doi.org/10.4230/LIPIcs.SoCG.2016.35}, doi = {10.4230/LIPICS.SOCG.2016.35}, timestamp = {Wed, 16 Jun 2021 12:03:34 +0200}, biburl = {https://dblp.org/rec/conf/compgeom/DotterrerKW16.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stoc/EvraK16, author = {Shai Evra and Tali Kaufman}, editor = {Daniel Wichs and Yishay Mansour}, title = {Bounded degree cosystolic expanders of every dimension}, booktitle = {Proceedings of the 48th Annual {ACM} {SIGACT} Symposium on Theory of Computing, {STOC} 2016, Cambridge, MA, USA, June 18-21, 2016}, pages = {36--48}, publisher = {{ACM}}, year = {2016}, url = {https://doi.org/10.1145/2897518.2897543}, doi = {10.1145/2897518.2897543}, timestamp = {Tue, 06 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/stoc/EvraK16.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/KaufmanM16, author = {Tali Kaufman and David Mass}, title = {High Dimensional Combinatorial Random Walks and Colorful Expansion}, journal = {CoRR}, volume = {abs/1604.02947}, year = {2016}, url = {http://arxiv.org/abs/1604.02947}, eprinttype = {arXiv}, eprint = {1604.02947}, timestamp = {Mon, 13 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/KaufmanM16.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/KaufmanM16a, author = {Tali Kaufman and David Mass}, title = {Walking on the Edge and Cosystolic Expansion}, journal = {CoRR}, volume = {abs/1606.01844}, year = {2016}, url = {http://arxiv.org/abs/1606.01844}, eprinttype = {arXiv}, eprint = {1606.01844}, timestamp = {Mon, 13 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/KaufmanM16a.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/DotterrerKW15, author = {Dominic Dotterrer and Tali Kaufman and Uli Wagner}, title = {On Expansion and Topological Overlap}, journal = {CoRR}, volume = {abs/1506.04558}, year = {2015}, url = {http://arxiv.org/abs/1506.04558}, eprinttype = {arXiv}, eprint = {1506.04558}, timestamp = {Mon, 13 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/DotterrerKW15.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/EvraK15, author = {Shai Evra and Tali Kaufman}, title = {Systolic Expanders of Every Dimension}, journal = {CoRR}, volume = {abs/1510.00839}, year = {2015}, url = {http://arxiv.org/abs/1510.00839}, eprinttype = {arXiv}, eprint = {1510.00839}, timestamp = {Mon, 13 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/EvraK15.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/focs/KaufmanKL14, author = {Tali Kaufman and David Kazhdan and Alexander Lubotzky}, title = {Ramanujan Complexes and Bounded Degree Topological Expanders}, booktitle = {55th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS} 2014, Philadelphia, PA, USA, October 18-21, 2014}, pages = {484--493}, publisher = {{IEEE} Computer Society}, year = {2014}, url = {https://doi.org/10.1109/FOCS.2014.58}, doi = {10.1109/FOCS.2014.58}, timestamp = {Thu, 23 Mar 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/focs/KaufmanKL14.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/innovations/KaufmanL14, author = {Tali Kaufman and Alexander Lubotzky}, editor = {Moni Naor}, title = {High dimensional expanders and property testing}, booktitle = {Innovations in Theoretical Computer Science, ITCS'14, Princeton, NJ, USA, January 12-14, 2014}, pages = {501--506}, publisher = {{ACM}}, year = {2014}, url = {https://doi.org/10.1145/2554797.2554842}, doi = {10.1145/2554797.2554842}, timestamp = {Sun, 25 Oct 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/innovations/KaufmanL14.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/KaufmanKL14, author = {Tali Kaufman and David Kazhdan and Alexander Lubotzky}, title = {Ramanujan Complexes and bounded degree topological expanders}, journal = {CoRR}, volume = {abs/1408.6351}, year = {2014}, url = {http://arxiv.org/abs/1408.6351}, eprinttype = {arXiv}, eprint = {1408.6351}, timestamp = {Mon, 13 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/KaufmanKL14.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/KaufmanKL14a, author = {Tali Kaufman and David Kazhdan and Alexander Lubotzky}, title = {Isoperimetric Inequalities for Ramanujan Complexes and Topological Expanders}, journal = {CoRR}, volume = {abs/1409.1397}, year = {2014}, url = {http://arxiv.org/abs/1409.1397}, eprinttype = {arXiv}, eprint = {1409.1397}, timestamp = {Mon, 13 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/KaufmanKL14a.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/cc/Ben-EliezerKKR13, author = {Ido Ben{-}Eliezer and Tali Kaufman and Michael Krivelevich and Dana Ron}, title = {Comparing the strength of query types in property testing: The case of k-colorability}, journal = {Comput. Complex.}, volume = {22}, number = {1}, pages = {89--135}, year = {2013}, url = {https://doi.org/10.1007/s00037-012-0048-2}, doi = {10.1007/S00037-012-0048-2}, timestamp = {Sun, 15 Mar 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/cc/Ben-EliezerKKR13.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/cc/GrigorescuKS13, author = {Elena Grigorescu and Tali Kaufman and Madhu Sudan}, title = {2-Transitivity is Insufficient for Local Testability}, journal = {Comput. Complex.}, volume = {22}, number = {1}, pages = {137--158}, year = {2013}, url = {https://doi.org/10.1007/s00037-012-0055-3}, doi = {10.1007/S00037-012-0055-3}, timestamp = {Tue, 14 Jun 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/cc/GrigorescuKS13.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/KaufmanL13, author = {Tali Kaufman and Alexander Lubotzky}, title = {High Dimensional Expanders and Property Testing}, journal = {CoRR}, volume = {abs/1312.2367}, year = {2013}, url = {http://arxiv.org/abs/1312.2367}, eprinttype = {arXiv}, eprint = {1312.2367}, timestamp = {Mon, 13 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/KaufmanL13.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/siamdm/GrigorescuKS12, author = {Elena Grigorescu and Tali Kaufman and Madhu Sudan}, title = {Succinct Representation of Codes with Applications to Testing}, journal = {{SIAM} J. Discret. Math.}, volume = {26}, number = {4}, pages = {1618--1634}, year = {2012}, url = {https://doi.org/10.1137/100818364}, doi = {10.1137/100818364}, timestamp = {Tue, 14 Jun 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/siamdm/GrigorescuKS12.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tit/GrigorescuK12, author = {Elena Grigorescu and Tali Kaufman}, title = {Explicit Low-Weight Bases for {BCH} Codes}, journal = {{IEEE} Trans. Inf. Theory}, volume = {58}, number = {1}, pages = {78--81}, year = {2012}, url = {https://doi.org/10.1109/TIT.2011.2167739}, doi = {10.1109/TIT.2011.2167739}, timestamp = {Tue, 10 Mar 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/tit/GrigorescuK12.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tit/KaufmanLP12, author = {Tali Kaufman and Shachar Lovett and Ely Porat}, title = {Weight Distribution and List-Decoding Size of Reed-Muller Codes}, journal = {{IEEE} Trans. Inf. Theory}, volume = {58}, number = {5}, pages = {2689--2696}, year = {2012}, url = {https://doi.org/10.1109/TIT.2012.2184841}, doi = {10.1109/TIT.2012.2184841}, timestamp = {Mon, 15 Jun 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/tit/KaufmanLP12.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stoc/KaufmanL12, author = {Tali Kaufman and Alexander Lubotzky}, editor = {Howard J. Karloff and Toniann Pitassi}, title = {Edge transitive ramanujan graphs and symmetric {LDPC} good codes}, booktitle = {Proceedings of the 44th Symposium on Theory of Computing Conference, {STOC} 2012, New York, NY, USA, May 19 - 22, 2012}, pages = {359--366}, publisher = {{ACM}}, year = {2012}, url = {https://doi.org/10.1145/2213977.2214011}, doi = {10.1145/2213977.2214011}, timestamp = {Sun, 25 Oct 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/stoc/KaufmanL12.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/approx/DinurK11, author = {Irit Dinur and Tali Kaufman}, editor = {Leslie Ann Goldberg and Klaus Jansen and R. Ravi and Jos{\'{e}} D. P. Rolim}, title = {Dense Locally Testable Codes Cannot Have Constant Rate and Distance}, booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques - 14th International Workshop, {APPROX} 2011, and 15th International Workshop, {RANDOM} 2011, Princeton, NJ, USA, August 17-19, 2011. Proceedings}, series = {Lecture Notes in Computer Science}, volume = {6845}, pages = {507--518}, publisher = {Springer}, year = {2011}, url = {https://doi.org/10.1007/978-3-642-22935-0\_43}, doi = {10.1007/978-3-642-22935-0\_43}, timestamp = {Sat, 30 Sep 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/approx/DinurK11.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/approx/GoldreichK11, author = {Oded Goldreich and Tali Kaufman}, editor = {Leslie Ann Goldberg and Klaus Jansen and R. Ravi and Jos{\'{e}} D. P. Rolim}, title = {Proximity Oblivious Testing and the Role of Invariances}, booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques - 14th International Workshop, {APPROX} 2011, and 15th International Workshop, {RANDOM} 2011, Princeton, NJ, USA, August 17-19, 2011. Proceedings}, series = {Lecture Notes in Computer Science}, volume = {6845}, pages = {579--592}, publisher = {Springer}, year = {2011}, url = {https://doi.org/10.1007/978-3-642-22935-0\_49}, doi = {10.1007/978-3-642-22935-0\_49}, timestamp = {Fri, 02 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/approx/GoldreichK11.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/focs/KaufmanL11, author = {Tali Kaufman and Shachar Lovett}, editor = {Rafail Ostrovsky}, title = {New Extension of the Weil Bound for Character Sums with Applications to Coding}, booktitle = {{IEEE} 52nd Annual Symposium on Foundations of Computer Science, {FOCS} 2011, Palm Springs, CA, USA, October 22-25, 2011}, pages = {788--796}, publisher = {{IEEE} Computer Society}, year = {2011}, url = {https://doi.org/10.1109/FOCS.2011.41}, doi = {10.1109/FOCS.2011.41}, timestamp = {Thu, 23 Mar 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/focs/KaufmanL11.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@incollection{DBLP:books/sp/goldreich2011/GoldreichK11, author = {Oded Goldreich and Tali Kaufman}, editor = {Oded Goldreich}, title = {Proximity Oblivious Testing and the Role of Invariances}, booktitle = {Studies in Complexity and Cryptography. Miscellanea on the Interplay between Randomness and Computation - In Collaboration with Lidor Avigad, Mihir Bellare, Zvika Brakerski, Shafi Goldwasser, Shai Halevi, Tali Kaufman, Leonid Levin, Noam Nisan, Dana Ron, Madhu Sudan, Luca Trevisan, Salil Vadhan, Avi Wigderson, David Zuckerman}, series = {Lecture Notes in Computer Science}, volume = {6650}, pages = {173--190}, publisher = {Springer}, year = {2011}, url = {https://doi.org/10.1007/978-3-642-22670-0\_19}, doi = {10.1007/978-3-642-22670-0\_19}, timestamp = {Tue, 14 May 2019 10:00:35 +0200}, biburl = {https://dblp.org/rec/books/sp/goldreich2011/GoldreichK11.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-1108-2960, author = {Tali Kaufman and Alexander Lubotzky}, title = {Edge Transitive Ramanujan Graphs and Highly Symmetric {LDPC} Good Codes}, journal = {CoRR}, volume = {abs/1108.2960}, year = {2011}, url = {http://arxiv.org/abs/1108.2960}, eprinttype = {arXiv}, eprint = {1108.2960}, timestamp = {Mon, 13 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-1108-2960.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/DinurK11, author = {Irit Dinur and Tali Kaufman}, title = {Dense locally testable codes cannot have constant rate and distance}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR11-055}}, year = {2011}, url = {https://eccc.weizmann.ac.il/report/2011/055}, eprinttype = {ECCC}, eprint = {TR11-055}, timestamp = {Tue, 27 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/DinurK11.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/siamcomp/KaufmanLX10, author = {Tali Kaufman and Simon Litsyn and Ning Xie}, title = {Breaking the Epsilon-Soundness Bound of the Linearity Test over {GF(2)}}, journal = {{SIAM} J. Comput.}, volume = {39}, number = {5}, pages = {1988--2003}, year = {2010}, url = {https://doi.org/10.1137/080715548}, doi = {10.1137/080715548}, timestamp = {Sat, 27 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/siamcomp/KaufmanLX10.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/siamcomp/Ben-SassonGKSV10, author = {Eli Ben{-}Sasson and Venkatesan Guruswami and Tali Kaufman and Madhu Sudan and Michael Viderman}, title = {Locally Testable Codes Require Redundant Testers}, journal = {{SIAM} J. Comput.}, volume = {39}, number = {7}, pages = {3230--3247}, year = {2010}, url = {https://doi.org/10.1137/090779875}, doi = {10.1137/090779875}, timestamp = {Tue, 14 Jun 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/siamcomp/Ben-SassonGKSV10.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/approx/KaufmanV10, author = {Tali Kaufman and Michael Viderman}, editor = {Maria J. Serna and Ronen Shaltiel and Klaus Jansen and Jos{\'{e}} D. P. Rolim}, title = {Locally Testable vs. Locally Decodable Codes}, booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, 13th International Workshop, {APPROX} 2010, and 14th International Workshop, {RANDOM} 2010, Barcelona, Spain, September 1-3, 2010. Proceedings}, series = {Lecture Notes in Computer Science}, volume = {6302}, pages = {670--682}, publisher = {Springer}, year = {2010}, url = {https://doi.org/10.1007/978-3-642-15369-3\_50}, doi = {10.1007/978-3-642-15369-3\_50}, timestamp = {Tue, 21 Sep 2021 09:36:24 +0200}, biburl = {https://dblp.org/rec/conf/approx/KaufmanV10.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/innovations/KaufmanW10, author = {Tali Kaufman and Avi Wigderson}, editor = {Andrew Chi{-}Chih Yao}, title = {Symmetric {LDPC} Codes and Local Testing}, booktitle = {Innovations in Computer Science - {ICS} 2010, Tsinghua University, Beijing, China, January 5-7, 2010. Proceedings}, pages = {406--421}, publisher = {Tsinghua University Press}, year = {2010}, url = {http://conference.iiis.tsinghua.edu.cn/ICS2010/content/papers/32.html}, timestamp = {Wed, 04 Sep 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/innovations/KaufmanW10.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/innovations/KaufmanLP10, author = {Tali Kaufman and Shachar Lovett and Ely Porat}, editor = {Andrew Chi{-}Chih Yao}, title = {Weight Distribution and List-Decoding Size of Reed-Muller Codes}, booktitle = {Innovations in Computer Science - {ICS} 2010, Tsinghua University, Beijing, China, January 5-7, 2010. Proceedings}, pages = {422--433}, publisher = {Tsinghua University Press}, year = {2010}, url = {http://conference.iiis.tsinghua.edu.cn/ICS2010/content/papers/33.html}, timestamp = {Wed, 04 Sep 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/innovations/KaufmanLP10.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/itw/Kaufman10, author = {Tali Kaufman}, editor = {Marcus Greferath and Joachim Rosenthal and Alexander Barg and Gilles Z{\'{e}}mor}, title = {Local computation in codes}, booktitle = {2010 {IEEE} Information Theory Workshop, {ITW} 2010, Dublin, Ireland, August 30 - September 3, 2010}, pages = {1--5}, publisher = {{IEEE}}, year = {2010}, url = {https://doi.org/10.1109/CIG.2010.5592932}, doi = {10.1109/CIG.2010.5592932}, timestamp = {Mon, 09 Aug 2021 14:54:02 +0200}, biburl = {https://dblp.org/rec/conf/itw/Kaufman10.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@incollection{DBLP:conf/propertytesting/Ben-EliezerKKR10, author = {Ido Ben{-}Eliezer and Tali Kaufman and Michael Krivelevich and Dana Ron}, editor = {Oded Goldreich}, title = {Comparing the Strength of Query Types in Property Testing: The Case of Testing \emph{k}-Colorability}, booktitle = {Property Testing - Current Research and Surveys}, series = {Lecture Notes in Computer Science}, volume = {6390}, pages = {253--259}, publisher = {Springer}, year = {2010}, url = {https://doi.org/10.1007/978-3-642-16367-8\_17}, doi = {10.1007/978-3-642-16367-8\_17}, timestamp = {Tue, 01 Jun 2021 15:22:56 +0200}, biburl = {https://dblp.org/rec/conf/propertytesting/Ben-EliezerKKR10.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@incollection{DBLP:conf/propertytesting/KaufmanW10, author = {Tali Kaufman and Avi Wigderson}, editor = {Oded Goldreich}, title = {Symmetric {LDPC} Codes and Local Testing}, booktitle = {Property Testing - Current Research and Surveys}, series = {Lecture Notes in Computer Science}, volume = {6390}, pages = {312--319}, publisher = {Springer}, year = {2010}, url = {https://doi.org/10.1007/978-3-642-16367-8\_25}, doi = {10.1007/978-3-642-16367-8\_25}, timestamp = {Wed, 01 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/propertytesting/KaufmanW10.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-1012-2738, author = {Irit Dinur and Tali Kaufman}, title = {Dense locally testable codes cannot have constant rate and distance}, journal = {CoRR}, volume = {abs/1012.2738}, year = {2010}, url = {http://arxiv.org/abs/1012.2738}, eprinttype = {arXiv}, eprint = {1012.2738}, timestamp = {Mon, 13 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-1012-2738.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/GoldreichK10, author = {Oded Goldreich and Tali Kaufman}, title = {Proximity Oblivious Testing and the Role of Invariances}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR10-058}}, year = {2010}, url = {https://eccc.weizmann.ac.il/report/2010/058}, eprinttype = {ECCC}, eprint = {TR10-058}, timestamp = {Tue, 27 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/GoldreichK10.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/KaufmanL10, author = {Tali Kaufman and Shachar Lovett}, title = {Testing of exponentially large codes, by a new extension to Weil bound for character sums}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR10-065}}, year = {2010}, url = {https://eccc.weizmann.ac.il/report/2010/065}, eprinttype = {ECCC}, eprint = {TR10-065}, timestamp = {Tue, 27 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/KaufmanL10.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/KaufmanV10, author = {Tali Kaufman and Michael Viderman}, title = {Locally Testable vs. Locally Decodable Codes}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR10-130}}, year = {2010}, url = {https://eccc.weizmann.ac.il/report/2010/130}, eprinttype = {ECCC}, eprint = {TR10-130}, timestamp = {Tue, 27 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/KaufmanV10.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/approx/GrigorescuKS09, author = {Elena Grigorescu and Tali Kaufman and Madhu Sudan}, editor = {Irit Dinur and Klaus Jansen and Joseph Naor and Jos{\'{e}} D. P. Rolim}, title = {Succinct Representation of Codes with Applications to Testing}, booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, 12th International Workshop, {APPROX} 2009, and 13th International Workshop, {RANDOM} 2009, Berkeley, CA, USA, August 21-23, 2009. Proceedings}, series = {Lecture Notes in Computer Science}, volume = {5687}, pages = {534--547}, publisher = {Springer}, year = {2009}, url = {https://doi.org/10.1007/978-3-642-03685-9\_40}, doi = {10.1007/978-3-642-03685-9\_40}, timestamp = {Tue, 14 Jun 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/approx/GrigorescuKS09.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/coco/Ben-SassonGKSV09, author = {Eli Ben{-}Sasson and Venkatesan Guruswami and Tali Kaufman and Madhu Sudan and Michael Viderman}, title = {Locally Testable Codes Require Redundant Testers}, booktitle = {Proceedings of the 24th Annual {IEEE} Conference on Computational Complexity, {CCC} 2009, Paris, France, 15-18 July 2009}, pages = {52--61}, publisher = {{IEEE} Computer Society}, year = {2009}, url = {https://doi.org/10.1109/CCC.2009.6}, doi = {10.1109/CCC.2009.6}, timestamp = {Fri, 24 Mar 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/coco/Ben-SassonGKSV09.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-0905-2919, author = {Elena Grigorescu and Tali Kaufman and Madhu Sudan}, title = {Succinct Representation of Codes with Applications to Testing}, journal = {CoRR}, volume = {abs/0905.2919}, year = {2009}, url = {http://arxiv.org/abs/0905.2919}, eprinttype = {arXiv}, eprint = {0905.2919}, timestamp = {Tue, 14 Jun 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-0905-2919.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/Ben-SassonGKSV09, author = {Eli Ben{-}Sasson and Venkatesan Guruswami and Tali Kaufman and Madhu Sudan and Michael Viderman}, title = {Locally Testable Codes Require Redundant Testers}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR09-126}}, year = {2009}, url = {https://eccc.weizmann.ac.il/report/2009/126}, eprinttype = {ECCC}, eprint = {TR09-126}, timestamp = {Tue, 27 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/Ben-SassonGKSV09.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/GrigorescuKS09, author = {Elena Grigorescu and Tali Kaufman and Madhu Sudan}, title = {Succinct Representation of Codes with Applications to Testing}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR09-043}}, year = {2009}, url = {https://eccc.weizmann.ac.il/report/2009/043}, eprinttype = {ECCC}, eprint = {TR09-043}, timestamp = {Tue, 27 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/GrigorescuKS09.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/siamdm/AlonKKR08, author = {Noga Alon and Tali Kaufman and Michael Krivelevich and Dana Ron}, title = {Testing Triangle-Freeness in General Graphs}, journal = {{SIAM} J. Discret. Math.}, volume = {22}, number = {2}, pages = {786--819}, year = {2008}, url = {https://doi.org/10.1137/07067917X}, doi = {10.1137/07067917X}, timestamp = {Sat, 25 Apr 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/siamdm/AlonKKR08.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/approx/KaufmanLX08, author = {Tali Kaufman and Simon Litsyn and Ning Xie}, editor = {Ashish Goel and Klaus Jansen and Jos{\'{e}} D. P. Rolim and Ronitt Rubinfeld}, title = {Breaking the epsilon-Soundness Bound of the Linearity Test over {GF(2)}}, booktitle = {Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques, 11th International Workshop, {APPROX} 2008, and 12th International Workshop, {RANDOM} 2008, Boston, MA, USA, August 25-27, 2008. Proceedings}, series = {Lecture Notes in Computer Science}, volume = {5171}, pages = {498--511}, publisher = {Springer}, year = {2008}, url = {https://doi.org/10.1007/978-3-540-85363-3\_39}, doi = {10.1007/978-3-540-85363-3\_39}, timestamp = {Tue, 21 Sep 2021 09:36:24 +0200}, biburl = {https://dblp.org/rec/conf/approx/KaufmanLX08.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/coco/GrigorescuKS08, author = {Elena Grigorescu and Tali Kaufman and Madhu Sudan}, title = {2-Transitivity Is Insufficient for Local Testability}, booktitle = {Proceedings of the 23rd Annual {IEEE} Conference on Computational Complexity, {CCC} 2008, 23-26 June 2008, College Park, Maryland, {USA}}, pages = {259--267}, publisher = {{IEEE} Computer Society}, year = {2008}, url = {https://doi.org/10.1109/CCC.2008.31}, doi = {10.1109/CCC.2008.31}, timestamp = {Fri, 24 Mar 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/coco/GrigorescuKS08.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/focs/KaufmanL08, author = {Tali Kaufman and Shachar Lovett}, title = {Worst Case to Average Case Reductions for Polynomials}, booktitle = {49th Annual {IEEE} Symposium on Foundations of Computer Science, {FOCS} 2008, October 25-28, 2008, Philadelphia, PA, {USA}}, pages = {166--175}, publisher = {{IEEE} Computer Society}, year = {2008}, url = {https://doi.org/10.1109/FOCS.2008.17}, doi = {10.1109/FOCS.2008.17}, timestamp = {Thu, 23 Mar 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/focs/KaufmanL08.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/soda/Ben-EliezerKKR08, author = {Ido Ben{-}Eliezer and Tali Kaufman and Michael Krivelevich and Dana Ron}, editor = {Shang{-}Hua Teng}, title = {Comparing the strength of query types in property testing: the case of testing \emph{k}-colorability}, booktitle = {Proceedings of the Nineteenth Annual {ACM-SIAM} Symposium on Discrete Algorithms, {SODA} 2008, San Francisco, California, USA, January 20-22, 2008}, pages = {1213--1222}, publisher = {{SIAM}}, year = {2008}, url = {http://dl.acm.org/citation.cfm?id=1347082.1347214}, timestamp = {Fri, 07 Dec 2012 17:02:08 +0100}, biburl = {https://dblp.org/rec/conf/soda/Ben-EliezerKKR08.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stoc/GoldwasserGHKR08, author = {Shafi Goldwasser and Dan Gutfreund and Alexander Healy and Tali Kaufman and Guy N. Rothblum}, editor = {Cynthia Dwork}, title = {A (de)constructive approach to program checking}, booktitle = {Proceedings of the 40th Annual {ACM} Symposium on Theory of Computing, Victoria, British Columbia, Canada, May 17-20, 2008}, pages = {143--152}, publisher = {{ACM}}, year = {2008}, url = {https://doi.org/10.1145/1374376.1374399}, doi = {10.1145/1374376.1374399}, timestamp = {Tue, 06 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/stoc/GoldwasserGHKR08.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stoc/KaufmanS08, author = {Tali Kaufman and Madhu Sudan}, editor = {Cynthia Dwork}, title = {Algebraic property testing: the role of invariance}, booktitle = {Proceedings of the 40th Annual {ACM} Symposium on Theory of Computing, Victoria, British Columbia, Canada, May 17-20, 2008}, pages = {403--412}, publisher = {{ACM}}, year = {2008}, url = {https://doi.org/10.1145/1374376.1374434}, doi = {10.1145/1374376.1374434}, timestamp = {Tue, 14 Jun 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/stoc/KaufmanS08.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/dagstuhl/KaufmanLX08, author = {Tali Kaufman and Simon Litsyn and Ning Xie}, editor = {Artur Czumaj and S. Muthu Muthukrishnan and Ronitt Rubinfeld and Christian Sohler}, title = {Breaking the {\(\epsilon\)}-Soundness Bound of the Linearity Test over {GF(2)}}, booktitle = {Sublinear Algorithms, 17.08. - 22.08.2008}, series = {Dagstuhl Seminar Proceedings}, volume = {08341}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik, Germany}, year = {2008}, url = {http://drops.dagstuhl.de/opus/volltexte/2008/1697/}, timestamp = {Mon, 26 Jun 2023 20:44:06 +0200}, biburl = {https://dblp.org/rec/conf/dagstuhl/KaufmanLX08.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-0811-2356, author = {Tali Kaufman and Shachar Lovett}, title = {The List-Decoding Size of Reed-Muller Codes}, journal = {CoRR}, volume = {abs/0811.2356}, year = {2008}, url = {http://arxiv.org/abs/0811.2356}, eprinttype = {arXiv}, eprint = {0811.2356}, timestamp = {Mon, 13 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-0811-2356.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/GrigorescuKS08, author = {Elena Grigorescu and Tali Kaufman and Madhu Sudan}, title = {2-Transitivity is Insufficient for Local Testability}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR08-033}}, year = {2008}, url = {https://eccc.weizmann.ac.il/eccc-reports/2008/TR08-033/index.html}, eprinttype = {ECCC}, eprint = {TR08-033}, timestamp = {Wed, 28 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/GrigorescuKS08.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/LovettK08, author = {Shachar Lovett and Tali Kaufman}, title = {Worst case to Average case reductions for polynomials}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR08-072}}, year = {2008}, url = {https://eccc.weizmann.ac.il/eccc-reports/2008/TR08-072/index.html}, eprinttype = {ECCC}, eprint = {TR08-072}, timestamp = {Wed, 28 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/LovettK08.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/LovettK08a, author = {Shachar Lovett and Tali Kaufman}, title = {The List-Decoding Size of Reed-Muller Codes}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR08-111}}, year = {2008}, url = {https://eccc.weizmann.ac.il/eccc-reports/2008/TR08-111/index.html}, eprinttype = {ECCC}, eprint = {TR08-111}, timestamp = {Wed, 28 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/LovettK08a.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/talg/AlonGKS07, author = {Noga Alon and Venkatesan Guruswami and Tali Kaufman and Madhu Sudan}, title = {Guessing secrets efficiently via list decoding}, journal = {{ACM} Trans. Algorithms}, volume = {3}, number = {4}, pages = {42}, year = {2007}, url = {https://doi.org/10.1145/1290672.1290679}, doi = {10.1145/1290672.1290679}, timestamp = {Tue, 14 Jun 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/talg/AlonGKS07.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/focs/KaufmanS07, author = {Tali Kaufman and Madhu Sudan}, title = {Sparse Random Linear Codes are Locally Decodable and Testable}, booktitle = {48th Annual {IEEE} Symposium on Foundations of Computer Science {(FOCS} 2007), October 20-23, 2007, Providence, RI, USA, Proceedings}, pages = {590--600}, publisher = {{IEEE} Computer Society}, year = {2007}, url = {https://doi.org/10.1109/FOCS.2007.65}, doi = {10.1109/FOCS.2007.65}, timestamp = {Thu, 23 Mar 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/focs/KaufmanS07.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stoc/GoldwasserGHKR07, author = {Shafi Goldwasser and Dan Gutfreund and Alexander Healy and Tali Kaufman and Guy N. Rothblum}, editor = {David S. Johnson and Uriel Feige}, title = {Verifying and decoding in constant depth}, booktitle = {Proceedings of the 39th Annual {ACM} Symposium on Theory of Computing, San Diego, California, USA, June 11-13, 2007}, pages = {440--449}, publisher = {{ACM}}, year = {2007}, url = {https://doi.org/10.1145/1250790.1250855}, doi = {10.1145/1250790.1250855}, timestamp = {Tue, 06 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/stoc/GoldwasserGHKR07.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stoc/AlonAKMRX07, author = {Noga Alon and Alexandr Andoni and Tali Kaufman and Kevin Matulef and Ronitt Rubinfeld and Ning Xie}, editor = {David S. Johnson and Uriel Feige}, title = {Testing k-wise and almost k-wise independence}, booktitle = {Proceedings of the 39th Annual {ACM} Symposium on Theory of Computing, San Diego, California, USA, June 11-13, 2007}, pages = {496--505}, publisher = {{ACM}}, year = {2007}, url = {https://doi.org/10.1145/1250790.1250863}, doi = {10.1145/1250790.1250863}, timestamp = {Wed, 14 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/stoc/AlonAKMRX07.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/GoldwasserGHKR07, author = {Shafi Goldwasser and Dan Gutfreund and Alexander Healy and Tali Kaufman and Guy N. Rothblum}, title = {A (De)constructive Approach to Program Checking}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR07-047}}, year = {2007}, url = {https://eccc.weizmann.ac.il/eccc-reports/2007/TR07-047/index.html}, eprinttype = {ECCC}, eprint = {TR07-047}, timestamp = {Wed, 28 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/GoldwasserGHKR07.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/KaufmanLX07, author = {Tali Kaufman and Simon Litsyn and Ning Xie}, title = {Breaking the {\(\epsilon\)}-Soundness Bound of the Linearity Test over {GF(2)}}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR07-098}}, year = {2007}, url = {https://eccc.weizmann.ac.il/eccc-reports/2007/TR07-098/index.html}, eprinttype = {ECCC}, eprint = {TR07-098}, timestamp = {Wed, 28 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/KaufmanLX07.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/KaufmanS07, author = {Tali Kaufman and Madhu Sudan}, title = {Sparse Random Linear Codes are Locally Decodable and Testable}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR07-060}}, year = {2007}, url = {https://eccc.weizmann.ac.il/eccc-reports/2007/TR07-060/index.html}, eprinttype = {ECCC}, eprint = {TR07-060}, timestamp = {Wed, 28 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/KaufmanS07.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/KaufmanS07a, author = {Tali Kaufman and Madhu Sudan}, title = {Algebraic Property Testing: The Role of Invariance}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR07-111}}, year = {2007}, url = {https://eccc.weizmann.ac.il/eccc-reports/2007/TR07-111/index.html}, eprinttype = {ECCC}, eprint = {TR07-111}, timestamp = {Wed, 28 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/KaufmanS07a.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/siamcomp/KaufmanR06, author = {Tali Kaufman and Dana Ron}, title = {Testing Polynomials over General Fields}, journal = {{SIAM} J. Comput.}, volume = {36}, number = {3}, pages = {779--802}, year = {2006}, url = {https://doi.org/10.1137/S0097539704445615}, doi = {10.1137/S0097539704445615}, timestamp = {Fri, 02 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/siamcomp/KaufmanR06.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/aaecc/KaufmanL06, author = {Tali Kaufman and Simon Litsyn}, editor = {Marc P. C. Fossorier and Hideki Imai and Shu Lin and Alain Poli}, title = {Long Extended {BCH} Codes Are Spanned by Minimum Weight Words}, booktitle = {Applied Algebra, Algebraic Algorithms and Error-Correcting Codes, 16th International Symposium, AAECC-16, Las Vegas, NV, USA, February 20-24, 2006, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {3857}, pages = {285--294}, publisher = {Springer}, year = {2006}, url = {https://doi.org/10.1007/11617983\_28}, doi = {10.1007/11617983\_28}, timestamp = {Thu, 10 Sep 2020 17:39:08 +0200}, biburl = {https://dblp.org/rec/conf/aaecc/KaufmanL06.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/soda/AlonKKR06, author = {Noga Alon and Tali Kaufman and Michael Krivelevich and Dana Ron}, title = {Testing triangle-freeness in general graphs}, booktitle = {Proceedings of the Seventeenth Annual {ACM-SIAM} Symposium on Discrete Algorithms, {SODA} 2006, Miami, Florida, USA, January 22-26, 2006}, pages = {279--288}, publisher = {{ACM} Press}, year = {2006}, url = {http://dl.acm.org/citation.cfm?id=1109557.1109589}, timestamp = {Fri, 07 Dec 2012 17:02:08 +0100}, biburl = {https://dblp.org/rec/conf/soda/AlonKKR06.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@phdthesis{DBLP:phd/il/Kaufman05, author = {Tali Kaufman}, title = {Property testing of graphs and codes}, school = {Tel Aviv University, Israel}, year = {2005}, url = {https://tau.primo.exlibrisgroup.com/permalink/972TAU\_INST/bai57q/alma990020479460204146}, timestamp = {Fri, 03 Nov 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/phd/il/Kaufman05.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tit/AlonKKLR05, author = {Noga Alon and Tali Kaufman and Michael Krivelevich and Simon Litsyn and Dana Ron}, title = {Testing Reed-Muller codes}, journal = {{IEEE} Trans. Inf. Theory}, volume = {51}, number = {11}, pages = {4032--4039}, year = {2005}, url = {https://doi.org/10.1109/TIT.2005.856958}, doi = {10.1109/TIT.2005.856958}, timestamp = {Tue, 10 Mar 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/tit/AlonKKLR05.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tit/KaufmanR05, author = {Tali Kaufman and Dana Ron}, title = {A characterization of low-weight words that span generalized reed-muller codes}, journal = {{IEEE} Trans. Inf. Theory}, volume = {51}, number = {11}, pages = {4039--4043}, year = {2005}, url = {https://doi.org/10.1109/TIT.2005.856964}, doi = {10.1109/TIT.2005.856964}, timestamp = {Tue, 10 Mar 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/tit/KaufmanR05.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/focs/KaufmanL05, author = {Tali Kaufman and Simon Litsyn}, title = {Almost Orthogonal Linear Codes are Locally Testable}, booktitle = {46th Annual {IEEE} Symposium on Foundations of Computer Science {(FOCS} 2005), 23-25 October 2005, Pittsburgh, PA, USA, Proceedings}, pages = {317--326}, publisher = {{IEEE} Computer Society}, year = {2005}, url = {https://doi.org/10.1109/SFCS.2005.16}, doi = {10.1109/SFCS.2005.16}, timestamp = {Thu, 23 Mar 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/focs/KaufmanL05.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/siamcomp/KaufmanKR04, author = {Tali Kaufman and Michael Krivelevich and Dana Ron}, title = {Tight Bounds for Testing Bipartiteness in General Graphs}, journal = {{SIAM} J. Comput.}, volume = {33}, number = {6}, pages = {1441--1483}, year = {2004}, url = {https://doi.org/10.1137/S0097539703436424}, doi = {10.1137/S0097539703436424}, timestamp = {Fri, 02 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/siamcomp/KaufmanKR04.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/focs/KaufmanR04, author = {Tali Kaufman and Dana Ron}, title = {Testing Polynomials over General Fields}, booktitle = {45th Symposium on Foundations of Computer Science {(FOCS} 2004), 17-19 October 2004, Rome, Italy, Proceedings}, pages = {413--422}, publisher = {{IEEE} Computer Society}, year = {2004}, url = {https://doi.org/10.1109/FOCS.2004.65}, doi = {10.1109/FOCS.2004.65}, timestamp = {Thu, 23 Mar 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/focs/KaufmanR04.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/random/AlonKKLR03, author = {Noga Alon and Tali Kaufman and Michael Krivelevich and Simon Litsyn and Dana Ron}, editor = {Sanjeev Arora and Klaus Jansen and Jos{\'{e}} D. P. Rolim and Amit Sahai}, title = {Testing Low-Degree Polynomials over {GF(2(}}, booktitle = {Approximation, Randomization, and Combinatorial Optimization: Algorithms and Techniques, 6th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, {APPROX} 2003 and 7th International Workshop on Randomization and Approximation Techniques in Computer Science, {RANDOM} 2003, Princeton, NJ, USA, August 24-26, 2003, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {2764}, pages = {188--199}, publisher = {Springer}, year = {2003}, url = {https://doi.org/10.1007/978-3-540-45198-3\_17}, doi = {10.1007/978-3-540-45198-3\_17}, timestamp = {Tue, 14 May 2019 10:00:48 +0200}, biburl = {https://dblp.org/rec/conf/random/AlonKKLR03.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/random/KaufmanKR03, author = {Tali Kaufman and Michael Krivelevich and Dana Ron}, editor = {Sanjeev Arora and Klaus Jansen and Jos{\'{e}} D. P. Rolim and Amit Sahai}, title = {Tight Bounds for Testing Bipartiteness in General Graphs}, booktitle = {Approximation, Randomization, and Combinatorial Optimization: Algorithms and Techniques, 6th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, {APPROX} 2003 and 7th International Workshop on Randomization and Approximation Techniques in Computer Science, {RANDOM} 2003, Princeton, NJ, USA, August 24-26, 2003, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {2764}, pages = {341--353}, publisher = {Springer}, year = {2003}, url = {https://doi.org/10.1007/978-3-540-45198-3\_29}, doi = {10.1007/978-3-540-45198-3\_29}, timestamp = {Wed, 24 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/random/KaufmanKR03.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/soda/AlonGKS02, author = {Noga Alon and Venkatesan Guruswami and Tali Kaufman and Madhu Sudan}, editor = {David Eppstein}, title = {Guessing secrets efficiently via list decoding}, booktitle = {Proceedings of the Thirteenth Annual {ACM-SIAM} Symposium on Discrete Algorithms, January 6-8, 2002, San Francisco, CA, {USA}}, pages = {254--262}, publisher = {{ACM/SIAM}}, year = {2002}, url = {http://dl.acm.org/citation.cfm?id=545381.545414}, timestamp = {Tue, 14 Jun 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/soda/AlonGKS02.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.