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

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

We consider the problem of answering queries about formulas of first-order logic based on background knowledge partially represented explicitly as other formulas, and partially represented as examples independently drawn from a fixed probability...

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

Neural networks are remarkable families of non-linear functions that form the backbone for state-of-the-art algorithms in tasks from computer vision (self-driving cars), natural language processing (Google Translate) and reinforcement learning...

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

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

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

We consider an aggregation model that consists of an active transport equation for the macroscopic population density, where the velocity has a nonlocal functional dependence on the density, modelled via an interaction potential. We set up the model...