IBM computer scientists have been at the forefront of scientific and technological innovation across a broad range of research areas. They have made pioneering contributions in artificial intelligence, high-speed processor design, computer architecture, natural language processing, programming languages, optimizing compilers, operating systems, storage systems, computer-supported cooperative work, databases, speech recognition, integer programming, and service-oriented architectures, to name a few.
Congratulations to Subhash Khot of the Courant Institute (and once upon a time, an intern at IBM Research) for being awarded the Rolf Nevalnlinna Prize for 2014 by the International Mathematical Union. Khot was recognized for the Unique Games Conjecture, which generated “new exciting interactions between computational complexity, analysis and geometry.” The Simon's Foundation describes the work: "Khot’s paper describing the Unique Games Conjecture appeared in 2002. The first hint of the conjecture’s power came a year later when Khot and Oded Regev, now of New York University, showed that if the conjecture is true, then it is possible to establish the exact approximation hardness of a problem about networks called Minimum Vertex Cover. Then, in 2004, Khot and three collaborators used the conjecture to produce an unexpected finding. They showed that if the conjecture is true, then the best known approximation algorithm for another network problem called Max Cut — an algorithm that many computer scientists had assumed was just a placeholder until they could find a better one — was truly the best possible"