Skip to content

Klim Efremenko

Publication record assembled from the DBLP archive of ranked conferences.

Papers indexed

31

Venues

10

Active years

2007–2026

Best venue rank

A*

Where they publish

Papers

31 indexed papers, newest first.

YearVenueTitleAuthors
2026ICALPWhite-Box Adversarial Streaming Lower Bounds Beyond Two-Party Communication.Klim Efremenko, Gillat Kol, Raghuvansh R. Saxena, Zhijun Zhang
2026SODAUnbounded Error Correcting Codes.Klim Efremenko, Or Zamir
2026STOCStrong ETH Holds for Bounded-Depth Resolution over Parities.Klim Efremenko, Dmitry Itsykson
2025FOCSConstant Rate Codes for Adaptive Broadcasts Do Not Exist.Klim Efremenko, Gillat Kol, Dmitry Paramonov, Raghuvansh R. Saxena
2024STOCLower Bounds for Regular Resolution over Parities.Klim Efremenko, Michal Garlk, Dmitry Itsykson
2023ICALPProtecting Single-Hop Radio Networks from Message Drops.Klim Efremenko, Gillat Kol, Dmitry Paramonov, Raghuvansh R. Saxena
2023SODAInteractive Coding with Small Memory.Klim Efremenko, Bernhard Haeupler, Yael Tauman Kalai, Gillat Kol, Nicolas Resch, Raghuvansh R. Saxena
2023STOCThe Rate of Interactive Codes Is Bounded Away from 1.Klim Efremenko, Gillat Kol, Dmitry Paramonov, Raghuvansh R. Saxena
2022FOCSBinary Codes with Resilience Beyond 1/4 via Interaction.Klim Efremenko, Gillat Kol, Raghuvansh R. Saxena, Zhijun Zhang
2022STOCCircuits resilient to short-circuit errors.Klim Efremenko, Bernhard Haeupler, Yael Tauman Kalai, Pritish Kamath, Gillat Kol, Nicolas Resch, Raghuvansh R. Saxena
2021FOCSStatistically Near-Optimal Hypothesis Selection.Olivier Bousquet, Mark Braverman, Gillat Kol, Klim Efremenko, Shay Moran
2021FOCSTight Bounds for General Computation in Noisy Broadcast Networks.Klim Efremenko, Gillat Kol, Dmitry Paramonov, Raghuvansh R. Saxena
2021STOCOptimal error resilience of adaptive message exchange.Klim Efremenko, Gillat Kol, Raghuvansh R. Saxena
2020AISTATSFast and Bayes-consistent nearest neighbors.Klim Efremenko, Aryeh Kontorovich, Moshe Noivirt
2020FOCSBinary Interactive Error Resilience Beyond ${{}^{1}}\!/\!_{8}$ (or why $({{}^{1}}\!/\!_{2})^{3} > {{}^{1}}\!/\!_{8})$.Klim Efremenko, Gillat Kol, Raghuvansh R. Saxena
2020PODCNoisy Beeps.Klim Efremenko, Gillat Kol, Raghuvansh R. Saxena
2020STOCInteractive error resilience beyond 2/7.Klim Efremenko, Gillat Kol, Raghuvansh R. Saxena
2019FOCSRadio Network Coding Requires Logarithmic Overhead.Klim Efremenko, Gillat Kol, Raghuvansh Saxena
2018STOCInteractive coding over the noisy broadcast channel.Klim Efremenko, Gillat Kol, Raghuvansh Saxena
2017ISIT∊-MSR codes with small sub-packetization.Ankit Singh Rawat, Itzhak Tamo, Venkatesan Guruswami, Klim Efremenko
2016PODCReliable Communication over Highly Connected Noisy Networks.Noga Alon, Mark Braverman, Klim Efremenko, Ran Gelles, Bernhard Haeupler
2016STOCConstant-rate coding for multiparty interactive communication is impossible.Mark Braverman, Klim Efremenko, Ran Gelles, Bernhard Haeupler
2014FOCSList and Unique Coding for Interactive Communication in the Presence of Adversarial Noise.Mark Braverman, Klim Efremenko
2012STOCFrom irreducible representations to locally decodable codes.Klim Efremenko
2010FOCSLocal List Decoding with a Constant Number of Queries.Avraham Ben-Aroya, Klim Efremenko, Amnon Ta-Shma
2009SODAFrom coding theory to efficient pattern matching.Raphal Clifford, Klim Efremenko, Ely Porat, Amir Rothschild
2009STOC3-query locally decodable codes of subexponential length.Klim Efremenko
2008CPMA Black Box for Online Approximate Pattern Matching.Raphal Clifford, Klim Efremenko, Benny Porat, Ely Porat
2008SODAApproximating general metric distances between a pattern and a text.Ely Porat, Klim Efremenko
2008SPIREMismatch Sampling.Raphal Clifford, Klim Efremenko, Benny Porat, Ely Porat, Amir Rothschild
2007ESAUntitled recordRaphal Clifford, Klim Efremenko, Ely Porat, Amir Rothschild