736 search results - page 64 / 148 » Algorithms for Ordinal Arithmetic |
158
click to vote
ISLPED
2010
ACM
15 years 6 months ago
2010
ACM
Booth encoding is believed to yield faster multiplier designs with higher energy consumption. 16x16-bit Booth and NonBooth multipliers are analyzed in energy and delay space under...
137
click to vote
CORR
2007
Springer
15 years 6 months ago
2007
Springer
We present an algorithm to perform a simultaneous modular reduction of several residues. This enables to compress polynomials into integers and perform several modular operations ...
174
click to vote
PRDC
2007
IEEE
16 years 12 days ago
2007
IEEE
Consensus is one of the most fundamental problems in fault-tolerant distributed computing. This paper proposes a mechanical method for analyzing the condition that allows one to s...
144
click to vote
ASIACRYPT
2007
Springer
16 years 10 days ago
2007
Springer
Abstract. GPUs offer a tremendous amount of computational bandwidth that was until now largely unusable for cryptographic computations due to a lack of integer arithmetic and user...
146
click to vote
CAV
2006
Springer
15 years 10 months ago
2006
Springer
Fast is a tool designed for the analysis of counter systems, i.e. automata extended with unbounded integer variables. Despite the reachability set is not recursive in general, Fast...