Everyone (or at least all combinatorialists) should learn the basics of the theory of computation.

]]>https://www.cs.auckland.ac.nz/research/groups/theory/4ICC/invited/ ]]>

– LÃ¡szlÃ³ LovÃ¡sz, Simons Foundation (2013), https://www.simonsfoundation.org/science_lives_video/laszlo-lovasz/

– Simeon Ball, BIRS (2011), proof of the MDS conjecture for prime fields, which is a generalisation of the classical result by Segre on ovals over finite fields of odd order, http://www.birs.ca/events/2011/5-day-workshops/11w5119/videos

– Aart Blokhuis, BIRS (2009), Covering all points but one, http://www.birs.ca/events/2009/5-day-workshops/09w5071/videos/watch/200904010900-Blokhuis.html, based on this paper http://link.springer.com/article/10.1007%2Fs10801-009-0204-1

]]>