default search action
Search dblp
Full-text search
- > Home
Please enter a search query
- case-insensitive prefix search: default
e.g., sig matches "SIGIR" as well as "signal" - exact word search: append dollar sign ($) to word
e.g., graph$ matches "graph", but not "graphics" - boolean and: separate words by space
e.g., codd model - boolean or: connect words by pipe symbol (|)
e.g., graph|network
Update May 7, 2017: Please note that we had to disable the phrase search operator (.) and the boolean not operator (-) due to technical problems. For the time being, phrase search queries will yield regular prefix search result, and search terms preceded by a minus will be interpreted as regular (positive) search terms.
Author search results
no matches
Venue search results
no matches
Refine list
refine by author
- no options
- temporarily not available
refine by venue
- no options
- temporarily not available
refine by type
- no options
- temporarily not available
refine by access
- no options
- temporarily not available
refine by year
- no options
- temporarily not available
Publication search results
found 28 matches
- 2013
- David H. Bailey:
High-precision computation: Applications and challenges [Keynote I]. IEEE Symposium on Computer Arithmetic 2013: 3 - Jean-Claude Bajard, Julien Eynard, Filippo Gandino:
Fault Detection in RNS Montgomery Modular Multiplication. IEEE Symposium on Computer Arithmetic 2013: 119-126 - Sylvie Boldo:
How to Compute the Area of a Triangle: A Formal Revisit. IEEE Symposium on Computer Arithmetic 2013: 91-98 - Sylvie Boldo, Jacques-Henri Jourdan, Xavier Leroy, Guillaume Melquiond:
A Formally-Verified C Compiler Supporting Floating-Point Arithmetic. IEEE Symposium on Computer Arithmetic 2013: 107-115 - Nicolas Brisebarre, Marc Mezzarobba, Jean-Michel Muller, Christoph Quirin Lauter:
Comparison between Binary64 and Decimal64 Floating-Point Numbers. IEEE Symposium on Computer Arithmetic 2013: 145-152 - Thomas Chabrier, Arnaud Tisserand:
On-the-Fly Multi-base Recoding for ECC Scalar Multiplication without Pre-computations. IEEE Symposium on Computer Arithmetic 2013: 219-228 - Sylvain Chevillard, Marc Mezzarobba:
Multiple-Precision Evaluation of the Airy Ai Function with Reduced Cancellation. IEEE Symposium on Computer Arithmetic 2013: 175-182 - Marius Cornea:
Precision, Accuracy, and Rounding Error Propagation in Exascale Computing. IEEE Symposium on Computer Arithmetic 2013: 231-234 - James Demmel, Hong Diep Nguyen:
Fast Reproducible Floating-Point Summation. IEEE Symposium on Computer Arithmetic 2013: 163-172 - James Demmel, Hong Diep Nguyen:
Numerical Reproducibility and Accuracy at ExaScale. IEEE Symposium on Computer Arithmetic 2013: 235-237 - Jérémie Detrey, Pierrick Gaudry, Marion Videau:
Relation Collection for the Function Field Sieve. IEEE Symposium on Computer Arithmetic 2013: 201-210 - Vassil S. Dimitrov, Kimmo Järvinen:
Another Look at Inversions over Binary Fields. IEEE Symposium on Computer Arithmetic 2013: 211-218 - M. G. Edmunds:
The Antikythera Mechanism and the early history of mechanical computing. IEEE Symposium on Computer Arithmetic 2013: 79 - Susanne Engels, Elif Bilge Kavun, Christof Paar, Tolga Yalçin, Hristina Mihajloska:
A Non-Linear/Linear Instruction Set Extension for Lightweight Ciphers. IEEE Symposium on Computer Arithmetic 2013: 67-75 - Sameh Galal, Ofer Shacham, John S. Brunhaver, Jing Pu, Artem Vassiliev, Mark Horowitz:
FPU Generator for Design Space Exploration. IEEE Symposium on Computer Arithmetic 2013: 25-34 - Pascal Giorgi, Laurent Imbert, Thomas Izard:
Parallel Modular Multiplication on Multi-core Processors. IEEE Symposium on Computer Arithmetic 2013: 135-142 - Claude-Pierre Jeannerod, Nicolas Louvet, Jean-Michel Muller:
On the Componentwise Accuracy of Complex Floating-Point Division with an FMA. IEEE Symposium on Computer Arithmetic 2013: 83-90 - Hao Jiang, Stef Graillat, Roberto Barrio:
Accurate and Fast Evaluation of Elementary Symmetric Functions. IEEE Symposium on Computer Arithmetic 2013: 183-190 - Edin Kadric, Paul Gurniak, André DeHon:
Accurate Parallel Floating-Point Accumulation. IEEE Symposium on Computer Arithmetic 2013: 153-162 - Petr Kurka, Martin Delacourt:
The Unary Arithmetical Algorithm in Bimodular Number Systems. IEEE Symposium on Computer Arithmetic 2013: 127-134 - Vincent Lefèvre:
SIPE: Small Integer Plus Exponent. IEEE Symposium on Computer Arithmetic 2013: 99-106 - Ardavan Pedram, Andreas Gerstlauer, Robert A. van de Geijn:
Floating Point Architecture Extensions for Optimized Matrix Factorization. IEEE Symposium on Computer Arithmetic 2013: 49-58 - 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. IEEE Symposium on Computer Arithmetic 2013: 7-16 - Jongwook Sohn, Earl E. Swartzlander Jr.:
Improved Architectures for a Floating-Point Fused Dot Product Unit. IEEE Symposium on Computer Arithmetic 2013: 41-48 - 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). IEEE Symposium on Computer Arithmetic 2013: 17-24 - Michael B. Sullivan, Earl E. Swartzlander Jr.:
Truncated Logarithmic Approximation. IEEE Symposium on Computer Arithmetic 2013: 191-198 - 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. IEEE Symposium on Computer Arithmetic 2013: 59-66 - 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 [contents]
loading more results
failed to load more results, please try again later
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.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from , , and to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
retrieved on 2024-11-19 00:53 CET from data curated by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint