The Institute of Mathematics of the Eötvös Loránd University, Budapest
is organizing a one week long summer school in mathematics. This year, the topic of the school will be
Discrete algorithms play an essential role in everyday life. The accelerating development of technology constantly requires new ideas and solutions to problems arising from real life applications. Many well-known technology products that have became the integral part of our life - such as computers, mobile phones, GPS, cryptography, or the internet itself - are heavily based on such algorithms.
The aim of the summer school is to give an insight into the area of discrete algorithms. The lectures will discuss both theoretical and applied results. The participants will also have the opportunity to get acquainted with the LEMON C++ template library that provides efficient implementations of common data structures and algorithms.
If you are a student in Mathematics or Computer Science, and want to broaden your knowledge on discrete algorithms, then you are at the right place!
If you want to get a first hand experience of the tradition of university level Hungarian mathematics education, why not visit the university whose alumni and former professors include Frigyes Riesz, Lipót Fejér, John von Neumann, Pál Turán and Pál Erdős? Did you know that Endre Szemerédi, an Abel prize laureate (2012) graduated from Eötvös University? And so did László Lovász, winner of the Kyoto Prize (2010), Gödel Prize (2001), Wolf Prize (1999) and Fulkerson Prize (1982, 2012), who is the current president of the Hungarian Academy of Sciences.
If you are planning your future and want to check out our graduate school which offers an English language MSc program, then this is a good opportunity to do so with a 1-week long, intensive experience.
If you are interested in a true European metropolitan city with a vivid cultural life, then Budapest is an obvious choice.
Due to the problems with the Swift code experienced by some of the participants when trying to transfer the registration fee, the early-bird registration is extended until May 7!
István Fekete, István László: Mathematical analysis of satellite images
Róbert Freud: Hundred thousand dollars for a prime number
Katalin Gyarmati: Pseudorandom binary sequences and lattices
Zoltán Halasi: Permutation group algorithms
Alpár Jüttner: LEMON: Library for Efficient Modeling and Optimization in Networks
Tamás Király: Graph algorithms and LP duality
Zoltán Király: Recent techniques in algorithm design
Tamás Kis: Scheduling problems and algorithms
The lecturers will hand out exercises during their minicourses. For participants solving these exercises, we will issue certificates worth 3 ECTS credits. If this is useful for you, please check the requirements of your university to accept these, as some universities require the registration of the course beforehand.
Cost and Deadlines
The fee for participation in the Summer School is 120 Euros (135 USD) if paid by May 7, and 170 Euros (190 USD) afterwards. The fee covers printed course material and refreshments. Accommodation is not included, but we can help you arrange it, see here.
Registration (and payment of the fee) begins on February 1, 2016 and will be closed on May 31, 2016. See the payment information.
Please note that the university is not able to refund the registration fee in case of cancellation.
First day of classes: June 6, 2016.
Last day of classes: June 10, 2016.