Abstract: In this talk, we focus on a programmability challenge for parallel computing that can be captured by the following question: how easy or difficult is it to identify and repair bugs when developing a parallel program?
Abstract: Let f: F_2^n -> {+1, -1} be a Boolean function with the first Fourier norm A and Fourier sparsity s. We will prove that there is an affine subspace of the vector space F_2^n, of dimension O(A), on which the f is constant.
Abstract: Mathew Kahle and Elizabeth Meckes recently established interesting results concerning the topology of the clique complex $X(n,p)$ on an Erdos Renyi graph $G(n,p).$ Specifically, they showed that, if $p = n^{\alpha}$
Abstract: Alice and Bob want to compute jointly/collaboratively a function. They are both super-computers. However, part of the input is with Alice and the other part is with Bob.
