5 minutes with…

  • Permalink Gallery

    5 Minutes with Igal Milchtaich: polyequilibria and game theory

5 Minutes with Igal Milchtaich: polyequilibria and game theory

Igal Milchtaich is from the Department of Economics at Bar-Ilan University in Israel. Recently he visited the department and gave a very interesting talk on polyequilibria. Afterwards Andy Lewis-Pye was able to talk with him:
(1) You gave a very interesting talk on polyequilibria. Perhaps you could briefly summarise for the layman what this work is about? Could you say […]

  • Permalink Gallery

    5 Minutes with George Bampalias: algorithmic randomness and learning theory

5 Minutes with George Bampalias: algorithmic randomness and learning theory

George Bampalias works at the Institute of Software, Chinese Academy of Sciences, and visited the mathematics department in January 2018. After George gave a very interesting talk on learning theory, he was interviewed by our own Andy Lewis-Pye…
(1) You’ve worked a lot in the area of “algorithmic randomness”. Could you sum up for the layman, what it’s all about?
Algorithmic […]

  • Permalink Gallery

    5 Minutes with Nóra Frankl (PhD, Department of Mathematics)

5 Minutes with Nóra Frankl (PhD, Department of Mathematics)

Nóra Frankl is a PhD candidate who joined the Department of Mathematics in October 2016, having obtained an MSc in Mathematics from Loránd Eötvös University, Budapest.  Her supervisor is Dr. Konrad Swanepoel and she works closely with a number of other PhD students within the Department.  Written in June 2017, read about her experience in discrete geometry and advice for prospective candidates on […]

5 Minutes with Milan Vojnovic

Professor Milan Vojnovic is a Chair in Data Science in the Department of Statistics, London School and Economics & Political Science.  With the publication of Contest Theory, we took the opportunity to interview the author to find out more about his book and how it relates to his career.

 

What piqued your interest in the topic of contest theory?
I got […]

5 Minutes with Hal Kierstead

Hal Kierstead is a Professor at the School of Mathematical and Statistical Sciences in Arizona State University.  He visited our Department in September to work with Jan van den Heuvel and Daniel Quiroz.  He also spoke at our Seminar on Combinatorics, Games and Optimisation about the history and applications of generalised colouring numbers, a notion which arose from an […]

5 Minutes with Marc Renault

Marc Renault is currently a CNRS postdoc at the Institut de Recherche en Informatique Fondamentale (IRIF; formerly LIAFA), Université Paris Diderot – Paris 7.  He visited our Department in June 2016 to speak at our Seminar on Combinatorics, Games and Optimisation about “The Bijective Ratio of Online Algorithms”. Whilst he was in London, Tom Lidbetter took the opportunity to discover […]

5 Minutes with Maura Paterson

Maura Paterson (Birkbeck, University of London) visited our Department to present her seminar on “Applications of Disjoint Difference Families”.  She also kindly took time out with Julia Böttcher (LSE) to answer a few questions on her research interests and how she takes a break from mathematics.

 

Late last year, you gave a talk in our Seminar on Discrete Mathematics and […]

5 minutes with Frank Wilczek

We were very pleased to have (Nobel Laureate) Frank Wilczek (Massachusetts Institute of Technology) visit the department and give a fantastic public lecture based on his new book to a packed Old Theatre. To view his presentation, “A Beautiful Question: finding nature’s deep design”, click here. Afterwards Andy Lewis-Pye (LSE) conducted a brief interview with Frank, to follow up […]

5 minutes with Andre Nies

Andre Nies (University of Auckland) visited our Department to present his seminar on “Interactions of computability and randomness”.  He also kindly took time out with Andy Lewis-Pye (LSE) to answer a few questions on his research, the future of algorithmic randomness and incorporating classical music into his presentations.

 

 

 

You’ve been doing some fascinating work on the interactions between computability and randomness. […]