Sciweavers

736 search results - page 37 / 148
» Algorithms for Ordinal Arithmetic
Sort
View
ICDCN
2010
Springer
14 years 2 months ago
Parallelization of the Lanczos Algorithm on Multi-core Platforms
In this paper, we report our parallel implementations of the Lanczos sparse linear system solving algorithm over large prime fields, on a multi-core platform. We employ several lo...
Souvik Bhattacherjee, Abhijit Das
ESOP
2008
Springer
13 years 9 months ago
Cover Algorithms and Their Combination
This paper defines the cover of a formula with respect to a set of variables V in theory T to be the strongest quantifier-free formula that is implied by V : in theory T. Cover e...
Sumit Gulwani, Madan Musuvathi
ASPDAC
2007
ACM
95views Hardware» more  ASPDAC 2007»
13 years 11 months ago
Optimization of Arithmetic Datapaths with Finite Word-Length Operands
Abstract: This paper presents an approach to area optimization of arithmetic datapaths that perform polynomial computations over bit-vectors with finite widths. Examples of such de...
Sivaram Gopalakrishnan, Priyank Kalla, Florian Ene...
FPGA
2008
ACM
151views FPGA» more  FPGA 2008»
13 years 9 months ago
Beyond the arithmetic constraint: depth-optimal mapping of logic chains in LUT-based FPGAs
Look-up table based FPGAs have migrated from a niche technology for design prototyping to a valuable end-product component and, in some cases, a replacement for general purpose pr...
Michael T. Frederick, Arun K. Somani
ASIACRYPT
1999
Springer
13 years 12 months ago
Fast Algorithms for Elliptic Curve Cryptosystems over Binary Finite Field
In the underlying finite field arithmetic of an elliptic curve cryptosystem, field multiplication is the next computational costly operation other than field inversion. We pres...
Yongfei Han, Peng-Chor Leong, Peng-Chong Tan, Jian...