50 citations · 282 across the 39 of their papers we have counts for
Showing cs.CCShow all
2 papers · 1 filter
cs.CC2014★ 1 cited
Deterministic Randomness Extraction from Generalized and Distributed Santha-Vazirani Sources
Salman Beigi, Omid Etesami, Amin Gohari
A Santha-Vazirani (SV) source is a sequence of random bits where the conditional distribution of each bit, given the previous bits, can be partially controlled by an adversary. San…
cs.CC2014
The Value of Help Bits in Randomized and Average-Case Complexity
Salman Beigi, Omid Etesami, Amin Gohari
"Help bits" are some limited trusted information about an instance or instances of a computational problem that may reduce the computational complexity of solving that instance or…