Room 327

Geometric Partitions and Replicable Computations

Vinodchandran Variyam

University of Nebraska – Lincoln, USA

In this talk, I will introduce a new geometric partition problem and explain its connection to replicable learning. I will also talk about new constructions of these partitions and lower bounds. I will conclude with a new “neighborhood” version of the classic Lebesgue covering theorem.

This is joint works with Jason Vander Woude, Peter Dixon, A. Pavan, and Jamie Radcliffe.