Efremenko, Klim

1. MDS Code Constructions with Small Sub-packetization and Near-optimal Repair Bandwidth
   2017/09/24 by Rawat, Ankit Singh, Tamo, Itzhak, Guruswami, Venkatesan +1 · 2 citations
   #Computational Complexity (cs.CC) #FOS: Computer and information sciences #Information Theory (cs.IT)
2. Barriers for Rank Methods in Arithmetic Complexity
   2017/10/26 by Klim Efremenko, Ankit Garg, Efremenko, Klim +5 · 2 citations
   Computer Science · Mathematics · #Complexity and Algorithms in Graphs #Tensor decomposition and applications #Polynomial and algebraic computation
3. Testing Equality in Communication Graphs
   2016/05/05 by Alon, Noga, Efremenko, Klim, Sudakov, Benny · 1 citation
   #Combinatorics (math.CO) #FOS: Mathematics
4. Statistically Near-Optimal Hypothesis Selection
   2021/08/17 by Bousquet, Olivier, Braverman, Mark, Efremenko, Klim +2 · 1 citation
   #Artificial Intelligence (cs.AI) #Computational Complexity (cs.CC) #FOS: Computer and information sciences #FOS: Mathematics #Information Theory (cs.IT) #Machine Learning (cs.LG) #Optimization and Control (math.OC)