Info
- Utilizzare la checkbox di selezione a fianco di ciascun documento per attivare le funzionalità di stampa, invio email, download nei formati disponibili del (i) record.
15th Symposium on Computer Arithmatic, 2001, Vail, CO
| 15th Symposium on Computer Arithmatic, 2001, Vail, CO |
| Autore | Burgess Neil |
| Pubbl/distr/stampa | [Place of publication not identified], : IEEE Computer Society Press, 2001 |
| Formato | Materiale a stampa  |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Record Nr. | UNISA-996201431203316 |
Burgess Neil
|
||
| [Place of publication not identified], : IEEE Computer Society Press, 2001 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
15th Symposium on Computer Arithmatic, 2001, Vail, CO
| 15th Symposium on Computer Arithmatic, 2001, Vail, CO |
| Autore | Burgess Neil |
| Pubbl/distr/stampa | [Place of publication not identified], : IEEE Computer Society Press, 2001 |
| Descrizione fisica | 1 online resource (285 pages) |
| Disciplina | 004.0151 |
| Soggetto topico | Computer arithmetic |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Proceedings 15th IEEE Symposium on Computer Arithmetic. ARITH-15 2001 -- Leading zero anticipation and detection-a comparison of methods -- Bounds on runs of zeros and ones for algebraic functions -- Binary multiplication radix-32 and radix-256 -- Analysis of column compression multipliers -- Faithful powering computation using table look-up and a fused accumulation tree -- Bit-parallel systolic modular multipliers for a class of GF(2/sup m/) -- Modular multiplication and base extensions in residue number systems -- Efficient computation of multiplicative inverses for cryptographic applications -- Optimised squaring of long integers using precomputed partial products. |
| Record Nr. | UNINA-9910872644703321 |
|
Burgess Neil
|
||
| [Place of publication not identified], : IEEE Computer Society Press, 2001 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||