Self-healing using virtual structures (2012)
Journal Article
Trehan, A. (2012). Self-healing using virtual structures

The Forgiving Graph: a distributed data structure for low stretch under adversarial attack (2012)
Journal Article
Hayes, T. P., Saia, J., & Trehan, A. (2012). The Forgiving Graph: a distributed data structure for low stretch under adversarial attack. Distributed Computing, 1-18. https://doi.org/10.1007/s00446-012-0160-1

A general technique to establish the asymptotic conditional diagnosability of interconnection networks (2012)
Journal Article
Stewart, I. (2012). A general technique to establish the asymptotic conditional diagnosability of interconnection networks. Theoretical Computer Science, 452, 132-147. https://doi.org/10.1016/j.tcs.2012.05.015

On the computational complexity of routing in faulty k-ary n-cubes and hypercubes. (2012)
Journal Article
Stewart, I. (2012). On the computational complexity of routing in faulty k-ary n-cubes and hypercubes. Parallel Processing Letters, 22(1), Article 1250003. https://doi.org/10.1142/s012962641250003x

We equate a routing algorithm in a (faulty) interconnection network whose underlying graph is a k-ary n-cube or a hypercube, that attempts to route a packet from a fixed source node to a fixed destination node, with the sub-digraph of (healthy) links... Read More about On the computational complexity of routing in faulty k-ary n-cubes and hypercubes..