[1] Zaid Hussain. An improved one-to-all broadcasting in higher dimensional eisenstein-jacobi networks. In 26th Euromicro International Conference on Parallel, Distributed and Network-based Processing, PDP 2018, Cambridge, United Kingdom, March 21-23, 2018, pages 34–44. IEEE Computer Society, 2018.

[2] Zaid Hussain and Arash Shamaei. Higher dimensional eisenstein-jacobi net- works. J. Parallel Distributed Comput., 102:91–102, 2017.

[3] Zaid Hussain, Bader F. AlBdaiwi, and Anton Cerny ́. Node-independent spanning trees in gaussian networks. J. Parallel Distributed Comput., 109:324–332, 2017.

[4] Zaid Hussain, Bader F. AlBdaiwi, and Anton Cerny ́. Node-independent spanning trees in gaussian networks. CoRR, abs/1701.02991, 2017.

[5] Bader F. AlBdaiwi, Zaid Hussain, Anton Cerny ́, and Robert Aldred. Edge- disjoint node-independent spanning trees in dense gaussian networks. The Journal of Supercomputing, 72(12):4718–4736, 2016.

[6] Bader F. AlBdaiwi, Zaid Hussain, Anton Cerny ́, and Robert Aldred. Edge- disjoint node-independent spanning trees in dense gaussian networks. CoRR, abs/1601.06915, 2016.

[7] Zaid Hussain. An improved one-to-all broadcasting in higher dimensional eisenstein-jacobi networks. CoRR, abs/1612.01842, 2016.

[8] Zaid Hussain. Better traffic distribution one-to-all broadcast in higher di- mensional gaussian networks. The Journal of Supercomputing, 71(12):4381– 4399, 2015.