|
08 Sep 2021 |
Bei Peng
|
Cooperative Deep Multi-Agent Reinforcement Learning
|
DMML
|
|
24 Sep 2021 |
Yury Elkin
|
Cover trees for k-nearest neighbour search in a metric space (part 1)
|
DSTA
|
|
01 Oct 2021 |
Yury Elkin
|
Cover trees for k-nearest neighbour search in a metric space (part 2)
|
DSTA
|
|
06 Oct 2021 |
Navjot Kukreja
|
High-performance backpropagation
|
DMML
|
|
13 Oct 2021 |
Nicos Protopapas
|
Truthful aggregations of budget proposals with proportionality guarantees
|
EcCo
|
|
14 Oct 2021 |
Paul Spirakis
|
Actively Dynamic Networks
|
NESTiD
|
|
16 Oct 2021 |
Armando Castaneda
Universidad Nacional Autonoma de Mexico |
Synchronous t-Resilient Consensus in Arbitrary Graphs
|
NESTiD
|
|
03 Nov 2021 |
Dr Heba Lakany
Department of Electrical Engineering & Electronics |
Human movement: An Engineering perspective
|
wit
|
|
11 Nov 2021 |
Viktor Zamaraev
|
Sharp thresholds in random simple temporal graphs
|
NESTiD
|
|
25 Nov 2021 |
Valerie King
University of Victoria, Canada |
Distributed connectivity and the k-out random graph conjecture
|
NESTiD
|
|
01 Dec 2021 |
Robert Loftin
TU Delft |
Strategically Efficient Exploration for Multi-Agent Reinforcement Learning
|
EcCo
|
|
09 Dec 2021 |
Leszek Gasieniec
|
A time and space optimal stable population protocol solving exact majority
|
NESTiD
|
|
20 Jan 2022 |
Peter Etchells
Durham University |
A Transcriptional Regulatory Network Controls Vascular Development in plants
|
NESTiD
|
|
03 Feb 2022 |
Thiru (Thirupathaiah) Vasantam
Durham University |
A throughput optimal scheduling policy for a quantum switch
|
NESTiD
|
|
10 Feb 2022 |
Nishanth Sastry
University of Surrey |
Untangling the Web by tracking our trackers
|
NESTiD
|
|
03 Mar 2022 |
Merav Parter
Weizmann Institute, Israel |
New Diameter Reducing Shortcuts: Breaking the $O(\sqrt{n})$ Barrier
|
NESTiD
|
|
08 Mar 2022 |
Louwe Kuijer
|
Logics of conditional belief, obligation and rationality
|
ARK
|
|
17 Mar 2022 |
Donald Towsley
University of Massachussets Amherst |
The Quantum Internet: Recent Advances and Challenges
|
NESTiD
|
|
31 Mar 2022 |
Chao Huang
|
Certified Reinforcement Learning
|
DMML
|
|
27 Apr 2022 |
Dr Diana Maynard
University of Sheffield |
Social media: freedom of speech or a cesspit of filth, lies, and abuse?
|
wit
|
|
28 Apr 2022 |
Roger Wattenhofer
ETH Zurich |
Cascade: Asynchronous Proof-of-Stake
|
NESTiD
|
|
05 May 2022 |
Dariusz Kowalski
Augusta University |
Anonymous Distributed Computing in Dynamic Networks
|
NESTiD
|
|
10 May 2022 |
Dr. Maximilien Gadouleau
Department of Computer Science, Durham University |
Linear Programming Complementation
|
dept
|
|
17 May 2022 |
Dr. Kitty Meeks
School of Computing Science, University of Glasgow |
Counting Temporal Paths
|
dept
|
|
18 May 2022 |
Lewis Hammond and James Fox
University of Oxford |
Reasoning about Causality in Games
|
EcCo
|
|
18 May 2022 |
Julian Dörfler
Saarland University |
Counting Induced Subgraphs: An Algebraic Approach to #W[1]-Hardness
|
ACTO
|
|
24 May 2022 |
Dr. Georgios Amanatidis
Department of Mathematical Sciences, University of Essex |
Allocating Indivisible Goods to Strategic Agents: Pure Nash Equilibria and Fairness
|
dept
|
|
25 May 2022 |
Ruiwen Dong
University of Oxford |
On the Identity Problem for unipotent matrix groups of nilpotency class at most ten.
|
ACTO
|
|
07 Jun 2022 |
Prof. Thomas Erlebach
Department of Computer Science, Durham University |
Explorable Uncertainty and Untrusted Predictions
|
dept
|
|
14 Jun 2022 |
Dr. Navjot Kukreja
Department of Computer Science, University of Liverpool |
Domain-Specific Languages for Scientific Computing
|
dept
|
|
30 Jun 2022 |
Qiyi Tang
|
-
|
verification
|
|
05 Jul 2022 |
Dr Ernesto Jimenez Ruiz
City University of London |
Knowledge Graphs for Data Science and Machine Learning
|
ARK
|
|
26 Jul 2022 |
Prof. Paul Fergus, Dr. Carl Chalmers
School of Computer Science and Mathematics, Liverpool John Moores University |
Turning the Tide on Biodiversity Loss Using Applied Artificial Intelligence
|
dept
|
|
09 Aug 2022 |
Dr. Piotr Hofman
Institute of Informatics, University of Warsaw |
Language Inclusion for Ambiguous Vector Addition Systems is Decidable
|
dept
|
