Henry Sinclair-Banks' Presentations
FOCS 2024
The Tractability Border of Reachability in Simple Vector Addition Systems with States
Abstract
Presentation Slides (conference version)
Presentation Slides (pre-recorded version)
Henry Sinclair-Banks, 29/10/24, voco Chicago Downtown, Chicago (USA)
Oxford Verification Seminar
The Tractability Border of Reachability in Simple Vector Addition Systems with States
Henry Sinclair-Banks, 17/10/24, University of Oxford (UK)
Highlights 2024
The Tractability Border of Reachability in Simple Vector Addition Systems with States
Henry Sinclair-Banks, 19/09/24, LaBRI, Université de Bordeaux (France).
CONCUR 2024
Invariants for One-Counter Automata with Disequality Tests
Henry Sinclair-Banks, 12/09/24, Best Western Plus Village Park Inn, Calgary (Canada).
KIT Algorithms & Complexity Seminar
The Tractability Border of Reachability in Simple Vector Addition Systems with States
Henry Sinclair-Banks, 27/08/24, Karlsruhe Institute of Technology (Germany).
IRIF Verification Seminar
Coverability in VASS Revisited: Improving Rackoff's Bound to Obtain Conditional Optimality
Henry Sinclair-Banks, 08/01/24, IRIF, Paris Cité Université (France).
FSTTCS 2023
Acyclic Petri and Workflow Nets with Resets
Henry Sinclair-Banks, 18/12/23, IIIT Hyderbad (India).
Warwick Postgraduate Colloquium in Computer Science 2023 Winter
Simple Programs with NP-hard Termination
Best presentation award and most creative presentation award.
Henry Sinclair-Banks, 11/12/23, University of Warwick (UK).
LaBRI Formal Methods Seminar (M2F)
Coverability in VASS Revisited: Improving Rackoff's Bound to Obtain Conditional Optimality
Henry Sinclair-Banks, 07/11/23, LaBRI, Université de Bordeaux (France).
Highlights of Logic, Games and Automata 2023
Coverability in VASS Revisited: Improving Rackoff's Bound to Obtain Conditional Optimality
Abstract
Presentation Slides
Poster
Henry Sinclair-Banks, 26/07/23, Universität Kassel (Germany).
EATCS: ICALP 2023
Coverability in VASS Revisited: Improving Rackoff's Bound to Obtain Conditional Optimality
Abstract
Presentation Slides
ICALP'23 Track B Best Paper award.
Henry Sinclair-Banks, 12/07/23, Heinz Nixdorf MuseumsForum (Germany).
Warwick FoCS Theory Day
The Complexity of Coverability in Vector Addition Systems with States
Abstract
Presentation Slides
Henry Sinclair-Banks, 08/06/23, University of Warwick (UK).
ETAPS: FoSSaCS 2023
Coverability in 2-VASS with One Unary Counter is in NP
Abstract
Presentation Slides
Henry Sinclair-Banks, 25/04/23, Sorbonne Université (France).
Warwick Postgraduate Colloquium in Computer Science 2023
Using Counter Machines to Find Cliques and Cycles in Graphs
Abstract
Presentation Slides
Best presentation award.
Henry Sinclair-Banks, 24/03/23, University of Warwick (UK).
MPI-SWS OFCOURSE
The Complexity of Coverability in Fixed Dimension VASS with Various Encodings
Abstract
Presentation Slides
Henry Sinclair-Banks, 17/11/22, Max Planck Institute for Software Systems in Technische Universität Kaiserslautern (Germany).
Highlights of Logic, Games and Automata 2022
Coverability in 2-VASS with One Unary Counter
Abstract
Presentation Slides
Poster
Henry Sinclair-Banks, 30/06/22, Paris Cité Université (France).
MOVEP 2022
Coverability in 2-VASS with One Unary Counter
Abstract
Presentation Slides
Henry Sinclair-Banks, 15/06/22, Aalborg Universitet (Denmark).
Warwick FoCS Theory Day
Coverability in 2-VASS with One Unary Counter
Abstract
Presentation Slides
Henry Sinclair-Banks, 13/05/22, University of Warwick (UK).
Warwick Postgraduate Colloquium in Computer Science 2021
Walks of Given Length in One-Counter Systems
Abstract
Presentation Slides
Henry Sinclair-Banks, 13/12/21, University of Warwick (UK).
Warwick FoCS Theory Workshop
Unary One Counter Net Problems
Abstract
Presentation Slides
Henry Sinclair-Banks, 28/06/21, University of Warwick (UK).
Warwick FoCS PhD Reading Group
Early PhD problems
Abstract
Presentation Notes
Henry Sinclair-Banks, 12/11/20, University of Warwick (UK).
I recommend using the BeamerikZLink opens in a new window LaTeX class to make presentation slides.
For making it through my presentations, I reward you with my PhD music playlistLink opens in a new window, cheers!