An Optimal Randomized Routing Algorithm for the Mesh and A Class of Efficient Mesh-like Routing Networks. - Sanguthevar Rajasekaran; Thanasis Tsantilas (FSTTCS, 1987)

Optimal Routing Algorithms for Mesh-Connected Processor Arrays. - Danny Krizanc; Sanguthevar Rajasekaran; Thanasis Tsantilas (AWOC, 1988)

Randomized Sorting and Selection on Mesh-Connected Processor Arrays (Preliminary Version). - Christos Kaklamanis; Danny Krizanc; Lata Narayanan; Thanasis Tsantilas (SPAA, 1991)

Tight Bounds for Oblivious Routing in the Hypercube. - Christos Kaklamanis; Danny Krizanc; Thanasis Tsantilas (Math. Syst. Theory, 1991)

Efficient Optical Communication in Parallel Computers. - Mihály Geréb-Graus; Thanasis Tsantilas (SPAA, 1992)

Optimal Routing Algorithms for Mesh-Connected Processor Arrays. - Sanguthevar Rajasekaran; Thanasis Tsantilas (Algorithmica, 1992)

Efficient communication using total-exchange. - Satish Rao; Torsten Suel; Thanasis Tsantilas; Mark W. Goudreau (IPPS, 1995)

Towards Efficiency and Portability: Programming with the BSP Model. - Mark W. Goudreau; Kevin J. Lang; Satish Rao; Torsten Suel; Thanasis Tsantilas (SPAA, 1996)

BSPlib: The BSP programming library. - Jonathan M. D. Hill; Bill McColl; Dan C. Stefanescu; Mark W. Goudreau; Kevin J. Lang; Satish Rao; Torsten Suel; Thanasis Tsantilas; Rob H. Bisseling (Parallel Comput., 1998)

Portable and Efficient Parallel Computing Using the BSP Model. - Mark W. Goudreau; Kevin J. Lang; Satish Rao; Torsten Suel; Thanasis Tsantilas (IEEE Trans. Computers, 1999)