Simon Fraser University

On May 27, 2019, the Electronic Journal of Combinatorics, a diamond-access journal founded by the late Herb Wilf and Neil Calkin, will celebrate its 25th birthday by organizing a satellite conference in conjunction with CanaDAM 2019. There will be...

Solvers for the Boolean satisfiability problem have been increasingly used to solve hard problems from many fields and now routinely solve problems with millions of variables. Combinatorial problems are a natural target, as SAT solvers contain...

We explore graphs of high cop number. We give new lower bounds for cop number of graphs of high girth. We also present a new class of undirected graphs with cop number $(1-o(1)) \sqrt{n/2}$ and a class of directed graphs with cop number $(1-o(1))...

A theme that cuts across many domains of computer science and mathematics is to find simple representations of complex mathematical objects such as graphs, functions, or distributions on data. These representations need to capture how the object...

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

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

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

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