神马福利影片

• Status:
  • 05/10/20: Started PhD in Computer Science
  • 15/06/24: Submitted PhD thesis for examination
  • 23/08/24: Passed PhD viva with minor corrections
  • 04/09/24: Submitted corrected PhD thesis for approval
  • 05/09/24: Corrections accepted by the internal examiner
  • 09/09/24: Placed on the September 2024 pass list by the Doctoral College
  • 25/09/24: September 2024 pass list conferred by the Senate
  • 15/10/24: Notified by Student Records
• Supervisor: Dmitry Chistikov (75%), Second Supervisor: Marcin Jurdzi艅ski (25%)
• Examiners: Ranko Lazi膰 (internal) and (external)
• Advisors: Ranko Lazi膰 and Sayan Bhattacharya
• Theme: Theory and Foundations
• Groups:
  • Foundations of Computer Science (FoCS)
  • Centre for Discrete Mathematics and its Applications (DIMAP)
• Funding:
• Undergraduate: BSc Discrete Mathematics (神马福利影片, 2017-20)

Research

My research interests are currently related to Automata, Complexity, and Logic and widely speaking my interests stem from the foundations of computer science. In particular, I have focussed on determining the complexity of decision problems for infinite-state systems, including: coverability and reachability in extended or restricted variants of both vector addition systems and Petri nets as well as membership, equivalence, and inclusion of counter nets. Please see my presentations here (most notably, see my ICALP'23 best paper presentation and FOCS'24 (pre-recorded) presentation).

The Tractability Border of Reachability in Simple Vector Addition Systems with States
with Dmitry Chistikov, , , , and .

• .
• Presentations: FOCS'24, Oxford Verification Seminar, Highlights'24, KIT Algorithms & Complexity Seminar, and WPCCS'23 Winter.

Invariants for One-Counter Automata with Disequality Tests
with Dmitry Chistikov, , and .

• [], , Abstract.
• Presentations: CONCUR'24.

Dimension-Minimality and Primality of Counter Nets
with , , and .

• [], , Abstract.
  

Acyclic Petri and Workflow Nets with Resets
with Dmitry Chistikov, , , and .

• [], , Abstract.
  
• Presentations: FSTTCS'23.

Coverability in VASS Revisited: Improving Rackoff鈥檚 Bound to Obtain Conditional Optimality
with , , , and .

• , Full version (arXiv), Abstract, Poster.
• Presentations: IRIF Verification Seminar, LaBRI M2F Seminar, Highlights'23, ICALP'23, Warwick FoCS Theory Day, and WPCCS'23.

• (Warwick DCS News).

Coverability in 2-VASS with One Unary Counter is in NP
with and .

• , , Abstract, Poster.
• Presentations: FoSSaCS'23, MPI-SWS OFCOURSE Seminar, Highlights'22, MOVEP'22, and Warwick FoCS Theory Day.

Events

(P), (S), (S), (A) including (P), (A), (V) including (P), (S), (P), (S), (A), (S), (A), (P) including (A), (A) including (P) and (A), (S), (A), (A) including (A), (S), (S), (A), (A), (V), (A), (A) including (A), (A) and (A) including (A) and (A), (A).

Key: (A)ttendee, (P)aper, (S)peaker, (V)olunteer.

Teaching

Senior Graduate Teaching Assistant

• Associate Tutor for CS259 - Formal Languages
  • Term two 2023/24 (Jan - Mar), organised by Ramanujan Sridharan

• Associate Tutor for CS356 - Approximation and Randomised Algorithms
  • Term two 2022/23 (Jan - Mar), organised by Sayan Bhattacharya
  • Term two 2021/22 (Jan - Mar), organised by Sayan Bhattacharya
  • Term two 2020/21 (Jan - Mar), organised by Sayan Bhattacharya
• Associate Tutor for CS130 - Mathematics for Computer Scientists 1
  • Term one 2022/23 (Oct - Dec), organised by Dmitry Chistikov

• Associate Tutor for CS301 - Complexity of Algorithms
  • Term one 2023/24 (Oct - Dec), organised by Matthias Englert
  • Term one 2021/22 (Oct - Dec), organised by Matthias Englert
• Associate Tutor for CS260 - Algorithms
  • Term one 2021/22 (Oct - Dec), organised by Marcin Jurdzi艅ski
  • Term one 2020/21 (Oct - Dec), organised by Marcin Jurdzi艅ski

DCS UG SSLC 2020/21 Teaching Award

Henry Sinclair-Banks

Department of Computer Science,
神马福利影片,
Coventry, CV4 7AL.