A data structure is said to be persistent when any update operation returns a new structure without altering the old version. This paper introduces a new notion of persistence, cal...
The maintenance of large raster images under spatial operations is still a major performance bottleneck. For reasons of storage space, images in a collection, such as satellite pi...
To date, the only non-group structure that has been suitably employed as the key space for Diffie-Hellman type cryptographic key exchange is the infrastructure of a real quadratic ...
Michael J. Jacobson Jr., Renate Scheidler, Hugh C....
In the Finite Capacity Dial-a-Ride problem the input is a metric space, a set of objects {di}, each specifying a source si and a destination ti, and an integer k--the capacity of t...
In this contribution we introduce a low-complexity bit-parallel algorithm for computing square roots over binary extension fields. Our proposed method can be applied for any type ...