| 3-query locally decodable codes of subexponential length K Efremenko SIAM Journal on Computing 41 (6), 1694-1703, 2012 | 207 | 2012 |
| How well do random walks parallelize? K Efremenko, O Reingold Approximation, Randomization, and Combinatorial Optimization. Algorithms and …, 2009 | 54 | 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 | 52 | 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 | 40 | 2009 |
| Maximal noise in interactive communication over erasure channels and channels with feedback K Efremenko, R Gelles, B Haeupler IEEE Transactions on Information Theory 62 (8), 4575-4588, 2016 | 37 | 2016 |
| 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 | 36 | 2010 |
| 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 | 36 | 2010 |
| k-mismatch with don’t cares R Clifford, K Efremenko, E Porat, A Rothschild European Symposium on Algorithms, 151-162, 2007 | 34 | 2007 |
| Reliable communication over highly connected noisy networks N Alon, M Braverman, K Efremenko, R Gelles, B Haeupler Distributed Computing 32 (6), 505-515, 2019 | 29 | 2019 |
| 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 | 27 | 2017 |
| Barriers for rank methods in arithmetic complexity K Efremenko, A Garg, R Oliveira, A Wigderson arXiv preprint arXiv:1710.09502, 2017 | 22 | 2017 |
| 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 | 20 | 2018 |
| Approximating general metric distances between a pattern and a text K Efremenko, E Porat arXiv preprint arXiv:0802.1427, 2008 | 20 | 2008 |
| 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 | 17 | 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 | 16 | 2011 |
| 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) 17 (134), 2010 | 14 | 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 | 12 | 2018 |
| ∊-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 | 11 | 2017 |
| On minimal free resolutions and the method of shifted partial derivatives in complexity theory K Efremenko, JM Landsberg, H Schenck, J Weyman ArXiv e-prints, 2015 | 10 | 2015 |
| From irreducible representations to locally decodable codes K Efremenko Proceedings of the forty-fourth annual ACM symposium on Theory of computing …, 2012 | 7 | 2012 |
