Simon Fraser University

Adaptive time stepping methods for meta-stable dynamics of the Allen Cahn and Cahn Hilliard equations are investigated in the spatially continuous, semi-discrete setting. Predicted behaviour of the number of time steps with specified local error...

We are faced with a flood of molecular and clinical data. We are measuring interactions between various bio-molecules in a cell that form large, complex systems. Patient omics datasets are also increasingly becoming available. These systems-level...

In this first talk out of two, I will review various well-known algorithms for integer multiplication, such as schoolbook multiplication, Karatsuba multiplication, FFT multiplication, and the Schoenhage-Strassen algorithm. The talk will also be an...

Integer programming is one of the most fundamental problems in discrete optimization. While integer programming is computationally hard in general, there exist efficient algorithms for special instances. In particular, integer programming is fixed...

What is a game? Mathematically speaking, a game has players, strategies and scores to explain why the players win or lose. Games which are modelled with differential equations are called differential games. Common examples are pursuit-evasion games...

Computational modelling can be used to reveal insights into the mechanisms of new drugs and to develop new diagnostic tools. Here I will discuss three major diseases: diabetes, hypertension, and autism. I will talk about how we construct models to...

This is the second of a two-part talk. In talk one, I will review various well-known algorithms for integer multiplication, such as schoolbook multiplication, Karatsuba multiplication, FFT multiplication, and the Schoenhage-Strassen algorithm. The...

This talk will focus on two topics in the foundations of neural networks: computability and false structures. In the first part I will recall briefly the concept of recursive functions and then discuss the gap between existence results, the...

A challenge in descriptive complexity is to identify logics with low complexity that simultaneously express both fundamental reachability properties and counting properties on unordered structures. In this talk, we introduce a family of logics that...