We enhance the dependency pair method in order to prove termination using recursive structure analysis in simply-typed term rewriting systems, which is one of the computational mod...
In this paper, we describe a broad class of problems arising in the context of designing codes for DNA computing. We primarily focus on design considerations pertaining to the phen...
Abstract. Many parallel scienti c applications have dynamic and irregular computational structure. However, most such applications exhibit persistence of computational load and com...
Milind A. Bhandarkar, Robert Brunner, Laxmikant V....
Background: The task of computing highly accurate structural alignments of proteins in very short computation time is still challenging. This is partly due to the complexity of pr...
The quantum model of computation not only o ers entirely new ways to manipulate information, but also allows information processing tasks to be formulated in unconventional, genui...