2 citations · 2 across the 8 of their papers we have counts for
4 papers · 1 filter
Locally Sampleable Uniform Symmetric Distributions
Daniel M. Kane, Anthony Ostuni, Kewen Wu
We characterize the power of constant-depth Boolean circuits in generating uniform symmetric distributions. Let be a Boolean function where each outp…
Corners in Quasirandom Groups via Sparse Mixing
Michael Jaber, Shachar Lovett, Anthony Ostuni
We improve the best known upper bounds on the density of corner-free sets over quasirandom groups from inverse poly-logarithmic to quasi-polynomial. We make similarly substantial i…
Strong Bounds for Skew-Corner-Free Sets
Michael Jaber, Shachar Lovett, Anthony Ostuni
Motivated by applications to matrix multiplication algorithms, Pratt asked (ITCS'24) how large a subset of could be without containing a skew-corner: three points…
Locality Bounds for Sampling Hamming Slices
Daniel M. Kane, Anthony Ostuni, Kewen Wu
Spurred by the influential work of Viola (Journal of Computing 2012), the past decade has witnessed an active line of research into the complexity of (approximately) sampling distr…