Presentations

All videos of my presentations are on my YouTube page (except the FOCS'24 prerecorded conference talk).

• How to make a more engaging talk - A public speaking workshop.
  MIMUW, University of Warsaw, Poland, 17/10/25.
  Slides, Exercises, Abstract.


• How I try to make my talks engaging.
  School of Computer Science and Informatics, University of Liverpool, UK, 18/09/25.
  Slides, Abstract.


• Which Semilinear Target Sets Make Reachability in 1-VASS Easy?
  Highlights'25, University of Saarland, Saarbrücken, Germany, 03/09/25.
  Slides, Abstract.


• How I try to make my talks engaging.
  Young Researchers Forum 2025, University of Warsaw Library, Poland, 24/08/25.
  Video (28 minutes), Slides, Abstract.


• A Complexity Dichotomy for Semilinear Target Sets in Automata with One Counter. LICS'25 paper presentation.
  LICS'25, National University of Singapore, Singapore, 25/06/25.
  Video (16 minutes), Slides, Abstract.


• How I try to make my talks engaging.
  13th Logic Mentoring Workshop, National University of Singapore, Singapore, 23/06/25.
  Video (24 minutes), Slides, Abstract.


• A Complexity Dichotomy for Semilinear Target Sets in Automata with One Counter.
  BASICS Group Seminar, Shanghai Jiao Tong University, China, 18/06/25.
  Slides, Abstract.


• Reaching Semilinear Target Sets in Automata with One Counter.
  MIMUW Automata Theory Seminar, University of Warsaw, Poland, 16/04/25.
  Video (87 minutes), Notes, Abstract.


• A Complexity Dichotomy for Semilinear Target Sets in Automata with One Counter.
  Automata in the Wild 2025, University of Warwick, UK, 01/04/25.
  Slides, Abstract.


• The Tractability Border of Reachability in Simple Vector Addition Systems with States.
  Liverpool Verification Seminar, University of Liverpool, UK, 13/02/25.
  Video (40 minutes), Slides, Abstract.


• How to get a PhD in 1451 days
  University of Warwick, UK, 23/01/25.
  Abstract.


• The Tractability Border of Reachability in Simple Vector Addition Systems with States.
  ISTA Group Seminar, ISTA, Austria, 03/12/24.
  Slides, Abstract.


• The Tractability Border of Reachability in Simple Vector Addition Systems with States. FOCS'24 paper presentation.
  FOCS'24, voco Chicago Downtown, Chicago, USA, 29/10/24.
  Video (20 minutes), Slides, Abstract.
  


• The Tractability Border of Reachability in Simple Vector Addition Systems with States.
  Oxford Verification Seminar, University of Oxford, UK, 17/10/24.
  Slides, Abstract.


• The Tractability Border of Reachability in Simple Vector Addition Systems with States.
  Highlights'24, LaBRI, Université de Bordeaux, France, 19/09/24.
  Video (9 minutes), Slides, Abstract.


• Invariants for One-Counter Automata with Disequality Tests. CONCUR'24 paper presentation.
  CONCUR'24, Best Western Plus Village Park Inn, Calgary, Canada, 12/09/24.
  Slides, Abstract.


• The Tractability Border of Reachability in Simple Vector Addition Systems with States.
  KIT Algorithms & Complexity Seminar, Karlsruhe Institute of Technology, Germany, 27/08/24.
  Slides, Abstract.


• Coverability in VASS Revisited: Improving Rackoff's Bound to Obtain Conditional Optimality.
  IRIF Verification Seminar, Paris Cité Université, France, 08/01/24.
  Video (50 minutes), Slides, Abstract.


• Acyclic Petri and Workflow Nets with Resets. FSTTCS'23 paper presentation. Video (21 minutes).
  FSTTCS'23, IIIT Hyderabad, India, 18/12/23.


• Simple Programs with NP-hard Termination. Best presentation and most creative presentation awards.
  Warwick Postgraduate Colloquium in Computer Science 2023 Winter, University of Warwick, UK, 11/12/23.


• Coverability in VASS Revisited: Improving Rackoff's Bound to Obtain Conditional Optimality. Video (52 minutes).
  LaBRI Formal Methods Seminar, Université de Bordeaux, France, 07/11/23.


• Coverability in VASS Revisited: Improving Rackoff's Bound to Obtain Conditional Optimality. Video (10 minutes).
  Highlights'23, Universität Kassel, Germany, 26/07/23.


• Coverability in VASS Revisited: Improving Rackoff's Bound to Obtain Conditional Optimality. ICALP'23 paper presentation. Video (21 minutes).
  ICALP'23, Heinz Nixdorf MuseumsForum, Germany, 12/07/23.


• The Complexity of Coverability in Vector Addition Systems with States.
  Warwick FoCS Theory Day 2023, University of Warwick, UK, 08/06/23.


• Coverability in 2-VASS with One Unary Counter is in NP. FoSSaCS'23 paper presentation. Video (25 minutes).
  FoSSaCS'23, Sorbonne Université, France, 25/04/23.


• Using Counter Machines to Find Cliques and Cycles in Graphs. Best presentation award. Video (11 minutes).
  Warwick Postgraduate Colloquium in Computer Science 2023, University of Warwick, UK, 24/03/23.


• Automata Problems in the Complexity Zoo.
  KCLMS Alumni Academic Conference, King's College London Mathematics School, UK, 19/12/22


• The Complexity of Coverability in Fixed Dimension VASS with Various Encodings. Video (42 minutes).
  OFCOURSE Student Talk Series, Max Planck Institute for Software Systems, Technische Universität Kaiserslautern, Germany, 17/11/22.


• Coverability in 2-VASS with One Unary Counter. Video (7 minutes).
  Highlights'22, Paris Cité Université, France, 30/06/22.


• Coverability in 2-VASS with One Unary Counter.
  MOVEP 2022, Aalborg Universitet, Denmark, 16/06/22.


• Coverability in 2-VASS with One Unary Counter.
  Warwick FoCS Theory Day 2022, University of Warwick, UK, 13/05/22.


• Walks of Given Length in One-Counter Systems.
  Warwick Postgraduate Colloquium in Computer Science 2021, University of Warwick, UK, 13/12/21.


• Unary One Counter Net Problems. Video (9 minutes).
  Warwick FoCS Theory Workshop 2021, University of Warwick, UK, 28/06/21.


• Early PhD Problems. Video (53 minutes).
  Warwick FoCS PhD Reading Group, University of Warwick, UK, 12/11/20.