231 search results - page 16 / 47 » Algorithms for Quantum Computation: Discrete Logarithms and ... |
159
Voted
ICICS
2004
Springer
15 years 11 months ago
2004
Springer
Fail-stop signature (FSS) schemes are important primitives because in a fail-stop signature scheme the signer is protected against unlimited powerful adversaries as follows: Even i...
142
click to vote
PODC
2004
ACM
15 years 11 months ago
2004
ACM
We consider the problem of designing a compact communication network that supports efficient routing in an Euclidean plane. Our network design and routing scheme achieves 1+ stret...
171
click to vote
SI3D
2006
ACM
16 years 4 days ago
2006
ACM
We present an interactive algorithm to compute discretized 3D Euclidean distance fields. Given a set of piecewise linear geometric primitives, our algorithm computes the distance...
195
click to vote
COCO
2009
Springer
16 years 23 days ago
2009
Springer
A major open question in communication complexity is if randomized and quantum communication are polynomially related for all total functions. So far, no gap larger than a power o...
197
click to vote
CCGRID
2011
IEEE
14 years 9 months ago
2011
IEEE
– Efficient implementations of the Discrete Fourier Transform (DFT) for GPUs provide good performance with large data sizes, but are not competitive with CPU code for small data ...