papers

Publications (9)

cs.NE2023

Training Spiking Neural Networks Using Lessons From Deep Learning

Jason K. Eshraghian, Max Ward, Emre Neftci +6

The brain is the perfect place to look for inspiration to develop more efficient neural networks. The inner workings of our synapses and neurons provide a glimpse at what the futur…

cs.NE2023

Defending Active Directory by Combining Neural Network based Dynamic Program and Evolutionary Diversity Optimisation

Diksha Goel, Max Ward, Aneta Neumann +3

Active Directory (AD) is the default security management system for Windows domain networks. We study a Stackelberg game model between one attacker and one defender on an AD attack…

cs.DS2021

A Faster Algorithm for Maximum Independent Set on Interval Filament Graphs

Darcy Best, Max Ward

We provide an algorithm requiring only time to compute the maximum weight independent set of interval filament graphs. This also implies an algorithm to compute t…

q-bio.BM2025

Differentiable Folding for Nearest Neighbor Model Optimization

Ryan K. Krueger, Sharon Aviran, David H. Mathews +2

The Nearest Neighbor model is the thermodynamic model of RNA secondary structure formation and is a cornerstone of RNA structure prediction and sequence design.…

cs.CR2022

Scalable Edge Blocking Algorithms for Defending Active Directory Style Attack Graphs

Mingyu Guo, Max Ward, Aneta Neumann +2

Active Directory (AD) is the default security management system for Windows domain networks. An AD environment naturally describes an attack graph where nodes represent computers/a…

cs.DS2022

Efficient Network Analysis Under Single Link Deletion

Max Ward, Amitava Datta, Hung X. Nguyen +1

The problem of worst case edge deletion from a network is considered. Suppose that you have a communication network and you can delete a single edge. Which edge deletion causes the…

cs.DM2022

Finding -Hypernetworks in F-Hypergraphs is NP-Hard

Reynaldo Gil-Pons, Max Ward, Loïc Miller

We consider the problem of computing an -hypernetwork in an acyclic F-hypergraph. This is a fundamental computational problem arising in directed hypergraphs, and is a found…

cs.DS2025

A faster algorithm for efficient longest common substring calculation for non-parametric entropy estimation in sequential data

Bridget Smart, Max Ward, Matthew Roughan

Non-parametric entropy estimation on sequential data is a fundamental tool in signal processing, capturing information flow within or between processes to measure predictability, r…

q-bio.BM2025

mRNA Folding Algorithms for Structure and Codon Optimization

Max Ward, Mary Richardson, Mihir Metkar

mRNA technology has revolutionized vaccine development, protein replacement therapies, and cancer immunotherapies, offering rapid production and precise control over sequence and e…