The course of Andrei Goldberg "The shortest paths and maximum flows"

From March 4 to April 9, 2011 in Moscow, Andrei Goldberg (Microsoft Research) will give a course of lectures "The shortest paths and maximum flows" ( [1] , [2] ). The course will affect both theoretical and practical aspects (for example, how to quickly find the shortest paths in road networks ).

From listeners are required:

• knowledge of algorithms at the level of Cormen’s book ,
• the ability to program and understand how to write fast code,
• ability to read English technical literature.

If you want to listen to the course, then you need to send a request to the box ys.applications+pfa@gmail.com, which should include:

• name and contact information (telephone, e-mail),
• place of study, faculty, department and course,
• courses on the algorithms that you listened to, with estimates,
• information that will help you to select exactly if there are too many applications (letters of recommendation, diplomas, publications).

Classes will be held on the basis of the Yandex Data Analysis School on Fridays: from 18:00 to 20:00 lectures, and from 20:00 to 21:00 - seminars.
')
See the Call for Participation for details.

Attention! After the publication of the post on Habré, many applications came, much more than there are places, so the selection will be quite serious, and the last item in the application is of great importance.