In this paper published by Bernard Chazelle, one of the lemmas (Lemma 5.2) states that "the soft heap contains at most n / 2^(r-3) corrupted items at any given time." I am struggling to understand it. It would be helpful if anyone can explain how it is so.
Asked
Active
Viewed 35 times
1
