3898 search results - page 200 / 780 » On the Bit Extraction Problem |
117
click to vote
ICASSP
2009
IEEE
15 years 9 months ago
2009
IEEE
We design distributed and quantized average consensus algorithms on arbitrary connected networks. By construction, quantized algorithms cannot produce a real, analog average. Inst...
120
click to vote
CASC
2009
Springer
15 years 9 months ago
2009
Springer
This work addresses the problem of computing a certified ǫ-approximation of all real roots of a square-free integer polynomial. We proof an upper bound for its bit complexity, b...
127
click to vote
CRYPTO
2007
Springer
15 years 9 months ago
2007
Springer
Coppersmith described at Eurocrypt 96 an algorithm for finding small roots of bivariate integer polynomial equations, based on lattice reduction. A simpler algorithm was later pro...
109
click to vote
WADS
2001
Springer
15 years 7 months ago
2001
Springer
Abstract. We develop succinct data structures to represent (i) a sequence of values to support partial sum and select queries and update (changing values) and (ii) a dynamic array ...
121
click to vote
WDAG
2001
Springer
2001
Springer
A Space Optimal, Deterministic, Self-Stabilizing, Leader Election Algorithm for Unidirectional Rings
15 years 7 months ago
A new, self-stabilizing algorithm for electing a leader on a unidirectional ring of prime size is presented for the composite atomicity model with a centralized daemon. Its space c...