|
14 Sep 2022 |
Duncan Adamson
Reykjavik University |
The k-center Problem for Classes of Cyclic Words
|
20 Sep 2022
dept
|
Prof. Thomas Sauerwald
Department of Computer Science and Technology, University of Cambridge |
Balanced Allocations: The Power of Choice versus Noise
|
11 Oct 2022
dept
|
Prof. Carmine Ventre
King`s College London |
Systemic risk in financial networks -- a computational perspective
|
18 Oct 2022
dept
|
Prof. Abraham Neyman
Einstein Institute of Mathematics, The Hebrew University of Jerusalem |
Stochastic games with limited memory space
|
10 Nov 2022
dept
|
Prof. Arnaud Casteigts
LaBRI, University of Bordeaux |
Spanners and connectivity problems in temporal graphs
|
|
15 Nov 2022 |
Nikhil Mande
CWI, Amsterdam |
Lifting theorems for parity decision trees
|
09 Jan 2023
dept
|
Prof. Gerth Stølting Brodal
Department of Computer Science, Aarhus University |
The challenges of implementing Dijkstras algorithm
|
10 Jan 2023
dept
|
Dr. Édouard Bonnet
University of Lyon, CNRS, ENS de Lyon |
A gentle introduction to twin-width
|
31 Jan 2023
dept
|
Dr. Tony Tan
Department of Computer Science and Information Engineering, National Taiwan University |
DQBF is a CNF formula in succinct representation
|
17 Feb 2023
dept
|
Dr. Qiyi Tang
Department of Computer Science, University of Liverpool |
Comparison and analysis of probabilistic systems
|
21 Feb 2023
dept
|
Dr. Galit Ashkenazi-Golan
Department of Mathematics, London School of Economics and Political Science |
Granular DeGroot Dynamics: A Model for Robust Naive Learning in Social Networks
|
28 Feb 2023
dept
|
Prof. Raphaël Jungers
Institute for Information and Communication Technologies, Electronics and Applied Mathematics, Université Catholique de Louvain |
Path-complete Lyapunov functions: graph-theory and algebraic geometry for controlling complex systems
|
03 Mar 2023
dept
|
Dr. Procheta Sen
Department of Computer Science, University of Liverpool |
Building Trustworthy Intelligent Information Access Systems
|
09 Mar 2023
dept
|
Dr. Sagnik Mukhopadhyay
Department of Computer Science, University of Sheffield |
Alice and Bob Walked into a Graph...
|
14 Mar 2023
dept
|
Dr. Maksim Zhukovskii
Department of Computer Science, University of Sheffield |
First order complexity of random structures
|
17 Mar 2023
dept
|
Dr. David Purser
Department of Computer Science, University of Liverpool |
Linear Recurrence Sequences, Weighted Automata and their Ambiguity
|
21 Mar 2023
dept
|
Dr. Siddharth Gupta
Department of Computer Science, University of Warwick |
Drawing Graphs on the Grid: How Easy Is It?
|
04 Apr 2023
dept
|
Prof. Theodore Turocy
School of Economics, University of East Anglia |
Computation in game theory: A view from economics
|
21 Apr 2023
dept
|
Dr. Nikhil Mande
Department of Computer Science, University of Liverpool |
Understanding the power and limitations of randomness and quantumness
|
25 Apr 2023
dept
|
Dr. Elena Arseneva
University of Lugano, Switzerland |
Morphing planar drawings of graphs and trees in 2 and 3 dimensions
|
05 May 2023
dept
|
Dr. John Sylvester
Department of Computer Science, University of Liverpool |
Choice and Bias in Random Walks
|
09 May 2023
dept
|
Dr. Andreas Galanis
Department of Computer Science, University of Oxford |
Fast sampling of satisfying assignments from the k-SAT model
|
23 May 2023
dept
|
Dr. Hsiang-Hsuan (Alison) Liu
Utrecht University |
The Power of Amortized Recourse for Online Graph Problems
|
23 May 2023
ACTO/Networks
|
Konstantinos Tsakalidis
University of Liverpool |
Deep neural network training acceleration with geometric data structures
|
06 Jun 2023
dept
|
Prof. Krzysztof Apt
Centrum Wiskunde & Informatica |
Characterization of Incentive Compatible Single-parameter Mechanisms Revisited
|
13 Jun 2023
dept
|
Dr. Zhanxing Zhu
Changping National Lab, China |
Theoretical understanding of learning dynamics in modern deep learning
|
27 Jun 2023
dept
|
Justin Dallant
Algorithms Research Group, Université libre de Bruxelles |
Conditional Lower Bounds for Dynamic Geometric Measure Problems
|
29 Jun 2023
dept
|
Dr. Nikhil Balaji
Department of Computer Science and Engineering, IIT Delhi |
Testing Equality of Compressed Strings in Randomised NC
|
13 Jul 2023
dept
|
Prof. Alexandru Popa
Faculty of Mathematics and Computer Science, University of Bucharest |
Timeline Cover in Temporal Graphs: Exact and Approximation Algorithms
|
27 Jul 2023
dept
|
Benjamin Berendsohn
Freie Universität Berlin |
Search trees on trees
|
10 Aug 2023
acto
|
Akitoshi Kawamura
Kyoto University |
Density threshold in pinwheel scheduling
|
