13 search results - page 3 / 3 » Non-interactive Proofs for Integer Multiplication |
FDTC
2006
Springer
13 years 9 months ago
2006
Springer
We present a scheme for robust multi-precision arithmetic over the positive integers, protected by a novel family of non-linear arithmetic residue codes. These codes have a very hi...
ASIAN
2006
Springer
13 years 9 months ago
2006
Springer
Abstract. It is customary to write performance-critical parts of arithmetic functions in assembly: this enables finely-tuned algorithms that use specialized processor instructions....
SPAA
2006
ACM
13 years 11 months ago
2006
ACM
We initiate the study of semi-oblivious routing, a relaxation of oblivious routing which is first introduced by R¨acke and led to many subsequent improvements and applications. ...