Tanaeem M. Moosa

According to our database, Tanaeem M. Moosa authored at least 8 papers between 2010 and 2013.

Collaborative distances:

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

2013

Inferring Strings from Cover Arrays.

Tanaeem M. Moosa, Sumaiya Nazeen, M. Sohel Rahman, Rezwana Reaz

Discret. Math. Algorithms Appl., 2013

2012

Sub-quadratic time and linear space data structures for permutation matching in binary strings.

Tanaeem M. Moosa, M. Sohel Rahman

J. Discrete Algorithms, 2012

Improved Algorithms for the Point-Set Embeddability Problem for Plane 3-Trees.

Tanaeem M. Moosa, M. Sohel Rahman

Discret. Math. Algorithms Appl., 2012

Linear Time Inference of Strings from Cover Arrays Using a Binary Alphabet - (Extended Abstract).

Tanaeem M. Moosa, Sumaiya Nazeen, M. Sohel Rahman, Rezwana Reaz

Proceedings of the WALCOM: Algorithms and Computation - 6th International Workshop, 2012

2011

Linear Time Inference of Strings from Cover Arrays using a Binary Alphabet

Tanaeem M. Moosa, Sumaiya Nazeen, M. Sohel Rahman, Rezwana Reaz

CoRR, 2011

2010

Cache Oblivious Algorithms for the RMQ and the RMSQ Problems.

Masud Hasan, Tanaeem M. Moosa, M. Sohel Rahman

Math. Comput. Sci., 2010

Indexing permutations for binary strings.

Tanaeem M. Moosa, M. Sohel Rahman

Inf. Process. Lett., 2010

Finite Automata Based Algorithms for the Generalized Constrained Longest Common Subsequence Problems.

Effat Farhana, Jannatul Ferdous, Tanaeem M. Moosa, M. Sohel Rahman

Proceedings of the String Processing and Information Retrieval, 2010