861 search results - page 16 / 173 » Faster integer multiplication |
133
click to vote
ADC
2008
Springer
15 years 8 months ago
2008
Springer
This article describes how to implement efficient memory resident path indexes for semi-structured data. Two techniques are introduced, and they are shown to be significantly fas...
126
click to vote
ASIACRYPT
2010
Springer
15 years 16 days ago
2010
Springer
Abstract. We describe two improvements to Gentry's fully homomorphic scheme based on ideal lattices and its analysis: we provide a more aggressive analysis of one of the hardn...
144
click to vote
SACRYPT
2005
Springer
15 years 8 months ago
2005
Springer
We present two left-to-right integer recodings which can be used to perform scalar multiplication with a fixed sequence of operations. These recodings make it possible to have a s...
106
click to vote
WDAG
1995
Springer
15 years 6 months ago
1995
Springer
Abstract. A new algorithm is presented for detecting whether a particular computation of an asynchronous distributed system satisfies Poss Φ (read “possibly Φ”), meaning the...
133
click to vote
ECCC
2006
15 years 2 months ago
2006
We present two new methods for finding a lowest common ancestor (LCA) for each pair of vertices of a directed acyclic graph (dag) on n vertices and m edges. The first method is su...