Travelled to:10 × USA
2 × Canada
Collaborated with:E.Ben-Sasson S.P.Vadhan D.Coppersmith O.Goldreich D.P.Williamson B.Juba T.Kaufman V.Guruswami S.Arora M.Bellare P.Raghavan A.Wigderson M.Ghaffari B.Haeupler D.Ron L.Trevisan S.Khanna J.M.Kleinberg R.Rubinfeld I.Dinur E.Grigorescu S.Kopparty M.W.Bern D.H.Greene A.Raghunathan P.Harsha A.Borodin P.Gemmell R.J.Lipton G.Aggarwal A.Fiat A.V.Goldberg J.D.Hartline N.Immorlica A.Blum P.Chalasani W.R.Pulleyblank R.Fagin A.R.Karlin S.Rajagopalan A.Tomkins
Talks about:test (4) pcps (4) approxim (3) code (3) algorithm (2) problem (2) random (2) improv (2) applic (2) error (2)
Person: Madhu Sudan
DBLP: Sudan:Madhu
Contributed to:
201420082005200420032000199919971996199419911990Wrote 20 papers:
- STOC-2014-GhaffariHS #adaptation #fault #interactive
- Optimal error rates for interactive coding I: adaptivity and other settings (MG, BH, MS), pp. 794–803.
- STOC-2008-DinurGKS #bound #morphism
- Decodability of group homomorphisms beyond the johnson bound (ID, EG, SK, MS), pp. 275–284.
- STOC-2008-JubaS #communication #semantics
- Universal semantic communication I (BJ, MS), pp. 123–132.
- STOC-2008-KaufmanS #algebra #testing
- Algebraic property testing: the role of invariance (TK, MS), pp. 403–412.
- STOC-2005-AggarwalFGHIS
- Derandomization of auctions (GA, AF, AVG, JDH, NI, MS), pp. 619–625.
- STOC-2005-Ben-SassonS #complexity #query
- Simple PCPs with poly-log rate and query complexity (EBS, MS), pp. 266–275.
- STOC-2004-Ben-SassonGHSV #proximity #robust
- Robust pcps of proximity, shorter pcps and applications to coding (EBS, OG, PH, MS, SPV), pp. 1–10.
- STOC-2003-Ben-SassonSVW #testing
- Randomness-efficient low degree tests and short PCPs via epsilon-biased sets (EBS, MS, SPV, AW), pp. 612–621.
- STOC-2003-CoppersmithS #higher-order #semistructured data
- Reconstructing curves in three (and higher) dimensional space from noisy data (DC, MS), pp. 136–142.
- STOC-2000-FaginKKRRRST #random
- Random walks with “back buttons” (RF, ARK, JMK, PR, SR, RR, MS, AT), pp. 484–493.
- STOC-2000-GuruswamiS #algorithm
- List decoding algorithms for certain concatenated codes (VG, MS), pp. 181–190.
- STOC-1999-GoldreichRS #fault
- Chinese Remaindering with Errors (OG, DR, MS), pp. 225–234.
- STOC-1999-SudanTV #generative #pseudo
- Pseudorandom Generators Without the XOR Lemma (MS, LT, SPV), pp. 537–546.
- STOC-1997-AroraS #testing
- Improved Low-Degree Testing and its Applications (SA, MS), pp. 485–495.
- STOC-1997-KhannaSW #classification #constraints #problem
- A Complete Classification of the Approximability of Maximization Problems Derived from Boolean Constraint Satisfaction (SK, MS, DPW), pp. 11–20.
- STOC-1996-BorodinKRSW
- Adversarial Queueing Theory (AB, JMK, PR, MS, DPW), pp. 376–385.
- STOC-1994-BellareS
- Improved non-approximability results (MB, MS), pp. 184–193.
- STOC-1994-BlumCCPRS #latency #problem
- The minimum latency problem (AB, PC, DC, WRP, PR, MS), pp. 163–171.
- STOC-1991-GemmellLRSW #approximate #self
- Self-Testing/Correcting for Polynomials and for Approximate Functions (PG, RJL, RR, MS, AW), pp. 32–42.
- STOC-1990-BernGRS #algorithm #online
- Online Algorithms for Locating Checkpoints (MWB, DHG, AR, MS), pp. 359–368.