Hi all,

This is a follow-up on my previous blog post about Ph.D. positions in Algorithms and Machine Learning at Indiana University, USA (http://codeforces.me/blog/entry/45559 ). For the details about the application process see the original post and this link: http://grigory.us/phd-call.html (deadline for full applications is Dec 01, 2016).

Since that post generated some interest I have compiled a list of possible open problems in algorithms research to consider during a Ph.D.: https://www.dropbox.com/s/4mf2b6f9fa9rx91/open-new.pdf?dl=0 It is also intended to give one a sense of how modern research in algorithms looks like. The list includes a diverse set of problems covering massively parallel computation, clustering, various forms of graph sparsification, algorithmic questions in testing analytic properties of high-dimensional functions used in machine learning and topics in communication complexity.

Please, note that most of these problems are quite hard and have been studied by many researchers in the past. While I encourage you to send me solutions I can't promise to reply to your e-mail unless one of the following two conditions holds: 1) You have clearly resolved the problem. 2) You made some progress and/or have questions AND are applying for a Ph.D. position at Indiana University during this application cycle.

Good luck!

-- Best, Grigory [email protected]