Simon Fraser University

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...

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...

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...

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...

Let G=(V,E) be an undirected graph on n vertices and λ:E →2^N a mapping that assigns to every edge a non-empty set of positive integer labels. These labels can be seen as discrete times when the edge is present. Such a labeled graph G'=(G,λ) is said...

This seminar is cancelled and will be scheduled for a later date. In recent years the explosion in the volumes of data being stored online has resulted in distributed storage systems transitioning to erasure coding based schemes. Local Reconstruction...

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...

Compressive sensing has generated tremendous amounts of interest since first being proposed by Emmanuel Candes, David Donoho, Terry Tao, and others a bit more than a decade ago. This mathematical framework has its origins in (i) the observation that...

A function $f:\F_2^n\to \F_2^n$ is called almost perfect nonlinear (APN) if $f(x) + f(y) + f(z) + f(x + y + z)= 0$ all $x,y,z$ such that $|\{x,y,z,x+y+z\}|=4$.. The motivation to study these functions comes from cryptography, since the defining...