11 June 2019, 14:15-15:15 BARC talk by Chris Schwiegelshohn Tuesday, 11 June, Chris Schwiegelshohn, assistant professor at DIAG Faculty of Sapienza University, will give a talk "Oblivious Dimension Reduction for k-Means"
7 June 2019, 14:15-15:15 Talk by Thatchaphol Saranurak Friday, 7 June, Thatchaphol Saranurak, Research Assistant Professor, Toyota Technological Institute, Chicago, will give a talk "Breaking Quadratic Time for Small Vertex Connectivity"
16 May 2019, 16:00-17:30 AI Seminar: The Power of Theory in the Practice of Hashing with Focus on Similarity Estimation Seminar by Mikkel Thorup, Professor, Algorithms and Complexity Section, Department of Computer Science, University of Copenhagen.
14 May 2019, 14:15-15:30 BARC-QMATH talk by Avi Wigderson Tuesday, May 14th, Avi Wigderson, professor at Institute for Advanced Study, Princeton, will give a talk "Optimization, Complexity and Math (through the lens of one problem and one algorithm)"
15 Apr. 2019, 14:15-15:15 BARC talk by Mika Göös On Monday 15 April, Postdoc Mika Göös, Institute for Advanced Study, Princeton, USA, will give a talk "Adventures in Monotone Complexity"
10 Apr. 2019, 9:00-11:00 Extra AI Seminar: The Information Bottleneck Theory of Deep Learning: Towards Interpretable Deep Neural Networks Seminar by Naftali Tishby, Professor of Computer Science, Hebrew University of Jerusalem
21 Feb. 2019, 13:15-14:15 BARC talk by Konrad Swanepoel Thursday 21 February, professor Konrad Swanepoel, Department of Mathematics, London School of Economics and Political Science, will give a talk "A survey of combinatorial distance problems in normed spaces"
14 Feb. 2019, 15:15-16:15 BARC talk by Aurélien Ooms On Thursday 14 February, PhD student Aurélien Ooms, Algorithms Research Group, Université libre de Bruxelles, will give a talk "Sorting-like problems"
7 Feb. 2019, 10:15-11:15 BARC talk by Kasper Green Larsen, Feb 2019 On Thursday, 7 February, associate professor, ph.d. Kasper Green Larsen, Department of Computer Science, Aarhus University, will give a talk "Exponential Lower Bounds for Secret Sharing"
1 Feb. 2019, 13:15-14:15 BARC talk by Nikos Parotsidis Friday, 1 February, our new colleague Nikos Parotsidis joins BARC and AC section and will give a talk "Connectivity in directed Graphs: static, fault-tolerant, and dynamic"