Minimal, Deadlock Free and o(n) Space Memory Routing for k-ary n-cubes with Wraparound Connections. - M. B. Hadim; Ibrahima Sakho (PDPTA, 1995)

The Multi-Level Communication: Efficient Routing for Interconnection Networks. - M. B. Hadim; Ibrahima Sakho (J. Supercomput., 2001)

The Multi-level Communication: Minimal Deadlock-Free and Storage Efficient Routing for Torus Networks. - M. B. Hadim (PDP, 2014)