: We give a simple proof of the OSSS inequality (O'Donnell, Saks, Schramm, Servedio, FOCS 2005). The inequality states that for any decision tree T calculating a Boolean funct...
: We show that a noisy parallel decision tree making O(n) queries needs (log n) rounds to compute OR of n bits. This answers a question of Newman [IEEE Conference on Computational ...