Klim Efremenko

464 total citations
27 papers, 193 citations indexed

About

Klim Efremenko is a scholar working on Artificial Intelligence, Computer Networks and Communications and Computational Theory and Mathematics. According to data from OpenAlex, Klim Efremenko has authored 27 papers receiving a total of 193 indexed citations (citations by other indexed papers that have themselves been cited), including 22 papers in Artificial Intelligence, 13 papers in Computer Networks and Communications and 13 papers in Computational Theory and Mathematics. Recurrent topics in Klim Efremenko's work include Coding theory and cryptography (8 papers), Cooperative Communication and Network Coding (8 papers) and Algorithms and Data Compression (8 papers). Klim Efremenko is often cited by papers focused on Coding theory and cryptography (8 papers), Cooperative Communication and Network Coding (8 papers) and Algorithms and Data Compression (8 papers). Klim Efremenko collaborates with scholars based in Israel, United States and United Kingdom. Klim Efremenko's co-authors include Raphaël Clifford, Ely Porat, Mark Braverman, Itzhak Tamo, Ankit Singh Rawat, Venkatesan Guruswami, Ran Gelles, Bernhard Haeupler, Gillat Kol and Avraham Ben-Aroya and has published in prestigious journals such as IEEE Transactions on Information Theory, Journal of the ACM and SIAM Journal on Computing.

In The Last Decade

Klim Efremenko

26 papers receiving 186 citations

Peers — A (Enhanced Table)

Peers by citation overlap · career bar shows stage (early→late) cites · hero ref

Name	h						Papers	Cites
Klim Efremenko Israel	8	117	101	74	49	34	27	193
Chong Shangguan China	8	86 0.7×	124 1.2×	49 0.7×	37 0.8×	81 2.4×	24	214
Tomasz Jurdziński Poland	8	73 0.6×	168 1.7×	81 1.1×	51 1.0×	41 1.2×	41	252
Andrzej Szepietowski Poland	9	77 0.7×	60 0.6×	152 2.1×	41 0.8×	29 0.9×	35	223
Pavol Ďuriš Slovakia	8	108 0.9×	51 0.5×	139 1.9×	31 0.6×	37 1.1×	20	180
Anoosheh Heidarzadeh United States	8	109 0.9×	148 1.5×	24 0.3×	13 0.3×	91 2.7×	31	226
Qiaoqiao Zhou Hong Kong	10	53 0.5×	171 1.7×	23 0.3×	46 0.9×	194 5.7×	37	245
Siwei Sun China	10	227 1.9×	13 0.1×	25 0.3×	13 0.3×	97 2.9×	37	267
Shih-Chun Chang United States	9	100 0.9×	239 2.4×	37 0.5×	28 0.6×	261 7.7×	17	316
Junji Shikata Japan	6	70 0.6×	38 0.4×	13 0.2×	9 0.2×	29 0.9×	49	125
Hironori Uchikawa Japan	9	101 0.9×	247 2.4×	111 1.5×	25 0.5×	92 2.7×	19	279

Countries citing papers authored by Klim Efremenko

Since Specialization

Citations

This map shows the geographic impact of Klim Efremenko's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by Klim Efremenko with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Klim Efremenko more than expected).

Fields of papers citing papers by Klim Efremenko

Since Specialization

Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Klim Efremenko. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by Klim Efremenko. The network helps show where Klim Efremenko may publish in the future.

Co-authorship network of co-authors of Klim Efremenko

This figure shows the co-authorship network connecting the top 25 collaborators of Klim Efremenko. A scholar is included among the top collaborators of Klim Efremenko based on the total number of citations received by their joint publications. Widths of edges represent the number of papers authors have co-authored together. Node borders signify the number of papers an author published with Klim Efremenko. Klim Efremenko is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

Sort: Min cites: Since: Top N: Style:

20 of 20 papers shown

1.

Efremenko, Klim, et al.. (2024). Lower Bounds for Regular Resolution over Parities. 640–651.

2.

Efremenko, Klim, et al.. (2022). Tight Bounds for General Computation in Noisy Broadcast Networks. 2 indexed citations

3.

Efremenko, Klim, et al.. (2022). Binary Codes with Resilience Beyond 1/4 via Interaction. 1–12. 2 indexed citations

4.

Efremenko, Klim, et al.. (2020). Noisy Beeps. 418–427. 4 indexed citations

5.

Efremenko, Klim, et al.. (2019). Radio Network Coding Requires Logarithmic Overhead. 4 indexed citations

6.

Rawat, Ankit Singh, Itzhak Tamo, Venkatesan Guruswami, & Klim Efremenko. (2018). MDS Code Constructions With Small Sub-Packetization and Near-Optimal Repair Bandwidth. IEEE Transactions on Information Theory. 64(10). 6506–6525. 37 indexed citations

7.

Rawat, Ankit Singh, Itzhak Tamo, Venkatesan Guruswami, & Klim Efremenko. (2017). ∊-MSR codes with small sub-packetization. 2043–2047. 6 indexed citations

8.

Braverman, Mark, Klim Efremenko, Ran Gelles, & Bernhard Haeupler. (2016). Constant-Rate Coding for Multiparty Interactive Communication Is Impossible. Journal of the ACM. 65(1). 1–1010. 3 indexed citations

9.

Alon, Noga, Mark Braverman, Klim Efremenko, Ran Gelles, & Bernhard Haeupler. (2016). Reliable Communication over Highly Connected Noisy Networks. Distributed Computing. 32(6). 165–173. 2 indexed citations

10.

Braverman, Mark & Klim Efremenko. (2014). List and Unique Coding for Interactive Communication in the Presence of Adversarial Noise. 236–245. 24 indexed citations

11.

Clifford, Raphaël, et al.. (2012). Mismatch sampling. Information and Computation. 214. 112–118. 3 indexed citations

12.

Clifford, Raphaël, et al.. (2011). A black box for online approximate pattern matching. Information and Computation. 209(4). 731–736. 5 indexed citations

13.

Ben-Aroya, Avraham, Klim Efremenko, & Amnon Ta‐Shma. (2010). A Note on Amplifying the Error-Tolerance of Locally Decodable Codes.. Electronic colloquium on computational complexity. 17. 134. 2 indexed citations

14.

Ben-Aroya, Avraham, Klim Efremenko, & Amnon Ta‐Shma. (2010). Local List Decoding with a Constant Number of Queries. Electronic colloquium on computational complexity. 17. 715–722. 1 indexed citations

15.

Clifford, Raphaël, et al.. (2009). From coding theory to efficient pattern matching. Symposium on Discrete Algorithms. 778–784. 12 indexed citations

16.

Clifford, Raphaël, et al.. (2009). Pattern matching with don't cares and few errors. Journal of Computer and System Sciences. 76(2). 115–124. 24 indexed citations

17.

Clifford, Raphaël, et al.. (2009). SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms. 8 indexed citations

18.

Clifford, Raphaël, et al.. (2009). From coding theory to efficient pattern matching. Bristol Research (University of Bristol). 778–784. 9 indexed citations

19.

Porat, Ely & Klim Efremenko. (2008). Approximating general metric distances between a pattern and a text. arXiv (Cornell University). 419–427. 3 indexed citations

20.

Clifford, Raphaël, et al.. (2008). String Processing and Information Retrieval, 15th International Symposium, SPIRE 2008. 3 indexed citations

Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive bibliographic database. While OpenAlex provides broad and valuable coverage of the global research landscape, it—like all bibliographic datasets—has inherent limitations. These include incomplete records, variations in author disambiguation, differences in journal indexing, and delays in data updates. As a result, some metrics and network relationships displayed in Rankless may not fully capture the entirety of a scholar's output or impact.

Explore authors with similar magnitude of impact