Program

#I0		Monday	Tuesday	Wednesday

:45	Live Greetings and Welcoming Address (starts at 8:55)
9:00	Live Temporal Graphs: Algorithms and complexity Eleni Akrida Algorithms	Live Logic-based learning for Interpretable AI Alessandra Russo Logic Learning AI	Live The Complexity of Computing a Fixed Point of a Monotone Function, and Some Applications Kousha Etessami Games Algorithms Probability
:15
:30
:45
10:00	Live Short Break	Live Short Break	Live Short Break
:15	Live Tractability of Konig Edge Deletion Problems Diptapriyo Majumdar Graph Theory Parameterized Complexity Algorithms	Live Logic and Learning in Network Cascades Galen Wilkerson Natural Computation Machine Learning Algorithms	Live The Complexity of Gradient Descent: CLS = PPAD∩PLS Alexandros Hollender Search Problems Optimization Complexity
:30
:45	Live A Unifying Class of Algorithms for Semi Streaming Bipartite Maximum Matching Kheeran Naidu Graph Theory Streaming model Combinatorial Optimization	Live Trustable Machine Learning Systems Jay Morgan Natural Computation Machine Learning Algorithms	Live Impartial selection, additive guarantees, and prior information Nicos Protopapas Mechanism Design Algorithms Combinatorial Optimization
11:00
:15	Live Dynamic Matchings Peter Kiss Graph Theory Approximation Algorithms Combinatorial Optimization	Live Developments with manipulating Lyndon factorizations using evolutionary computation methods Lily Major Evolutionary Computation String Processing Algorithms	Live A non-trivial polynomial time algorithm for a 3D Stable Roommates problem Michael McKay Combinatorial Optimization Algorithms NP-hardness
:30
:45	Live Short Break	Live Short Break	Live Short Break
12:00	Live Ranking Bracelets in Polynomial time Duncan Adamson Combinatorics Counting Algorithms	Live The Complexity of Acyclic, Star and Injective Colouring for H-Free Graphs Siani A. Smith Graph Theory Complexity Algorithms	Live Fast recognition of some parametric graph families Nina Klobas Combinatorics Algorithms Structural Graph Theory
:15
:30	Live The Earth Movers Distance as a Metric for Inorganic Compositions Cameron Hargreaves Computational Chemistry Combinatorics Information Retrieval	Live Solving the distance k-clique problem in 1-outerplanar graphs Alejandro Flores-Lamas Graph Theory Dynamic Programming Algorithms	Live Spined Categories: generalising tree-width beyond graphs Benjamin Bumpus Graph Theory Tree-width Combinatorics
:45
13:00	Live Lunch Break	Live Lunch Break	Live Lunch Break
:15
:30
:45
14:00	Live Random triangles and random inscribed polytopes Herbert Edelsbrunner Algorithms	Live Proof Complexity Jan Krajíček Complexity Logic	Live Random Graph Generation using Hyperedge Replacement Grammars Federico Vastarini Combinatorics Algorithms Language Theory
:15
:30			Live Propositional Gossip Protocols Joe Livesey Distributed Computing Agent Communication Protocols
:45
15:00	Live Short Break	Live Short Break	Live Short Break
:15	Live Short Break	Live Short Break	Live Short Break
:30	Live Partition Games, Compositionally: Structure & Power of Linear Algebraic Games Adam Ó Conghaile Logics Game Theory Language Theory	Live Quantum proofs of proximity Marcel Dall'Agnol Property Testing Proof Systems Complexity	Live Fixed-Parameter Tractability of Pinwheel Scheduling Benjamin Smith Scheduling Parameterized Complexity Algorithms
:45
16:00	Live Resolving data flow dependencies of concurrent programs with a graded monad Finnbar Keating Functional Programming Semantics Language Theory	Live Monotone Circuit Lower Bounds from Robust Sunflowers Bruno Pasqualotto Cavalar Combinatorics Circuit Complexity Lower Bounds	Live Maximizing coverage while ensuring fairness: a tale of conflicting objectives Bhaskar DasGupta Combinatorial Optimization Search Problems Complexity
:15
:30	Live Controlling control: functional language design and implementation Andrei-Cristian Diaconu Functional Programming Semantics Language Theory	Live Relative Error Streaming Quantiles Pavel Vesely Data Analysis Algorithms Approximation	Live Forcing infinite memory for lim inf total payoff objectives in countable MDPs Eric Munday Decision Theory Algorithms Combinatorial Optimization
:45
17:00	Live Propagator Networks for Unification and Proof Search Arved Friedemann Proof Search Logical Programming Language Theory	Live BCTCS Ordinary General Meeting

Colours

Invited Talk

Regular Talk

Access

All presentations are on Zoom (meeting 950 2367 5619; password: (λ x y. y#x) bctcs 2021).

Social gatherings in between talks are on Gather (same passwd).