Events and Activities

The well-known Zig-Zag product and related graph operators, like derandomized squaring, are fundamentally combinatorial in nature. Classical bounds on their behavior often rely on a mix of combinatorics and linear algebra. However, these traditional...

I will discuss some well-known and less-known papers of Turing, exemplify the scope of deep, prescient ideas he put forth, and mention follow-up work on these by the Theoretical CS community.

No special background will be assumed.

Eisenstein proved, in 1852, that if a function f(z) is algebraic, then its Taylor expansion at a point has coefficients lying in some finitely-generated Z-algebra. I will explain ongoing joint work with Josh Lam which studies the extent to which the...

The well-known Zig-Zag product and related graph operators, like derandomized squaring, are fundamentally combinatorial in nature. Classical bounds on their behavior often rely on a mix of combinatorics and linear algebra. However, these traditional...

The detailed 3D distributions of dust density and extinction in the Milky Way have long been sought after. However, such 3D reconstruction from sparse data is non-trivial, but is essential to understanding the properties of star-formation, large...