Simon Fraser University

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

We will disucss some recent advances in the convergence of Anderson acceleration, an extrapolation technique that can be applied to general fixed-point iterations. The theory will be illustrated on some examples of systems arising from finite element...

In this talk I will introduce a new semi-algebraic proof system, called Stabbing Planes that is in the style of DPLL-based modern SAT solvers. Stabbing Planes proofs extend the DPLL branching from single variables to branching on arbitrary linear...

How does representation of a problem affect the complexity of solving it? What is the interplay between the richness of a domain in which a statement is expressed and the complexity of proving that statement? Not only this is a fundamental question...

Could an asteroid that explodes over the ocean generate a tsunami threatening coastal populations far away? We show simulations of tsunami propagation from asteroid-generated airbursts. We then present a 1D model with an explicit solution to better...

Multiplayer games model the behavior of competing agents, and we are interested in the structure that emerges when the number of agents is large. The Dyson and Coulomb games are N-agent dynamic games that admit well studied models of statistical...