Tarjan’s algorithm is a modification of the Bridge Finding Algorithm except for directed graphs. We maintain a stack, with the following invariant: Let $S$ be a stack with vertices $v_1, \dots,...

Background Definitions The Euler’s totient function, represented as $\phi(n)$, gives us the number of positive integers up to $n$, that are relatively prime to $n$. For example, $\phi(9) = 6$ sinc...

Kademlia is a distributed hash table where the platform enables the distributed storage of key-value pairs with redundancy. Kademlia is composed of distributed processors connected together which ...