Given a set of n points S in the plane, a triangulation of S is a subdivision of the convex hull into triangles whose vertices are from S. In the kinetic setting, the input point ...
Abstract. In this paper we report on the recent progress in computing bivariate polynomial resultants on Graphics Processing Units (GPU). Given two polynomials in Z[x, y], our algo...
Shor has showed how to perform fault tolerant quantum computation when the probability for an error in a qubit or a gate, η, decays with the size of the computation polylogarithmi...
We describe a method for animating incompressible liquids with detailed free surfaces. For each time step, semiLagrangian contouring computes a new fluid boundary (represented as ...
Nuttapong Chentanez, Bryan E. Feldman, Franç...
Strongly multiplicative linear secret sharing schemes (LSSS) have been a powerful tool for constructing secure multi-party computation protocols. However, it remains open whether o...
Zhifang Zhang, Mulan Liu, Yeow Meng Chee, San Ling...