14 Oct 2020 acto
|
Elena Zamaraeva
Leverhulme Research Centre for Functional Materials Design |
|
09 Nov 2020 dept
|
Dr. Vangelis Markakis
Department of Informatics, Athens University of Economics and Business |
Approximation Guarantees for Fairness Notions under Indivisible Resources
|
20 Nov 2020 dept
|
Bryce Sandlund
Cheriton School of Computer Science, University of Waterloo |
Lazy Search Trees
|
09 Dec 2020 ACTO/Networks
|
John Sylvester
University of Cambridge |
Choice and Bias in Random Walks
|
10 Dec 2020 networks
|
George Mertzios
Durham University |
Temporal vertex covers and sliding time windows
|
14 Jan 2021 networks
|
Nathan Harms
University of Waterloo |
Universal Communication, Universal Graphs, and Graph Labeling
|
22 Jan 2021 networks
|
Emanuele Rossi
Twitter and Imperial College |
Machine Learning on Dynamic Graphs: Temporal Graph Networks
|
27 Jan 2021 |
Andreas Alpers
University of Liverpool |
On the computational complexity of super-resolution imaging in discrete tomography
|
10 Feb 2021 |
Ninad Rajgopal
University of Oxford |
Hardness Magnification and the Locality Barrier
|
18 Mar 2021 dept
|
Dr. Rotem Oshman
Department of Computer Science, Tel-Aviv University |
Interactive Distributed Proofs
|
24 Mar 2021 |
Andrea Lincoln
UC Berkeley |
New Techniques for Proving Fine-Grained Average-Case Hardness
|
22 Apr 2021 dept
|
Prof. Damien Woods
Computer Science, Hamilton Institute, Maynooth University |
Molecular Algorithms Using Reprogrammable DNA Self-Assembly
|
26 May 2021 |
Maurice Chandoo
FernUniversitat in Hagen |
Descriptive Complexity of Graph Classes via Labeling Schemes
|