Past Events

Can you always find two elements x,y of a partially ordered set, such that, the probability that x is ordered before y when the poset is ordered randomly, is between

A streaming algorithm is called adversarially robust if it provides correct outputs even when the stream updates are chosen by an adaptive adversary based on past outputs given by the

Given sets A and B, let the sumset A+B={a+b : a in A, b in B}, and define A-B similarly. Given a set of real numbers, what can we say

Many existing methods for analyzing spatial data rely on the Gaussian assumption, which is violated in many applications such as wind speed, precipitation and COVID mortality data. In this talk,

Embedding graphs into Euclidean spaces with least distortion is a topic well-studied in mathematics and computer science. Despite this research, there are just a few graphs for which the precise

In recent years, attribute-based encryption (ABE) and functional encryption (FE) have established themselves as parts of the fundamental primitives in cryptography. The choice of model of computation to represent the

In this talk, we'll see many examples of why trees are a nice class of graphs to work with through the lens of matchings. We'll discuss some new extremal results

This talk concerns the role of statistical thinking in the Search for Truth using data. This will bring us to a discussion of P-values, a much-used tool in scientific research,

Machine learning has shown incredible promise in robotics, with some notable recent demonstrations in manipulation and sim2real transfer. These results, however, require either an accurate a priori model (for simulation)

This study addresses a fundamental, yet overlooked, gap between the standard theory and empirical practices in the OLS regression y = Xβ + u . To fill it, introducing a

Two well-studied problems in Ramsey theory are (1) given a graph G on n vertices, what is the smallest integer N such that there is a monochromatic copy of G

The parameter identifiability problem for a dynamical system is to determine whether the parameters of the system can be found from a given subset of variables of the system. Verifying

We study vertex sparsification for distances, in the setting of planar graphs with distortion: Given a planar graph G (with edge weights) and a subset of k terminal vertices, the

I wanted to give a talk called "facts one usually learns in the first day of a class on coding theory", but that didn't seem compelling. Fortunately, roughly half of

This paper derives confidence intervals (CI) and time-uniform confidence sequences (CS) for the classical problem of estimating an unknown mean from bounded observations. We present a general approach for deriving

Let G_{n,p} denote the random n-vertex graph obtained by including each edge independently and with probability p. Given a graph F, let ex(G_{n,p},F) denote the size of a largest F-free

We show that a decidable promise problem has a non-interactive statistical zero-knowledge proof system if and only if it is randomly reducible to a promise problem for Kolmogorov-random strings, with

Given a coloring of the triples of some finite set by q colors, how large of a subset can one find where all triples receive the same color? The answer

Randomized control trials (RCTs) have been the gold standard to evaluate the effectiveness of a program, policy, or treatment on an outcome of interest. However, many RCTs assume that study

The n-queens problem is to determine Q(n), the number of ways to place n mutually non-threatening queens on an n x n board. We show that there exists a constant