5 citations · 5 across the 3 of their papers we have counts for
3 papers
cs.DM2019
Biasing Boolean Functions and Collective Coin-Flipping Protocols over Arbitrary Product Distributions
Yuval Filmus, Lianna Hambardzumyan, Hamed Hatami +2
The seminal result of Kahn, Kalai and Linial shows that a coalition of players can bias the outcome of any Boolean function with respe…
cs.CG2014★ 5 cited
On Low Discrepancy Samplings in Product Spaces of Motion Groups
Chandrajit Bajaj, Abhishek Bhowmick, Eshan Chattopadhyay +1
Deterministically generating near-uniform point samplings of the motion groups like SO(3), SE(3) and their n-wise products SO(3)^n, SE(3)^n is fundamental to numerous applications…
cs.CC2010
Can Random Coin Flips Speed Up a Computer?
David Zuckerman
This expository essay introduces randomness and computation to a lay audience.