Klim Efremenko
Klim Efremenko
Computer Science Ben- Gurion University
Dirección de correo verificada de cs.bgu.ac.il - Página principal
Título
Citado por
Citado por
Año
3-query locally decodable codes of subexponential length
K Efremenko
SIAM Journal on Computing 41 (6), 1694-1703, 2012
2282012
How well do random walks parallelize?
K Efremenko, O Reingold
Approximation, Randomization, and Combinatorial Optimization. Algorithms and …, 2009
592009
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
582017
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
412009
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
392016
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
392010
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
362010
k-mismatch with don’t cares
R Clifford, K Efremenko, E Porat, A Rothschild
European Symposium on Algorithms, 151-162, 2007
362007
Reliable communication over highly connected noisy networks
N Alon, M Braverman, K Efremenko, R Gelles, B Haeupler
Distributed Computing 32 (6), 505-515, 2019
342019
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
302017
Barriers for rank methods in arithmetic complexity
K Efremenko, A Garg, R Oliveira, A Wigderson
arXiv preprint arXiv:1710.09502, 2017
262017
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
212018
Approximating general metric distances between a pattern and a text
K Efremenko, E Porat
arXiv preprint arXiv:0802.1427, 2008
212008
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
182008
A black box for online approximate pattern matching
R Clifford, K Efremenko, B Porat, E Porat
Information and Computation 209 (4), 731-736, 2011
162011
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
142010
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
132018
∊-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
112017
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
102015
The method of shifted partial derivatives cannot separate the permanent from the determinant
K Efremenko, J Landsberg, H Schenck, J Weyman
Mathematics of Computation 87 (312), 2037-2045, 2018
82018
El sistema no puede realizar la operación en estos momentos. Inténtalo de nuevo más tarde.
Artículos 1–20