Skip to main content
SpringerLink
Log in

Madhu Sudan receives Nevanlinna Prize

  • Research News
  • Published:
Resonance Aims and scope Submit manuscript

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Suggested Reading

  1. Madhu Sudan, Efficient Checking of Polynomials and Proofs and the Hardness of Approximation Problems, ACM Distinguished Theses Series, Lecture Notes in Computer Science, Vol. 1001. Springer, 1996.

  2. Madhu Sudan, Algorithmic Issues in Coding Theory, Proceedings of the 17th Annual Conference on Foundations of Software Technology and Theoretical Computer Science (Kharagpur, India), Lecture Notes in Computer Science, Vol. 1346 pp. 184–199. Springer 1997.

    Article  Google Scholar 

  3. Madhu Sudan, List Decoding: Algorithms and Applications, SIGACT News, (ACM Special Interest Group on Automata and Computability Theory), Vol. 31, 2000.

  4. Several course notes are available on Madhu Sudan’s home page at http://theory.lcs.mit.edu/ ~madhu/

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science and Automation, Indian Institute of Science, 560012, Bangalore, India

    Meena Mahajan & Priti Shankar

Authors
  1. Meena Mahajan
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Priti Shankar
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Mahajan, M., Shankar, P. Madhu Sudan receives Nevanlinna Prize. Reson 7, 84–90 (2002). https://doi.org/10.1007/BF02834533

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF02834533

Search

Navigation