Daniel A. Spielman and Shang-Hua Teng have won the 20-year STOC Test of Time Award for their paper “Smoothed analysis of algorithms: why the simplex algorithm usually takes...
The Yale students Deyuan Li (TC’24), Dion Ong (TD’24) and Andrew Yuan (BF’23) participated in the International Collegiate Programming Contest (ICPC). After scoring excellent...
Yale CS congratulates recent Computing and the Arts (CPAR) graduate Kenia Hale for receiving the Nakanishi Prize, which is “awarded to two graduating seniors who, while...
Infinite complexity
Sometimes, even mathematicians rely on intuition. Professor Daniel Spielman’s helped him solve an unsolvable problem.
By Richard Panek | May/Jun...
