Kaave Hosseini

Learn More
The study of seeded randomness extractors is a major line of research in theoretical computer science. The goal is to construct deterministic algorithms which can take a " weak " random source X with min-entropy k and a uniformly random seed Y of length d, and outputs a string of length close to k that is close to uniform and independent of Y. Dodis and(More)
The arithmetic regularity lemma due to Green [GAFA 2005] is an analogue of the famous Szemeredi regularity lemma in graph theory. It shows that for any abelian group G and any bounded function f : G → [0, 1], there exists a subgroup H ≤ G of bounded index such that, when restricted to most cosets of H, the function f is pseudorandom in the sense that all(More)
  • 1