The following pages link to Klim Efremenko (Q418195):
Displaying 31 items.
- Mismatch sampling (Q418198) (← links)
- A black box for online approximate pattern matching (Q716330) (← links)
- Pattern matching with don't cares and few errors (Q847263) (← links)
- On minimal free resolutions of sub-permanents and other ideals arising in complexity theory (Q1643083) (← links)
- Reliable communication over highly connected noisy networks (Q2010609) (← links)
- List and Unique Coding for Interactive Communication in the Presence of Adversarial Noise (Q2968158) (← links)
- Maximal Noise in Interactive Communication Over Erasure Channels and Channels With Feedback (Q2976672) (← links)
- Maximal Noise in Interactive Communication over Erasure Channels and Channels with Feedback (Q2989010) (← links)
- Constant-Rate Coding for Multiparty Interactive Communication Is Impossible (Q3177892) (← links)
- A Black Box for Online Approximate Pattern Matching (Q3506949) (← links)
- k-Mismatch with Don’t Cares (Q3527207) (← links)
- (Q3579401) (← links)
- How Well Do Random Walks Parallelize? (Q3638899) (← links)
- Testing Equality in Communication Graphs (Q4566579) (← links)
- (Q4633890) (← links)
- The method of shifted partial derivatives cannot separate the permanent from the determinant (Q4637587) (← links)
- MDS Code Constructions With Small Sub-Packetization and Near-Optimal Repair Bandwidth (Q4682932) (← links)
- 3-Query Locally Decodable Codes of Subexponential Length (Q4910581) (← links)
- (Q5091761) (← links)
- Interactive error resilience beyond 2/7 (Q5144942) (← links)
- 3-query locally decodable codes of subexponential length (Q5172696) (← links)
- Interactive coding over the noisy broadcast channel (Q5230314) (← links)
- Constant-rate coding for multiparty interactive communication is impossible (Q5361897) (← links)
- Reliable Communication over Highly Connected Noisy Networks (Q5361931) (← links)
- From irreducible representations to locally decodable codes (Q5415484) (← links)
- Noisy Beeps (Q5855266) (← links)
- (Q5875700) (← links)
- Optimal Short-Circuit Resilient Formulas (Q5889787) (← links)
- Interactive coding with small memory (Q6538670) (← links)
- Noisy radio network lower bounds via noiseless beeping lower bounds (Q6610312) (← links)
- Protecting single-hop radio networks from message drops (Q6638055) (← links)
