Klim Efremenko

Available identifiers

zbMath Open efremenko.klimMaRDI QIDQ418195

List of research outcomes

Publication	Date of Publication	Type
Protecting single-hop radio networks from message drops	2024-11-14	Paper
Noisy radio network lower bounds via noiseless beeping lower bounds	2024-09-25	Paper
Interactive coding with small memory	2024-05-14	Paper
The rate of interactive codes is bounded away from 1	2024-05-08	Paper
Circuits resilient to short-circuit errors	2023-12-08	Paper
Optimal error resilience of adaptive message exchange	2023-11-14	Paper
Optimal Short-Circuit Resilient Formulas	2023-04-27	Paper
https://portal.mardi4nfdi.de/entity/Q5875700	2023-02-03	Paper
https://portal.mardi4nfdi.de/entity/Q5091761	2022-07-27	Paper
Noisy Beeps	2021-03-15	Paper
Interactive error resilience beyond 2/7	2021-01-19	Paper
Reliable communication over highly connected noisy networks	2019-11-27	Paper
Interactive coding over the noisy broadcast channel	2019-08-22	Paper
https://portal.mardi4nfdi.de/entity/Q4633890	2019-05-06	Paper
MDS Code Constructions With Small Sub-Packetization and Near-Optimal Repair Bandwidth	2018-09-19	Paper
Constant-Rate Coding for Multiparty Interactive Communication Is Impossible	2018-08-02	Paper
Testing Equality in Communication Graphs	2018-06-27	Paper
On minimal free resolutions of sub-permanents and other ideals arising in complexity theory	2018-06-18	Paper
The method of shifted partial derivatives cannot separate the permanent from the determinant	2018-04-24	Paper
Constant-rate coding for multiparty interactive communication is impossible	2017-09-29	Paper
Reliable Communication over Highly Connected Noisy Networks	2017-09-29	Paper
Maximal Noise in Interactive Communication over Erasure Channels and Channels with Feedback	2017-05-19	Paper
Maximal Noise in Interactive Communication Over Erasure Channels and Channels With Feedback	2017-04-28	Paper
List and Unique Coding for Interactive Communication in the Presence of Adversarial Noise	2017-03-10	Paper
3-query locally decodable codes of subexponential length	2015-02-04	Paper
From irreducible representations to locally decodable codes	2014-05-13	Paper
3-Query Locally Decodable Codes of Subexponential Length	2013-03-19	Paper
Mismatch sampling	2012-05-24	Paper
A black box for online approximate pattern matching	2011-04-28	Paper
https://portal.mardi4nfdi.de/entity/Q3579401	2010-08-06	Paper
Pattern matching with don't cares and few errors	2010-02-12	Paper
How Well Do Random Walks Parallelize?	2009-10-28	Paper
k-Mismatch with Don’t Cares	2008-09-25	Paper
A Black Box for Online Approximate Pattern Matching	2008-06-17	Paper

Research outcomes over time

This page was built for person: Klim Efremenko