Product
Help
Pricing
About
Jobs
Log in
Get started
Author
Add to collection
Klim Efremenko
Observed name:
Efremenko, Klim
Institution:
Ben-Gurion University of the Negev
Observed institutions:
Ben-Gurion University of the Negev,
Microsoft (United States),
Bar-Ilan University,
Tel Aviv University,
Princeton University,
University of Chicago,
Weizmann Institute of Science,
Carnegie Mellon University,
University of Amsterdam,
University of California, Berkeley
show all 10
ORCID:
0000-0003-3280-3927
Observed ORCID:
0000-0003-3280-3927
OpenAlex ID:
A5083692440
Works
74
Awards
1
3-Query Locally Decodable Codes of Subexponential Length
2009
·
Klim Efremenko
·
SIAM Journal on Computing
·
306
MDS Code Constructions With Small Sub-Packetization and Near-Optimal Repair Bandwidth
2018
·
Ankit Singh Rawat
, Itzhak Tamo
, et al.
·
IEEE Transactions on Information Theory
·
70
PDF
Pattern matching with don't cares and few errors
2009
·
Raphaël Clifford
, Klim Efremenko
, et al.
·
Journal of Computer and System Sciences
·
63
PDF
How Well Do Random Walks Parallelize?
2009
·
Klim Efremenko
, Omer Reingold
·
Lecture notes in computer science
·
57
List and Unique Coding for Interactive Communication in the Presence of Adversarial Noise
2014
·
Mark Braverman
, Klim Efremenko
·
Annual Symposium on Foundations of Computer Science
·
53
Reliable Communication over Highly Connected Noisy Networks
2016
·
Noga Alon
, Mark Braverman
, et al.
·
Distributed Computing
·
45
PDF
Constant-Rate Coding for Multiparty Interactive Communication Is Impossible
2016
·
Mark Braverman
, Klim Efremenko
, et al.
·
Journal of the ACM
·
43
PDF
k-Mismatch with Don’t Cares
2007
·
Raphaël Clifford
, Klim Efremenko
, et al.
·
Springer eBooks
·
41
From coding theory to efficient pattern matching
2009
·
Raphaël Clifford
, Klim Efremenko
, et al.
·
ACM-SIAM Symposium on Discrete Algorithms (SODA)
·
40
Maximal Noise in Interactive Communication Over Erasure Channels and Channels With Feedback
2016
·
Klim Efremenko
, Ran Gelles
, et al.
·
IEEE Transactions on Information Theory
·
38
Local List Decoding with a Constant Number of Queries
2010
·
Avraham Ben-Aroya
, Klim Efremenko
, et al.
·
Annual Symposium on Foundations of Computer Science
·
36
A black box for online approximate pattern matching
2011
·
Raphaël Clifford
, Klim Efremenko
, et al.
·
Information and Computation
·
32
PDF
Barriers for Rank Methods in Arithmetic Complexity
2018
·
Efremenko, Klim
, Garg, Ankit
, et al.
·
DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)
·
28
PDF
From coding theory to efficient pattern matching
2009
·
Raphaël Clifford
, Klim Efremenko
, et al.
·
Explore Bristol Research
·
24
Barriers for Rank Methods in Arithmetic Complexity
2017
·
Efremenko, Klim
, Garg, Ankit
, et al.
·
arXiv (Cornell University)
·
22
PDF
List and Unique Coding for Interactive Communication in the Presence of Adversarial Noise
2017
·
Mark Braverman
, Klim Efremenko
·
SIAM Journal on Computing
·
22
Interactive coding over the noisy broadcast channel
2018
·
Klim Efremenko
, Gillat Kol
, et al.
·
ACM Symposium on Theory of Computing (STOC)
·
20
Maximal Noise in Interactive Communication over Erasure Channels and Channels with Feedback
2015
·
Klim Efremenko
, Ran Gelles
, et al.
·
Conference on Innovations in Theoretical Computer Science
·
19
A Black Box for Online Approximate Pattern Matching
2008
·
Raphaël Clifford
, Klim Efremenko
, et al.
·
Springer eBooks
·
19
∊-MSR codes with small sub-packetization
2017
·
Ankit Singh Rawat
, Itzhak Tamo
, et al.
·
IEEE International Symposium on Information Theory (ISIT)
·
16
Approximating general metric distances between a pattern and a text
2008
·
Ely Porat
, Klim Efremenko
·
arXiv (Cornell University)
·
14
Noisy Beeps
2020
·
Klim Efremenko
, Gillat Kol
, et al.
·
ACM Symposium on Principles of Distributed Computing (PODC)
·
13
The method of shifted partial derivatives cannot separate the permanent from the determinant
2017
·
Klim Efremenko
, J. Landsberg
, et al.
·
Mathematics of Computation
·
13
PDF
Lower Bounds for Regular Resolution over Parities
2024
·
Klim Efremenko
, Michal Garlík
, et al.
·
ACM Symposium on Theory of Computing (STOC)
·
11
On minimal free resolutions of sub-permanents and other ideals arising in complexity theory
2018
·
Klim Efremenko
, J.M. Landsberg
, et al.
·
Journal of Algebra
·
10
Show more works
View as search
Works count:
74
Citation count:
1,219
H-index:
19
I10-index:
28
Year
Topic
Type