Somasundaram Ravindran

According to our database, Somasundaram Ravindran authored at least 9 papers between 1993 and 2019.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2019

Game Theory for Computer Games Design.

Mark Taylor, Mike Baskett, Denis Reilly, Somasundaram Ravindran

Games Cult., 2019

2002

Tuning the Zhu-Takaoka string matching algorithm and experimental results.

Thomas Berry, Somasundaram Ravindran

Kybernetika, 2002

2001

A linear time string matching algorithm on average with efficient text storage.

Thomas Berry, Somasundaram Ravindran

Proceedings of the Prague Stringology Conference 2001, Prague, Czech Republic, 2001

Searching in an Efficiently Stored DNA Text Using a Hardware Solution.

Thomas Berry, S. Keller, Somasundaram Ravindran

Proceedings of the Prague Stringology Conference 2001, Prague, Czech Republic, 2001

2000

Dense edge-disjoint embedding of complete binary trees in interconnection networks.

Somasundaram Ravindran, Alan Gibbons, Mike Paterson

Theor. Comput. Sci., 2000

1999

A Fast String Matching Algorithm and Experimental Results.

Thomas Berry, Somasundaram Ravindran

Proceedings of the Prague Stringology Club Workshop 1999, 1999

1993

Aspects of practical implementations of PRAM algorithms.

Somasundaram Ravindran

PhD thesis, 1993

Dense Edge-Disjoint Embedding of Complete Binary Trees in the Hypercube.

Somasundaram Ravindran, Alan Gibbons

Inf. Process. Lett., 1993

Approximating Minimum Weight Perfect Matchings for Complete Graphs Satisfying the Triangle Inequality.

N. W. Holloway, Somasundaram Ravindran, Alan Gibbons

Proceedings of the Graph-Theoretic Concepts in Computer Science, 1993