Abstract: Reachability and strong-connectivity are some of the fundamental graph problems. In the static setting, both problems can be solved in O(m+n) time for any directed graph G with n vertices and m edges.

Abstract: About three decades ago, the era of global email connectivity began in India. Funding was a lot more scarce then, and scepticism about the utility of such connectivity was in plenty.

Abstract: Data has been growing at an unprecedented rate in the last few years.

Abstract: Randomness is a vital tool and resource in both classical and quantum information processing. However, constructing random bits is expensive, and hence minimising their use is desirable.