Thanasis Tsantilas

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

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

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

Satish Rao, Torsten Suel, Thanasis Tsantilas, Mark W. Goudreau: Efficient communication using total-exchange. IPPS 1995: 544-550

Sanguthevar Rajasekaran, Thanasis Tsantilas: Optimal Routing Algorithms for Mesh-Connected Processor Arrays. Algorithmica 8(1): 21-38 (1992)

Mihály Geréb-Graus, Thanasis Tsantilas: Efficient Optical Communication in Parallel Computers. SPAA 1992: 41-48

Christos Kaklamanis, Danny Krizanc, Thanasis Tsantilas: Tight Bounds for Oblivious Routing in the Hypercube. Mathematical Systems Theory 24(4): 223-232 (1991)

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

Christos Kaklamanis, Danny Krizanc, Thanasis Tsantilas: Tight Bounds for Oblivious Routing in the Hypercube. SPAA 1990: 31-36

Danny Krizanc, Sanguthevar Rajasekaran, Thanasis Tsantilas: Optimal Routing Algorithms for Mesh-Connected Processor Arrays. AWOC 1988: 411-422

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