


default search action
21st IEEE Symposium on Computer Arithmetic 2013: Austin, TX, USA
- Alberto Nannarelli, Peter-Michael Seidel, Ping Tak Peter Tang:

21st IEEE Symposium on Computer Arithmetic, ARITH 2013, Austin, TX, USA, April 7-10, 2013. IEEE Computer Society 2013, ISBN 978-1-4673-5644-2 - David H. Bailey:

High-precision computation: Applications and challenges [Keynote I]. 3 - Jeff Rupley, John King, Eric Quinnell, Frank Galloway, Ken Patton, Peter-Michael Seidel, James Dinh, Hai Bui, Anasua Bhowmik:

The Floating-Point Unit of the Jaguar x86 Core. 7-16 - Suresh Srinivasan, Ketan Bhudiya, Rajaraman Ramanarayanan, P. Sahit Babu, Tiju Jacob, Sanu Mathew, Ram Krishnamurthy, Vasantha Erraguntla:

Split-Path Fused Floating Point Multiply Accumulate (FPMAC). 17-24 - Sameh Galal, Ofer Shacham, John S. Brunhaver, Jing Pu, Artem Vassiliev, Mark Horowitz:

FPU Generator for Design Space Exploration. 25-34 - Jongwook Sohn, Earl E. Swartzlander Jr.:

Improved Architectures for a Floating-Point Fused Dot Product Unit. 41-48 - Ardavan Pedram, Andreas Gerstlauer, Robert A. van de Geijn

:
Floating Point Architecture Extensions for Optimized Matrix Factorization. 49-58 - Bilgiday Yuce, H. Fatih Ugurdag, Sezer Gören

, Günhan Dündar
:
A Fast Circuit Topology for Finding the Maximum of N k-bit Numbers. 59-66 - Susanne Engels, Elif Bilge Kavun

, Christof Paar, Tolga Yalçin
, Hristina Mihajloska:
A Non-Linear/Linear Instruction Set Extension for Lightweight Ciphers. 67-75 - M. G. Edmunds:

The Antikythera Mechanism and the early history of mechanical computing. 79 - Claude-Pierre Jeannerod, Nicolas Louvet, Jean-Michel Muller

:
On the Componentwise Accuracy of Complex Floating-Point Division with an FMA. 83-90 - Sylvie Boldo:

How to Compute the Area of a Triangle: A Formal Revisit. 91-98 - Vincent Lefèvre:

SIPE: Small Integer Plus Exponent. 99-106 - Sylvie Boldo, Jacques-Henri Jourdan, Xavier Leroy, Guillaume Melquiond

:
A Formally-Verified C Compiler Supporting Floating-Point Arithmetic. 107-115 - Jean-Claude Bajard

, Julien Eynard, Filippo Gandino
:
Fault Detection in RNS Montgomery Modular Multiplication. 119-126 - Petr Kurka

, Martin Delacourt:
The Unary Arithmetical Algorithm in Bimodular Number Systems. 127-134 - Pascal Giorgi, Laurent Imbert, Thomas Izard:

Parallel Modular Multiplication on Multi-core Processors. 135-142 - Nicolas Brisebarre, Marc Mezzarobba, Jean-Michel Muller

, Christoph Quirin Lauter:
Comparison between Binary64 and Decimal64 Floating-Point Numbers. 145-152 - Edin Kadric

, Paul Gurniak, André DeHon:
Accurate Parallel Floating-Point Accumulation. 153-162 - James Demmel, Hong Diep Nguyen:

Fast Reproducible Floating-Point Summation. 163-172 - Sylvain Chevillard, Marc Mezzarobba:

Multiple-Precision Evaluation of the Airy Ai Function with Reduced Cancellation. 175-182 - Hao Jiang, Stef Graillat, Roberto Barrio

:
Accurate and Fast Evaluation of Elementary Symmetric Functions. 183-190 - Michael B. Sullivan, Earl E. Swartzlander Jr.:

Truncated Logarithmic Approximation. 191-198 - Jérémie Detrey, Pierrick Gaudry, Marion Videau:

Relation Collection for the Function Field Sieve. 201-210 - Vassil S. Dimitrov, Kimmo Järvinen:

Another Look at Inversions over Binary Fields. 211-218 - Thomas Chabrier, Arnaud Tisserand:

On-the-Fly Multi-base Recoding for ECC Scalar Multiplication without Pre-computations. 219-228 - Marius Cornea:

Precision, Accuracy, and Rounding Error Propagation in Exascale Computing. 231-234 - James Demmel, Hong Diep Nguyen:

Numerical Reproducibility and Accuracy at ExaScale. 235-237

manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.


Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID














