Author of the publication

Near-optimal algorithm to count occurrences of subsequences of a given length.

, , , and . Discret. Math. Algorithms Appl., 9 (3): 1750042:1-1750042:10 (2017)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

 

Other publications of authors with the same name

A Method for Software Architecture Design in the Aspect Oriented Development., , and . JIISIC, page 143-150. (2006)A greedy-metaheuristic 3-stage approach to construct covering arrays., , , and . Inf. Sci., (2018)Construction of logarithm tables for Galois Fields, , , and . International Journal of Mathematical Education in Science and Technology, 42 (1): 91-102 (2011)Supercomputing and Grid Computing on the verification of Covering Arrays, , , , and . The Journal of supercomputing, (to appear 2012)Cryptography and Security in Computing, , , and . chapter 4: Construction of Orthogonal Arrays of Index Unity Using Logarithm Tables for Galois Fields, page 71-90. INTECH, (2012)A New Backtracking Algorithm for Constructing Binary Covering Arrays of Variable Strength., , and . MICAI, volume 5845 of Lecture Notes in Computer Science, page 397-407. Springer, (2009)A Comparison of Memetic Recombination Operators for the MinLA Problem., , and . MICAI, volume 3789 of Lecture Notes in Computer Science, page 613-622. Springer, (2005)Optimization of Investment Options Using SQL., , , and . IBERAMIA, volume 6433 of Lecture Notes in Computer Science, page 30-39. Springer, (2010)An algorithm to compute integer ηth roots using subtractions., , and . Int. J. Comput. Math., 88 (8): 1629-1643 (2011)New optimal covering arrays using an orderly algorithm., and . Discret. Math. Algorithms Appl., 10 (1): 1850011:1-1850011:16 (2018)