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)
Let f : {0, 1} n → {0, 1} be a boolean function. Its associated XOR function is the two-party function f ⊕ (x, y) = f (x ⊕ y). We show that, up to polynomial factors, the deterministic communication complexity of f ⊕ is equal to the parity decision tree complexity of f. This relies on a novel technique of entropy reduction for protocols, combined with(More)
  • 1