Events

Filter by:

Limit to events where the first date of the event:
Date range
Limit to events where the first date of the event:
Limit to events where the title matches:
Limit to events where the type is one or more of:
Limit to events tagged with one or more of:
Limit to events where the audience is one or more of:
Thursday, May 31, 2018 11:30 am - 11:30 am EDT (GMT -04:00)

Algebraic Combinatorics Seminar

Title: A single pass bijection between certain quarter plane lattice walks and certain Motzkin-like paths.

Speaker: Karen Yeats
Affiliation: University of Waterloo
Room: MC 6486

Abstract: A p-tandem quarter plane walk is a walk starting at the origin and remaining in the first quadrant

Friday, June 1, 2018 3:30 pm - 3:30 pm EDT (GMT -04:00)

Tutte Colloquium - Andreas Feldmann

Title: Parameterized Approximation Algorithms for Steiner Network Problems 

Speaker: Andreas Feldmann
Affiliation: Charles University, Prague, Czech Republic
Room: MC 5501

Abstract:

Two standard approaches to handle NP-hard optimization problems are to develop approximation and parameterized algorithms.

Friday, June 8, 2018 3:30 pm - 3:30 pm EDT (GMT -04:00)

Tutte Seminar - Ashwin Nayak

Title: Online Learning of Quantum States

Speaker: Ashwin Nayak
Affiliation: University of Waterloo
Room: MC 5501

Abstract:

Suppose we have many copies of an unknown n-qubit state rho. We measure some copies of rho using a known two-outcome measurement E_1, then other copies using a measurement E_2, and so on.

Friday, June 15, 2018 3:30 pm - 3:30 pm EDT (GMT -04:00)

Tutte Colloquium - Marthe Bonamy

Title: Distributed coloring in planar graphs

Speaker: Marthe Bonamy
Affiliation: University of Bordeaux
Room: MC 5501

Abstract:

We are concerned with efficiently coloring sparse graphs in the distributed setting with as few colors as possible. According to the celebrated Four Color Theorem, planar graphs can be colored with at most 4 colors, and the proof gives a (sequential) quadratic algorithm finding such a coloring.

Tuesday, June 19, 2018 3:00 pm - 3:00 pm EDT (GMT -04:00)

Special Seminar - Courtney Paquette

Title: Minimization of convex compositions

Speaker: Courtney Paquette
Affiliation: Lehigh University
Room: MC 6486

Abstract:

Numerous optimization tasks can be posed as minimization of a finite convex function composed with a smooth map. Phase retrieval and matrix factorization problems are common examples.

Thursday, June 21, 2018 3:30 pm - 3:30 pm EDT (GMT -04:00)

Graphs and Matroids Seminar

Title: The price of connectivity for domination

Speaker: Paul Ouvrard
Affiliation: University of Bordeaux
Room: MC 5479

Abstract: The price of connectivity for dominating set in a graph G is the ratio between the minimum sizes of a connected dominating set and a dominating set of G.