Month: November 2016

Prof. De’s research at FOCS 2016

TCS Prof. Anindya De had a joint paper with Michael Saks (Rutgers) and Sijian Tang (Rutgers) in 57th Annual IEEE Symposium on Foundations of Computer Science (FOCS 16). The paper “Noisy population recovery in polynomial time” addresses the problem of recovering an unknown distribution on binary strings under noise. This problem is related to well-studied problems in learning such as learning mixtures of spherical Gaussians and product distributions. A manuscript of the paper can be found here.




Abhratanu Dutta and Yiding Feng finish 1st in ACM-ICPC Midcentral Regional

Theory PhD students Abhratanu Dutta and Yiding Feng along with their teammate Ruohong Zhang finished first at the ACM-ICPC Midcentral Regional Programming Contest this year. They finished in 1st place out of 156 teams representing 56 different schools in total and have advanced to the ACM-ICPC World Finals in Rapid City, South Dakota from May 20-25, 2017.

The ACM-ICPC (Association for Computing Machinery – International Collegiate Programming Contest) is a multi-tier, team-based, programming competition. Headquartered at Baylor University, Texas, it operates according to the rules and regulations formulated by the ACM. The contest participants come from over 2,000 universities that are spread across 80 countries and six continents.

Details can be found here.