Madhu Sudan
Orcid: 0000000337186489Affiliations:
 Harvard University, School of Engineering and Applied Sciences, Boston, MA, USA
 Microsoft Research New England, Cambridge, MA, USA
According to our database^{1},
Madhu Sudan
authored at least 194 papers
between 1990 and 2024.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
Online presence:

on zbmath.org

on viaf.org

on orcid.org

on id.loc.gov

on dnb.info

on isni.org

on dl.acm.org
On csauthors.net:
Bibliography
2024
Comput. Complex., June, 2024
J. ACM, April, 2024
Electron. Colloquium Comput. Complex., 2024
CoRR, 2024
CoRR, 2024
Proceedings of the 2024 ACMSIAM Symposium on Discrete Algorithms, 2024
Proceedings of the 51st International Colloquium on Automata, Languages, and Programming, 2024
Proceedings of the Thirty Seventh Annual Conference on Learning Theory, June 30, 2024
2023
Electron. Colloquium Comput. Complex., 2023
CoRR, 2023
On kMerBased and Maximum Likelihood Estimation Algorithms for Trace Reconstruction.
CoRR, 2023
Proceedings of the 14th Innovations in Theoretical Computer Science Conference, 2023
Proceedings of the 64th IEEE Annual Symposium on Foundations of Computer Science, 2023
Proceedings of the Approximation, 2023
2022
ACM Trans. Comput. Theory, 2022
Limitations of MeanBased Algorithms for Trace Reconstruction at Small Edit Distance.
IEEE Trans. Inf. Theory, 2022
Electron. Colloquium Comput. Complex., 2022
Electron. Colloquium Comput. Complex., 2022
Electron. Colloquium Comput. Complex., 2022
Electron. Colloquium Comput. Complex., 2022
Proceedings of the 49th International Colloquium on Automata, Languages, and Programming, 2022
2021
Electron. Colloquium Comput. Complex., 2021
Electron. Colloquium Comput. Complex., 2021
Electron. Colloquium Comput. Complex., 2021
Electron. Colloquium Comput. Complex., 2021
CoRR, 2021
Proceedings of the IEEE International Symposium on Information Theory, 2021
Proceedings of the 62nd IEEE Annual Symposium on Foundations of Computer Science, 2021
2020
Theory Comput., 2020
IEEE Trans. Inf. Theory, 2020
Random Struct. Algorithms, 2020
Electron. Colloquium Comput. Complex., 2020
Proceedings of the 2020 ACMSIAM Symposium on Discrete Algorithms, 2020
2019
CoRR, 2019
CoRR, 2019
Proceedings of the 10th Innovations in Theoretical Computer Science Conference, 2019
Proceedings of the 60th IEEE Annual Symposium on Foundations of Computer Science, 2019
2018
Electron. Colloquium Comput. Complex., 2018
Electron. Colloquium Comput. Complex., 2018
Comput. Complex., 2018
Proceedings of the 45th International Colloquium on Automata, Languages, and Programming, 2018
Proceedings of the Approximation, 2018
2017
SIAM J. Comput., 2017
Electron. Colloquium Comput. Complex., 2017
Electron. Colloquium Comput. Complex., 2017
Comput. Complex., 2017
Proceedings of the TwentyEighth Annual ACMSIAM Symposium on Discrete Algorithms, 2017
Proceedings of the 8th Innovations in Theoretical Computer Science Conference, 2017
2016
Electron. Colloquium Comput. Complex., 2016
Electron. Colloquium Comput. Complex., 2016
2015
Electron. Colloquium Comput. Complex., 2015
Electron. Colloquium Comput. Complex., 2015
Electron. Colloquium Comput. Complex., 2015
Proceedings of the TwentySixth Annual ACMSIAM Symposium on Discrete Algorithms, 2015
2014
Electron. Colloquium Comput. Complex., 2014
Electron. Colloquium Comput. Complex., 2014
Performance of the Survey Propagationguided decimation algorithm for the random NAEKSAT problem.
CoRR, 2014
Proceedings of the Symposium on Theory of Computing, 2014
Proceedings of the TwentyFifth Annual ACMSIAM Symposium on Discrete Algorithms, 2014
Proceedings of the Approximation, 2014
2013
SIGMETRICS Perform. Evaluation Rev., 2013
SIAM J. Comput., 2013
Extensions to the Method of Multiplicities, with Applications to Kakeya Sets and Mergers.
SIAM J. Comput., 2013
Electron. Colloquium Comput. Complex., 2013
Electron. Colloquium Comput. Complex., 2013
Comput. Complex., 2013
2012
A new upper bound on the query complexity for testing generalized ReedMuller codes.
Electron. Colloquium Comput. Complex., 2012
Electron. Colloquium Comput. Complex., 2012
Electron. Colloquium Comput. Complex., 2012
Electron. Colloquium Comput. Complex., 2012
Electron. Colloquium Comput. Complex., 2012
Proceedings of the 2012 IEEE Information Theory Workshop, 2012
2011
SIGACT News, 2011
Games Econ. Behav., 2011
Electron. Colloquium Comput. Complex., 2011
Electron. Colloquium Comput. Complex., 2011
Commun. ACM, 2011
Compression without a common prior: an informationtheoretic justification for ambiguity in language.
Proceedings of the Innovations in Computer Science, 2011
Proceedings of the IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2011
Proceedings of the IEEE 52nd Annual Symposium on Foundations of Computer Science, 2011
Proceedings of the Studies in Complexity and Cryptography. Miscellanea on the Interplay between Randomness and Computation, 2011
2010
IEEE Trans. Inf. Theory, 2010
SIAM J. Comput., 2010
Electron. Colloquium Comput. Complex., 2010
Electron. Colloquium Comput. Complex., 2010
Electron. Colloquium Comput. Complex., 2010
Electron. Colloquium Comput. Complex., 2010
Electron. Colloquium Comput. Complex., 2010
Electron. Colloquium Comput. Complex., 2010
Proceedings of the Property Testing  Current Research and Surveys, 2010
Proceedings of the Property Testing  Current Research and Surveys, 2010
Proceedings of the Property Testing  Current Research and Surveys, 2010
Tight asymptotic bounds for the deletion channel with small deletion probabilities.
Proceedings of the IEEE International Symposium on Information Theory, 2010
2009
Electron. Colloquium Comput. Complex., 2009
Electron. Colloquium Comput. Complex., 2009
Electron. Colloquium Comput. Complex., 2009
Commun. ACM, 2009
2008
SIAM J. Comput., 2008
Electron. Colloquium Comput. Complex., 2008
Electron. Colloquium Comput. Complex., 2008
Electron. Colloquium Comput. Complex., 2008
Proceedings of the Symbolic and Algebraic Computation, International Symposium, 2008
2007
ACM Trans. Algorithms, 2007
Electron. Colloquium Comput. Complex., 2007
Electron. Colloquium Comput. Complex., 2007
Electron. Colloquium Comput. Complex., 2007
Proceedings of the Advances in Cryptology, 2007
2006
Special Issue on Randomness and Complexity.
SIAM J. Comput., 2006
SIAM J. Comput., 2006
Networks, 2006
Electron. Colloquium Comput. Complex., 2006
Des. Codes Cryptogr., 2006
Proceedings of the LATIN 2006: Theoretical Informatics, 2006
Proceedings of the Approximation, 2006
2005
Proceedings of the Distributed Computing, 19th International Conference, 2005
Proceedings of the Theory of Cryptography, Second Theory of Cryptography Conference, 2005
Proceedings of the 20th Annual IEEE Conference on Computational Complexity (CCC 2005), 2005
2004
Electron. Colloquium Comput. Complex., 2004
Electron. Colloquium Comput. Complex., 2004
Electron. Colloquium Comput. Complex., 2004
Proceedings of the Computational Complexity Theory., 2004
2003
Electron. Colloquium Comput. Complex., 2003
Proceedings of the 35th Annual ACM Symposium on Theory of Computing, 2003
Proceedings of the 35th Annual ACM Symposium on Theory of Computing, 2003
2002
IEEE Trans. Inf. Theory, 2002
SIAM J. Comput., 2002
J. Comput. Syst. Sci., 2002
Electron. Colloquium Comput. Complex., 2002
Proceedings of the Thirteenth Annual ACMSIAM Symposium on Discrete Algorithms, 2002
Proceedings of the 17th Annual IEEE Conference on Computational Complexity, 2002
2001
IEEE Trans. Inf. Theory, 2001
J. Comput. Syst. Sci., 2001
J. Comput. Syst. Sci., 2001
J. ACM, 2001
Proceedings of the 42nd Annual Symposium on Foundations of Computer Science, 2001
Proceedings of the Applied Algebra, 2001
Complexity classifications of Boolean constraint satisfaction problems.
SIAM monographs on discrete mathematics and applications 7, SIAM, ISBN: 9780898714791, 2001
2000
SIGACT News, 2000
SIAM J. Comput., 2000
SIAM J. Comput., 2000
Comput. Complex., 2000
Proceedings of the ThirtySecond Annual ACM Symposium on Theory of Computing, 2000
Proceedings of the ThirtySecond Annual ACM Symposium on Theory of Computing, 2000
Proceedings of the 41st Annual Symposium on Foundations of Computer Science, 2000
Proceedings of the Algorithms, 2000
1999
IEEE Trans. Inf. Theory, 1999
J. Comput. Syst. Sci., 1999
Electron. Colloquium Comput. Complex., 1999
Proceedings of the ThirtyFirst Annual ACM Symposium on Theory of Computing, 1999
Proceedings of the 14th Annual IEEE Conference on Computational Complexity, 1999
1998
SIAM J. Discret. Math., 1998
SIAM J. Comput., 1998
SIAM J. Comput., 1998
SIAM J. Comput., 1998
SIAM J. Comput., 1998
J. ACM, 1998
J. ACM, 1998
Electron. Colloquium Comput. Complex., 1998
Electron. Colloquium Comput. Complex., 1998
Electron. Colloquium Comput. Complex., 1998
Electron. Colloquium Comput. Complex., 1998
Electron. Colloquium Comput. Complex., 1998
Electron. Colloquium Comput. Complex., 1998
Algorithmica, 1998
1997
J. Complex., 1997
Future Gener. Comput. Syst., 1997
Electron. Colloquium Comput. Complex., 1997
A Complete Classification of the Approximability of Maximization Problems Derived from Boolean Constraint Satisfaction.
Proceedings of the TwentyNinth Annual ACM Symposium on the Theory of Computing, 1997
Proceedings of the Foundations of Software Technology and Theoretical Computer Science, 1997
1996
IEEE Trans. Inf. Theory, 1996
IEEE Trans. Inf. Theory, 1996
SIAM J. Comput., 1996
J. ACM, 1996
Electron. Colloquium Comput. Complex., 1996
A Complete Characterization of the Approximability of Maximization Problems Derived from Boolean Constraint Satisfaction
Electron. Colloquium Comput. Complex., 1996
Electron. Colloquium Comput. Complex., 1996
Proceedings of the TwentyEighth Annual ACM Symposium on the Theory of Computing, 1996
Proceedings of the 37th Annual Symposium on Foundations of Computer Science, 1996
Proceedings of the 37th Annual Symposium on Foundations of Computer Science, 1996
1995
Electron. Colloquium Comput. Complex., 1995
Proceedings of the Third Israel Symposium on Theory of Computing and Systems, 1995
Proceedings of the Integer Programming and Combinatorial Optimization, 1995
Proceedings of the 36th Annual Symposium on Foundations of Computer Science, 1995
Efficient Checking of Polynomials and Proofs anf the Hardness of Approximation Problems
Lecture Notes in Computer Science 1001, Springer, ISBN: 3540606157, 1995
1994
Discret. Appl. Math., 1994
Algorithmica, 1994
Proceedings of the TwentySixth Annual ACM Symposium on Theory of Computing, 1994
Proceedings of the TwentySixth Annual ACM Symposium on Theory of Computing, 1994
Proceedings of the Fifth Annual ACMSIAM Symposium on Discrete Algorithms. 2325 January 1994, 1994
Proceedings of the 35th Annual Symposium on Foundations of Computer Science, 1994
1992
Inf. Process. Lett., 1992
Proceedings of the Third Annual ACM/SIGACTSIAM Symposium on Discrete Algorithms, 1992
1991
Proceedings of the 23rd Annual ACM Symposium on Theory of Computing, 1991
1990
Proceedings of the 22nd Annual ACM Symposium on Theory of Computing, 1990