Approximating Minimum Weight Perfect Matchings for Complete Graphs Satisfying the Triangle Inequality. - N. W. Holloway; Somasundaram Ravindran; Alan Gibbons (WG, 1993)

Dense Edge-Disjoint Embedding of Complete Binary Trees in the Hypercube. - Somasundaram Ravindran; Alan Gibbons (Inf. Process. Lett., 1993)

Aspects of practical implementations of PRAM algorithms. - Somasundaram Ravindran (1993)

A Fast String Matching Algorithm and Experimental Results. - Thomas Berry; Somasundaram Ravindran (Stringology, 1999)

Dense edge-disjoint embedding of complete binary trees in interconnection networks. - Somasundaram Ravindran; Alan Gibbons; Mike Paterson (Theor. Comput. Sci., 2000)

Searching in an Efficiently Stored DNA Text Using a Hardware Solution. - Thomas Berry; S. Keller; Somasundaram Ravindran (Stringology, 2001)

A linear time string matching algorithm on average with efficient text storage. - Thomas Berry; Somasundaram Ravindran (Stringology, 2001)

Tuning the Zhu-Takaoka string matching algorithm and experimental results. - Thomas Berry; Somasundaram Ravindran (Kybernetika, 2002)

Game Theory for Computer Games Design. - Mark Taylor 005; Mike Baskett; Denis Reilly 001; Somasundaram Ravindran (Games Cult., 2019)