In the file maintenance problem, n integer items from the set {1,....,r} are to be stored in an array of size m>=n.

The general problem of proving limitations on what efficient algorithms can accomplish has been the subject of much research over the past four decades. In this talk, we consider the specific question of bounding the power of Boolean circuits.

We show lower bounds of $\Omega(\sqrt{n})$ on the randomized communication complexity, respectively, of all $n$-variable read-once Boolean formulas.

We show that it is possible to encode any communication protocol between two parties so that the protocol succeeds even if a (1/4 − epsilon) fraction of all symbols transmitted by the parties are corrupted adversarially, at a cost of increasing th

Nearly 3.5 billion years back microtubule came into being, while unravelling its electronics we found its synchrony induced behavior (1), which enables it to exhibit remarkable electronic properties never seen before.