We present an algorithm to compute r-th roots in Fqm with complexity O((log m + r log q)m2 log2 q) for certain choices of m and q. This compares well to previously known algorithms...
Real-world applications generally distinguish themselves from theoretical developments in that they are much more complex and varied. As a consequence, better models require more d...
We give a new construction of pseudorandom generators from any one-way function. The construction achieves better parameters and is simpler than that given in the seminal work of ...
This paper presentes a novel algorithm for the voxelization of surface models of arbitrary topology. Our algorithm uses the depth and stencil buffers, available in most commercial...
Georgios Passalis, Ioannis A. Kakadiaris, Theohari...
The ability to represent and query continuously moving objects is important in many applications of spatio-temporal database systems. In this paper we develop data structures for ...
Pankaj K. Agarwal, Lars Arge, Jeff Erickson, Hai Y...