3-query locally decodable codes of subexponential length K Efremenko
Proceedings of the forty-first annual ACM symposium on Theory of computing …, 2009
320 2009 List and unique coding for interactive communication in the presence of adversarial noise M Braverman, K Efremenko
SIAM Journal on Computing 46 (1), 388-428, 2017
79 2017 How well do random walks parallelize? K Efremenko, O Reingold
International Workshop on Approximation Algorithms for Combinatorial …, 2009
66 2009 Maximal noise in interactive communication over erasure channels and channels with feedback K Efremenko, R Gelles, B Haeupler
Proceedings of the 2015 Conference on Innovations in Theoretical Computer …, 2015
60 2015 MDS code constructions with small sub-packetization and near-optimal repair bandwidth AS Rawat, I Tamo, V Guruswami, K Efremenko
IEEE Transactions on Information Theory 64 (10), 6506-6525, 2018
57 2018 Pattern matching with don't cares and few errors R Clifford, K Efremenko, E Porat, A Rothschild
Journal of Computer and System Sciences 76 (2), 115-124, 2010
53 2010 Reliable communication over highly connected noisy networks N Alon, M Braverman, K Efremenko, R Gelles, B Haeupler
Proceedings of the 2016 ACM Symposium on Principles of Distributed Computing …, 2016
50 2016 Barriers for rank methods in arithmetic complexity K Efremenko, A Garg, R Oliveira, A Wigderson
arXiv preprint arXiv:1710.09502, 2017
47 2017 Constant-rate coding for multiparty interactive communication is impossible M Braverman, K Efremenko, R Gelles, B Haeupler
Journal of the ACM (JACM) 65 (1), 1-41, 2017
45 2017 From coding theory to efficient pattern matching R Clifford, K Efremenko, E Porat, A Rothschild
Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete …, 2009
43 2009 k -Mismatch with Don’t CaresR Clifford, K Efremenko, E Porat, A Rothschild
European Symposium on Algorithms, 151-162, 2007
43 2007 Local list decoding with a constant number of queries A Ben-Aroya, K Efremenko, A Ta-Shma
2010 IEEE 51st Annual Symposium on Foundations of Computer Science, 715-722, 2010
39 2010 Interactive coding over the noisy broadcast channel K Efremenko, G Kol, R Saxena
Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing …, 2018
27 2018 Approximating general metric distances between a pattern and a text K Efremenko, E Porat
arXiv preprint arXiv:0802.1427, 2008
21 2008 Noisy beeps K Efremenko, G Kol, RR Saxena
Proceedings of the 39th Symposium on Principles of Distributed Computing …, 2020
18 2020 A black box for online approximate pattern matching R Clifford, K Efremenko, B Porat, E Porat
Annual Symposium on Combinatorial Pattern Matching, 143-151, 2008
18 2008 A black box for online approximate pattern matching R Clifford, K Efremenko, B Porat, E Porat
Information and Computation 209 (4), 731-736, 2011
17 2011 Binary Interactive Error Resilience Beyond K Efremenko, G Kol, RR Saxena
2020 IEEE 61st Annual Symposium on Foundations of Computer Science (FOCS …, 2020
15 2020 ∊-MSR codes with small sub-packetization AS Rawat, I Tamo, V Guruswami, K Efremenko
2017 IEEE International Symposium on Information Theory (ISIT), 2043-2047, 2017
14 2017 A note on amplifying the error-tolerance of locally decodable codes A Ben-Aroya, K Efremenko, A Ta-Shma
Electronic Colloquium on Computational Complexity (ECCC), TR10-134, 2010
14 2010 