The integer factorisation and discrete logarithm problems are of practical importance because of the widespread use of public key cryptosystems whose security depends on the presum...
The nested data-parallel programming model supports the design and implementation of irregular parallel algorithms. This paper describes work in progress to incorporate nested data...
Brian Blount, Siddhartha Chatterjee, Michael Phili...
A data-accumulating algorithm (d-algorithm for short) works on an input considered as a virtually endless stream. The computation terminates when all the currently arrived data ha...
For hypercube networks which have faulty nodes, a few ecient dynamic routing algorithms have been proposed by allowing each node to hold the status of neighbors. We propose two im...
Chaining fragments is a crucial step in genome alignment. Existing chaining algorithms compute a maximum weighted chain with no overlaps allowed between adjacent fragments. In prac...