default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMadhu Sudan 0001
Person information
- affiliation: Harvard University, School of Engineering and Applied Sciences, Boston, MA, USA
- affiliation: Microsoft Research New England, Cambridge, MA, USA
- award (2001): Gödel Prize
Other persons with the same name
- Madhu Sudan (aka: Madhusudan) — disambiguation page
- Madhu Sudan 0002 — SRI International, Menlo Park, CA, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[j73]Noah G. Singer, Madhu Sudan, Santhoshini Velusamy:
Streaming approximation resistance of every ordering CSP. Comput. Complex. 33(1): 6 (2024)- [j72]Chi-Ning Chou
, Alexander Golovnev, Madhu Sudan, Santhoshini Velusamy:
Sketching Approximability of All Finite CSPs. J. ACM 71(2): 15:1-15:74 (2024) - [j71]Siddharth Bhandari, Prahladh Harsha, Mrinal Kumar, Madhu Sudan:
Decoding Multivariate Multiplicity Codes on Product Sets. IEEE Trans. Inf. Theory 70(1): 154-169 (2024) - [j70]Siddharth Bhandari, Prahladh Harsha, Mrinal Kumar, Madhu Sudan:
Ideal-Theoretic Explanation of Capacity-Achieving Decoding. IEEE Trans. Inf. Theory 70(2): 1107-1123 (2024) - [c132]Anna M. Brandenberger, Cassandra Marcussen, Elchanan Mossel, Madhu Sudan:
Errors are Robustly Tamed in Cumulative Knowledge Processes. COLT 2024: 630-631 - [c131]Sanjeev Khanna, Aaron Putterman, Madhu Sudan:
Near-Optimal Size Linear Sketches for Hypergraph Cut Sparsifiers. FOCS 2024: 1669-1706 - [c130]Prahladh Harsha, Mrinal Kumar, Ramprasad Saptharishi, Madhu Sudan:
An Improved Line-Point Low-Degree Test. FOCS 2024: 1883-1892 - [c129]Sanjeev Khanna, Aaron (Louie) Putterman, Madhu Sudan:
Almost-Tight Bounds on Preserving Cuts in Classes of Submodular Hypergraphs. ICALP 2024: 98:1-98:17 - [c128]Kuan Cheng, Elena Grigorescu, Xin Li, Madhu Sudan, Minshen Zhu:
On $k$-Mer-Based and Maximum Likelihood Estimation Algorithms for Trace Reconstruction. ISIT 2024: 879-884 - [c127]Sanjeev Khanna, Aaron (Louie) Putterman, Madhu Sudan:
Code Sparsification and its Applications. SODA 2024: 5145-5168 - [c126]Prashanth Amireddy, Amik Raj Behera, Manaswi Paraashar, Srikanth Srinivasan, Madhu Sudan:
Local Correction of Linear Functions over the Boolean Cube. STOC 2024: 764-775 - [i142]Sanjeev Khanna, Aaron (Louie) Putterman, Madhu Sudan:
Almost-Tight Bounds on Preserving Cuts in Classes of Submodular Hypergraphs. CoRR abs/2402.13151 (2024) - [i141]Prashanth Amireddy, Amik Raj Behera, Manaswi Paraashar, Srikanth Srinivasan, Madhu Sudan:
Local Correction of Linear Functions over the Boolean Cube. CoRR abs/2403.20305 (2024) - [i140]Sanjeev Khanna, Aaron (Louie) Putterman, Madhu Sudan:
Characterizations of Sparsifiability for Affine CSPs and Symmetric CSPs. CoRR abs/2404.06327 (2024) - [i139]Sanjeev Khanna, Aaron (Louie) Putterman, Madhu Sudan:
Near-optimal Size Linear Sketches for Hypergraph Cut Sparsifiers. CoRR abs/2407.03934 (2024) - [i138]Prashanth Amireddy, Amik Raj Behera, Manaswi Paraashar, Srikanth Srinivasan, Madhu Sudan:
Low Degree Local Correction Over the Boolean Cube. CoRR abs/2411.07374 (2024) - [i137]Fatemeh Ghasemi, Swastik Kopparty, Madhu Sudan:
Improved PIR Schemes using Matching Vectors and Derivatives. CoRR abs/2411.11611 (2024) - [i136]Anna M. Brandenberger, Cassandra Marcussen, Elchanan Mossel, Madhu Sudan:
Finding the root in random nearest neighbor trees. CoRR abs/2411.14336 (2024) - [i135]Raghuvansh R. Saxena, Noah G. Singer, Madhu Sudan, Santhoshini Velusamy:
Streaming Algorithms via Local Algorithms for Maximum Directed Cut. CoRR abs/2411.18829 (2024) - [i134]Prashanth Amireddy, Amik Raj Behera, Manaswi Paraashar, Srikanth Srinivasan, Madhu Sudan:
Local Correction of Linear Functions over the Boolean Cube. Electron. Colloquium Comput. Complex. TR24 (2024) - [i133]Prashanth Amireddy, Amik Raj Behera, Manaswi Paraashar, Srikanth Srinivasan, Madhu Sudan:
Low Degree Local Correction Over the Boolean Cube. Electron. Colloquium Comput. Complex. TR24 (2024) - [i132]Fatemeh Ghasemi, Swastik Kopparty, Madhu Sudan:
Improved PIR Schemes using Matching Vectors and Derivatives. Electron. Colloquium Comput. Complex. TR24 (2024) - [i131]Fatemeh Ghasemi, Swastik Kopparty, Madhu Sudan:
Improved PIR Schemes using Matching Vectors and Derivatives. IACR Cryptol. ePrint Arch. 2024: 1885 (2024) - 2023
- [c125]Prashanth Amireddy, Srikanth Srinivasan, Madhu Sudan:
Low-Degree Testing over Grids. APPROX/RANDOM 2023: 41:1-41:22 - [c124]Raghuvansh R. Saxena, Noah G. Singer, Madhu Sudan, Santhoshini Velusamy:
Improved Streaming Algorithms for Maximum Directed Cut via Smoothed Snapshots. FOCS 2023: 855-870 - [c123]Omri Ben-Eliezer, Dan Mikulincer, Elchanan Mossel, Madhu Sudan:
Is This Correct? Let's Check! ITCS 2023: 15:1-15:11 - [c122]Raghuvansh R. Saxena, Noah Singer, Madhu Sudan, Santhoshini Velusamy:
Streaming complexity of CSPs with randomly ordered constraints. SODA 2023: 4083-4103 - [i130]Prashanth Amireddy, Srikanth Srinivasan, Madhu Sudan:
Low-Degree Testing Over Grids. CoRR abs/2305.04983 (2023) - [i129]Kuan Cheng, Elena Grigorescu, Xin Li, Madhu Sudan, Minshen Zhu:
On k-Mer-Based and Maximum Likelihood Estimation Algorithms for Trace Reconstruction. CoRR abs/2308.14993 (2023) - [i128]Anna M. Brandenberger, Cassandra Marcussen, Elchanan Mossel, Madhu Sudan:
Combinative Cumulative Knowledge Processes. CoRR abs/2309.05638 (2023) - [i127]Sanjeev Khanna, Aaron (Louie) Putterman, Madhu Sudan:
Code Sparsification and its Applications. CoRR abs/2311.00788 (2023) - [i126]Prahladh Harsha, Mrinal Kumar, Ramprasad Saptharishi, Madhu Sudan:
An Improved Line-Point Low-Degree Test. CoRR abs/2311.12752 (2023) - [i125]Prahladh Harsha, Mrinal Kumar, Ramprasad Saptharishi, Madhu Sudan:
An Improved Line-Point Low-Degree Test. Electron. Colloquium Comput. Complex. TR23 (2023) - 2022
- [j69]Jaroslaw Blasiok, Venkatesan Guruswami, Preetum Nakkiran, Atri Rudra, Madhu Sudan:
General Strong Polarization. J. ACM 69(2): 11:1-11:67 (2022) - [j68]Elena Grigorescu, Madhu Sudan, Minshen Zhu:
Limitations of Mean-Based Algorithms for Trace Reconstruction at Small Edit Distance. IEEE Trans. Inf. Theory 68(10): 6790-6801 (2022) - [j67]Noah Singer, Madhu Sudan:
Point-hyperplane Incidence Geometry and the Log-rank Conjecture. ACM Trans. Comput. Theory 14(2): 7:1-7:16 (2022) - [c121]Chi-Ning Chou, Alexander Golovnev, Amirbehshad Shahrasbi, Madhu Sudan, Santhoshini Velusamy:
Sketching Approximability of (Weak) Monarchy Predicates. APPROX/RANDOM 2022: 35:1-35:17 - [c120]Madhu Sudan:
Streaming and Sketching Complexity of CSPs: A Survey (Invited Talk). ICALP 2022: 5:1-5:20 - [c119]Chi-Ning Chou, Alexander Golovnev, Madhu Sudan, Ameya Velingker, Santhoshini Velusamy:
Linear space streaming lower bounds for approximating CSPs. STOC 2022: 275-288 - [i124]Chi-Ning Chou, Alexander Golovnev, Amirbehshad Shahrasbi, Madhu Sudan, Santhoshini Velusamy:
Sketching Approximability of (Weak) Monarchy Predicates. CoRR abs/2205.02345 (2022) - [i123]Madhu Sudan:
Streaming and Sketching Complexity of CSPs: A survey. CoRR abs/2205.02744 (2022) - [i122]Raghuvansh R. Saxena, Noah Singer, Madhu Sudan, Santhoshini Velusamy:
Streaming complexity of CSPs with randomly ordered constraints. CoRR abs/2207.07158 (2022) - [i121]Raghuvansh R. Saxena, Noah Singer, Madhu Sudan, Santhoshini Velusamy:
Streaming beyond sketching for Maximum Directed Cut. CoRR abs/2211.03916 (2022) - [i120]Omri Ben-Eliezer, Dan Mikulincer, Elchanan Mossel, Madhu Sudan:
Is this correct? Let's check! CoRR abs/2211.12301 (2022) - [i119]Madhu Sudan:
Streaming and Sketching Complexity of CSPs: A survey. Electron. Colloquium Comput. Complex. TR22 (2022) - [i118]Chi-Ning Chou, Alexander Golovnev, Amirbehshad Shahrasbi, Madhu Sudan, Santhoshini Velusamy:
Sketching Approximability of (Weak) Monarchy Predicates. Electron. Colloquium Comput. Complex. TR22 (2022) - [i117]Raghuvansh Saxena, Noah Singer, Madhu Sudan, Santhoshini Velusamy:
Streaming complexity of CSPs with randomly ordered constraints. Electron. Colloquium Comput. Complex. TR22 (2022) - [i116]Raghuvansh Saxena, Noah Singer, Madhu Sudan, Santhoshini Velusamy:
Streaming beyond sketching for Maximum Directed Cut. Electron. Colloquium Comput. Complex. TR22 (2022) - 2021
- [c118]Noah Singer, Madhu Sudan, Santhoshini Velusamy:
Streaming Approximation Resistance of Every Ordering CSP. APPROX-RANDOM 2021: 17:1-17:19 - [c117]Siddharth Bhandari, Prahladh Harsha, Mrinal Kumar, Madhu Sudan:
Ideal-Theoretic Explanation of Capacity-Achieving Decoding. APPROX-RANDOM 2021: 56:1-56:21 - [c116]Chi-Ning Chou, Alexander Golovnev, Madhu Sudan, Santhoshini Velusamy:
Approximability of all finite CSPs with linear sketches. FOCS 2021: 1197-1208 - [c115]Elena Grigorescu, Madhu Sudan, Minshen Zhu:
Limitations of Mean-Based Algorithms for Trace Reconstruction at Small Distance. ISIT 2021: 2531-2536 - [c114]Siddharth Bhandari, Prahladh Harsha, Mrinal Kumar, Madhu Sudan:
Decoding multivariate multiplicity codes on product sets. STOC 2021: 1489-1501 - [i115]Noah Singer, Madhu Sudan:
Point-hyperplane incidence geometry and the log-rank conjecture. CoRR abs/2101.09592 (2021) - [i114]Chi-Ning Chou, Alexander Golovnev, Madhu Sudan, Santhoshini Velusamy:
Classification of the streaming approximability of Boolean CSPs. CoRR abs/2102.12351 (2021) - [i113]Siddharth Bhandari, Prahladh Harsha, Mrinal Kumar, Madhu Sudan:
Ideal-theoretic Explanation of Capacity-achieving Decoding. CoRR abs/2103.07930 (2021) - [i112]Chi-Ning Chou, Alexander Golovnev, Madhu Sudan, Santhoshini Velusamy:
Approximability of all finite CSPs in the dynamic streaming setting. CoRR abs/2105.01161 (2021) - [i111]Noah Singer, Madhu Sudan, Santhoshini Velusamy:
Streaming approximation resistance of every ordering CSP. CoRR abs/2105.01782 (2021) - [i110]Chi-Ning Chou, Alexander Golovnev, Madhu Sudan, Ameya Velingker, Santhoshini Velusamy:
Linear Space Streaming Lower Bounds for Approximating CSPs. CoRR abs/2106.13078 (2021) - [i109]Omri Ben-Eliezer, Elchanan Mossel, Madhu Sudan:
Information Spread with Error Correction. CoRR abs/2107.06362 (2021) - [i108]Siddharth Bhandari, Prahladh Harsha, Mrinal Kumar, Madhu Sudan:
Ideal-theoretic Explanation of Capacity-achieving Decoding. Electron. Colloquium Comput. Complex. TR21 (2021) - [i107]Chi-Ning Chou, Alexander Golovnev, Madhu Sudan, Santhoshini Velusamy:
Classification of the streaming approximability of Boolean CSPs. Electron. Colloquium Comput. Complex. TR21 (2021) - [i106]Chi-Ning Chou, Alexander Golovnev, Madhu Sudan, Santhoshini Velusamy:
Approximability of all finite CSPs in the dynamic streaming setting. Electron. Colloquium Comput. Complex. TR21 (2021) - [i105]Chi-Ning Chou, Alexander Golovnev, Madhu Sudan, Ameya Velingker, Santhoshini Velusamy:
Linear Space Streaming Lower Bounds for Approximating CSPs. Electron. Colloquium Comput. Complex. TR21 (2021) - [i104]Noah Singer, Madhu Sudan, Santhoshini Velusamy:
Streaming approximation resistance of every ordering CSP. Electron. Colloquium Comput. Complex. TR21 (2021) - 2020
- [j66]Mitali Bafna, Srikanth Srinivasan, Madhu Sudan:
Local decoding and testing of polynomials over grids. Random Struct. Algorithms 57(3): 658-694 (2020) - [j65]Madhu Sudan, Himanshu Tyagi, Shun Watanabe:
Communication for Generating Correlation: A Unifying Survey. IEEE Trans. Inf. Theory 66(1): 5-37 (2020) - [j64]Mohammad Bavarian, Badih Ghazi, Elad Haramaty, Pritish Kamath, Ronald L. Rivest, Madhu Sudan:
Optimality of Correlated Sampling Strategies. Theory Comput. 16: 1-18 (2020) - [c113]Noah Golowich, Madhu Sudan:
Round Complexity of Common Randomness Generation: The Amortized Setting. SODA 2020: 1076-1095 - [i103]Elena Grigorescu, Madhu Sudan, Minshen Zhu:
Limitations of Mean-Based Algorithms for Trace Reconstruction at Small Distance. CoRR abs/2011.13737 (2020) - [i102]Siddharth Bhandari, Prahladh Harsha, Mrinal Kumar, Madhu Sudan:
Decoding Multivariate Multiplicity Codes on Product Sets. CoRR abs/2012.01530 (2020) - [i101]Siddharth Bhandari, Prahladh Harsha, Mrinal Kumar, Madhu Sudan:
Decoding Multivariate Multiplicity Codes on Product Sets. Electron. Colloquium Comput. Complex. TR20 (2020)
2010 – 2019
- 2019
- [c112]Soheil Behnezhad, Mahsa Derakhshan, MohammadTaghi Hajiaghayi, Cliff Stein, Madhu Sudan:
Fully Dynamic Maximal Independent Set with Polylogarithmic Update Time. FOCS 2019: 382-405 - [c111]Venkatesan Guruswami, Preetum Nakkiran, Madhu Sudan:
Algorithmic Polarization for Hidden Markov Models. ITCS 2019: 39:1-39:19 - [c110]Madhu Sudan, Badih Ghazi, Noah Golowich, Mitali Bafna:
Communication-Rounds Tradeoffs for Common Randomness and Secret Key Generation. SODA 2019: 1861-1871 - [i100]Madhu Sudan, Himanshu Tyagi, Shun Watanabe:
Communication for Generating Correlation: A Survey. CoRR abs/1904.09563 (2019) - [i99]Noah Golowich, Madhu Sudan:
Round Complexity of Common Randomness Generation: The Amortized Setting. CoRR abs/1909.00323 (2019) - [i98]Soheil Behnezhad, Mahsa Derakhshan, MohammadTaghi Hajiaghayi, Cliff Stein, Madhu Sudan:
Fully Dynamic Maximal Independent Set with Polylogarithmic Update Time. CoRR abs/1909.03478 (2019) - [i97]Madhu Sudan, David Xiang:
A Self-contained Analysis of the Lempel-Ziv Compression Algorithm. CoRR abs/1910.00941 (2019) - 2018
- [j63]Badih Ghazi, Ilan Komargodski, Pravesh K. Kothari, Madhu Sudan:
Communication with Contextual Uncertainty. Comput. Complex. 27(3): 463-509 (2018) - [c109]Jaroslaw Blasiok, Venkatesan Guruswami, Madhu Sudan:
Polar Codes with Exponentially Small Error at Finite Block Length. APPROX-RANDOM 2018: 34:1-34:17 - [c108]Bernhard Haeupler, Amirbehshad Shahrasbi, Madhu Sudan:
Synchronization Strings: List Decoding for Insertions and Deletions. ICALP 2018: 76:1-76:14 - [c107]Srikanth Srinivasan, Madhu Sudan:
Local Decoding and Testing of Polynomials over Grids. ITCS 2018: 26:1-26:14 - [c106]Jaroslaw Blasiok, Venkatesan Guruswami, Preetum Nakkiran, Atri Rudra, Madhu Sudan:
General strong polarization. STOC 2018: 485-492 - [i96]Jaroslaw Blasiok, Venkatesan Guruswami, Preetum Nakkiran, Atri Rudra, Madhu Sudan:
General Strong Polarization. CoRR abs/1802.02718 (2018) - [i95]Bernhard Haeupler, Amirbehshad Shahrasbi, Madhu Sudan:
Synchronization Strings: List Decoding for Insertions and Deletions. CoRR abs/1802.08663 (2018) - [i94]Mitali Bafna, Badih Ghazi, Noah Golowich, Madhu Sudan:
Communication-Rounds Tradeoffs for Common Randomness and Secret Key Generation. CoRR abs/1808.08907 (2018) - [i93]Venkatesan Guruswami, Preetum Nakkiran, Madhu Sudan:
Algorithmic Polarization for Hidden Markov Models. CoRR abs/1810.01969 (2018) - [i92]Jaroslaw Blasiok, Venkatesan Guruswami, Madhu Sudan:
Polar Codes with exponentially small error at finite block length. CoRR abs/1810.04298 (2018) - [i91]Mitali Bafna, Badih Ghazi, Noah Golowich, Madhu Sudan:
Communication-Rounds Tradeoffs for Common Randomness and Secret Key Generation. Electron. Colloquium Comput. Complex. TR18 (2018) - [i90]Jaroslaw Blasiok, Venkatesan Guruswami, Preetum Nakkiran, Atri Rudra, Madhu Sudan:
General Strong Polarization. Electron. Colloquium Comput. Complex. TR18 (2018) - 2017
- [j62]Eli Ben-Sasson, Noga Ron-Zewi, Madhu Sudan:
Sparse affine-invariant linear codes are locally testable. Comput. Complex. 26(1): 37-77 (2017) - [j61]David Gamarnik, Madhu Sudan:
Performance of Sequential Local Algorithms for the Random NAE-K-SAT Problem. SIAM J. Comput. 46(2): 590-619 (2017) - [j60]Clément L. Canonne, Venkatesan Guruswami, Raghu Meka, Madhu Sudan:
Communication With Imperfectly Shared Randomness. IEEE Trans. Inf. Theory 63(10): 6799-6818 (2017) - [c105]Badih Ghazi, Madhu Sudan:
The Power of Shared Randomness in Uncertain Communication. ICALP 2017: 49:1-49:14 - [c104]Badih Ghazi, Elad Haramaty, Pritish Kamath, Madhu Sudan:
Compression in a Distributed Setting. ITCS 2017: 19:1-19:22 - [c103]Michael Kapralov, Sanjeev Khanna, Madhu Sudan, Ameya Velingker:
(1 + Ω(1))-Αpproximation to MAX-CUT Requires Linear Space. SODA 2017: 1703-1722 - [i89]Badih Ghazi, Madhu Sudan:
The Power of Shared Randomness in Uncertain Communication. CoRR abs/1705.01082 (2017) - [i88]Srikanth Srinivasan, Madhu Sudan:
Local decoding and testing of polynomials over grids. CoRR abs/1709.06036 (2017) - [i87]Badih Ghazi, Madhu Sudan:
The Power of Shared Randomness in Uncertain Communication. Electron. Colloquium Comput. Complex. TR17 (2017) - [i86]Srikanth Srinivasan, Madhu Sudan:
Local decoding and testing of polynomials over grids. Electron. Colloquium Comput. Complex. TR17 (2017) - 2016
- [j59]Elad Haramaty, Madhu Sudan:
Deterministic Compression with Uncertain Priors. Algorithmica 76(3): 630-653 (2016) - [c102]Badih Ghazi, Pritish Kamath, Madhu Sudan:
Decidability of Non-interactive Simulation of Joint Distributions. FOCS 2016: 545-554 - [c101]Badih Ghazi, Pritish Kamath, Madhu Sudan:
Communication Complexity of Permutation-Invariant Functions. SODA 2016: 1902-1921 - [c100]Badih Ghazi, Ilan Komargodski, Pravesh Kothari, Madhu Sudan:
Communication with Contextual Uncertainty. SODA 2016: 2072-2085 - [e1]Madhu Sudan:
Proceedings of the 2016 ACM Conference on Innovations in Theoretical Computer Science, Cambridge, MA, USA, January 14-16, 2016. ACM 2016, ISBN 978-1-4503-4057-1 [contents] - [i85]Badih Ghazi, Pritish Kamath, Madhu Sudan:
Decidability of Non-Interactive Simulation of Joint Distributions. CoRR abs/1607.04322 (2016) - [i84]Mohammad Bavarian, Badih Ghazi, Elad Haramaty, Pritish Kamath, Ronald L. Rivest, Madhu Sudan:
The Optimality of Correlated Sampling. CoRR abs/1612.01041 (2016) - [i83]Mohammad Bavarian, Badih Ghazi, Elad Haramaty, Pritish Kamath, Ronald L. Rivest, Madhu Sudan:
The Optimality of Correlated Sampling. Electron. Colloquium Comput. Complex. TR16 (2016) - [i82]Badih Ghazi, Pritish Kamath, Madhu Sudan:
Decidability of Non-Interactive Simulation of Joint Distributions. Electron. Colloquium Comput. Complex. TR16 (2016) - 2015
- [j58]Elad Haramaty, Noga Ron-Zewi, Madhu Sudan:
Absolutely Sound Testing of Lifted Codes. Theory Comput. 11: 299-338 (2015) - [c99]Alan Guo, Elad Haramaty, Madhu Sudan:
Robust Testing of Lifted Codes with Applications to Low-Degree Testing. FOCS 2015: 825-844 - [c98]Clément Louis Canonne, Venkatesan Guruswami, Raghu Meka, Madhu Sudan:
Communication with Imperfectly Shared Randomness. ITCS 2015: 257-262 - [c97]Michael Kapralov, Sanjeev Khanna, Madhu Sudan:
Streaming Lower Bounds for Approximating MAX-CUT. SODA 2015: 1263-1282 - [c96]Venkatesan Guruswami, Madhu Sudan, Ameya Velingker, Carol Wang:
Limitations on Testable Affine-Invariant Codes in the High-Rate Regime. SODA 2015: 1312-1325 - [i81]Ilan Komargodski, Pravesh Kothari, Madhu Sudan:
Communication with Contextual Uncertainty. CoRR abs/1504.04813 (2015) - [i80]Badih Ghazi, Pritish Kamath, Madhu Sudan:
Communication Complexity of Permutation-Invariant Functions. CoRR abs/1506.00273 (2015) - [i79]Badih Ghazi, Pritish Kamath, Madhu Sudan:
Communication Complexity of Permutation-Invariant Functions. Electron. Colloquium Comput. Complex. TR15 (2015) - [i78]Alan Guo, Elad Haramaty, Madhu Sudan:
Robust testing of lifted codes with applications to low-degree testing. Electron. Colloquium Comput. Complex. TR15 (2015) - [i77]Ilan Komargodski, Pravesh Kothari, Madhu Sudan:
Communication with Contextual Uncertainty. Electron. Colloquium Comput. Complex. TR15 (2015) - 2014
- [c95]Alan Guo, Madhu Sudan:
List Decoding Group Homomorphisms Between Supersolvable Groups. APPROX-RANDOM 2014: 737-747 - [c94]