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 two-stage algorithm for combinatorial testing., , and . Optim. Lett., 11 (3): 457-469 (2017)A dual representation simulated annealing algorithm for the bandwidth minimization problem on graphs., , , , , and . Inf. Sci., (2015)New Covering Array Numbers., and . CoRR, (2017)A low spatial complexity algorithm to generate combinations with the strong minimal change property., and . Discret. Math. Algorithms Appl., 11 (5): 1950060:1-1950060:15 (2019)New optimal covering arrays using an orderly algorithm., and . Discret. Math. Algorithms Appl., 10 (1): 1850011:1-1850011:16 (2018)A greedy-metaheuristic 3-stage approach to construct covering arrays., , , and . Inf. Sci., (2018)A Branch & Bound Algorithm to Derive a Direct Construction for Binary Covering Arrays., , , and . MICAI (1), volume 9413 of Lecture Notes in Computer Science, page 158-177. Springer, (2015)New covering array numbers., and . Appl. Math. Comput., (2019)Construction of non-isomorphic covering arrays., and . Discret. Math. Algorithms Appl., 8 (2): 1650033:1-1650033:24 (2016)Methods to Construct Uniform Covering Arrays., , and . IEEE Access, (2019)