Let S be a set of n points in IRd and let t > 1 be a real number. A t-spanner for S is a graph having the points of S as its vertices such that for any pair p, q of points ther...
We present new algorithms for labeling a set P of n points in the plane with labels that are aligned to the left of the bounding box of P. The points are connected to their labels ...
Marc Benkert, Herman J. Haverkort, Moritz Kroll, M...
We examine the number T of queries that a quantum network requires to compute several Boolean functions on f0;1gN in the black-box model. We show that, in the blackbox model, the ...
Robert Beals, Harry Buhrman, Richard Cleve, Michel...
Let P be a set of polygonal pseudodiscs in the plane with n edges in total translating with xed velocities in xed directions. We prove that the maximumnumber of combinatorial chan...
We show that every construction of one-time signature schemes from a random oracle achieves black-box security at most 2(1+o(1))q , where q is the total number of oracle queries a...