Skip to main content
MIT CSAIL Theory of Computation MIT CSAIL
  • Accessibility
  • login
  • home
    • About
    • TOC Calendar
    • Contact
  • People
    • Faculty
    • Research Scientists
    • lecturers
    • Postdocs
    • Students
    • Visitors
    • Support Staff
    • Alumni
  • Research Groups
    • Algorithms
    • Complexity Theory
      • Complexity Theory Courses
    • Computation & Biology
    • Computation and Economics
    • Computational Connectomics
    • Cryptography and Information Security
    • Learning-Augmented Algorithms
    • Multicore Algorithmics
    • Parallel Computing
      • Applied Computing
      • Supertech Research
    • Quantum Information Science
    • Sublinear Algorithms
    • Theory of Distributed Systems
    • Theory of Machine Learning
  • Seminars
    • Theory of Computation Colloquium
    • Algorithms and Complexity Seminars
    • Theory of Distributed Systems (TDS)
    • CRYPTOGRAPHY AND INFORMATION SECURITY (CIS) SEMINARS
    • Bioinformatics Seminars
    • Theory Reading Group
  • Courses
    • Course Calendar
    • Course Descriptions
    • Who Is Teaching What (Spring 2025)
  • Miscellaneous
    • New Student Blog: Not so Great Ideas in Theoretical Computer Science
    • TOC People in the News: 2009-2012
    • Awards
    • Algorithms Office Hours
  • TOC in Pictures
    • People
    • Celebrations
    • Retreats
    • Corn Fest

Indyk and Backurs in MIT News: Longstanding problem put to rest

Thu, 06/18/2015


Longstanding problem put to rest

Proof that a 40-year-old algorithm is the best possible will come as a relief to computer scientists.

Piotr Indyk and Arturs Backurs STOC 2015 paper is in a MIT News Article, June 10, 2015.