No. Title Author Year
1 Is This Correct? Let’s Check! Ben-Eliezer, Omri et al. 2023
2 Sketching Approximability of (Weak) Monarchy Predicates Chou, Chi-Ning et al. 2022
3 Streaming and Sketching Complexity of CSPs: A Survey (Invited Talk) Sudan, Madhu 2022
4 Ideal-Theoretic Explanation of Capacity-Achieving Decoding Bhandari, Siddharth et al. 2021
5 Linear, Semidefinite Programming and Randomization Methods for Combinatorial Optimization Problems (Dagstuhl Seminar 00041) Jansen, Klaus et al. 2021
6 Streaming Approximation Resistance of Every Ordering CSP Singer, Noah et al. 2021
7 Algorithmic Polarization for Hidden Markov Models Guruswami, Venkatesan et al. 2018
8 Local Decoding and Testing of Polynomials over Grids Srinivasan, Srikanth et al. 2018
9 Polar Codes with Exponentially Small Error at Finite Block Length Blasiok, Jaroslaw et al. 2018
10 Synchronization Strings: List Decoding for Insertions and Deletions Haeupler, Bernhard et al. 2018
11 Compression in a Distributed Setting Ghazi, Badih et al. 2017
12 The Power of Shared Randomness in Uncertain Communication Ghazi, Badih et al. 2017
13 List Decoding Group Homomorphisms Between Supersolvable Groups Guo, Alan et al. 2014
14 Physical limits of Communication (Invited Talk) Sudan, Madhu 2011
15 Testing Linear-Invariant Non-Linear Properties Bhattacharyya, Arnab et al. 2009
Current Page :
Number of result pages: 1
Number of documents: 15

DROPS-Home | Fulltext Search | Imprint | Privacy Published by LZI