Остановите войну!
for scientists:
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
- 2023
- Nima D. Badizadegan:
Newton-Raphson Integer Division for Area-Constrained Microcontrollers. ARITH 2023: 9-15 - Eric Bavier, Nicholas Knight, Hugues de Lassus Saint-Genies, Eric Love:
Vectorized Nonlinear Functions with the RISC-V Vector Extension. ARITH 2023: 127-130 - Nicolas Brisebarre, Silviu-Ioan Filip:
Towards Machine-Efficient Rational L∞-Approximations of Mathematical Functions. ARITH 2023: 119-126 - Nicolas Brisebarre, Jean-Michel Muller, Joris Picot:
Error in ulps of the multiplication or division by a correctly-rounded function or constant in binary floating-point arithmetic. ARITH 2023: 88 - Nicolas Brisebarre, Jean-Michel Muller, Joris Picot:
Testing the Sharpness of Known Error Bounds on the Fast Fourier Transform. ARITH 2023: 89-92 - David Defour, Franck Védrine:
Chromatic Analysis of Numerical Programs. ARITH 2023: 97-100 - Orégane Desrentes, Benoît Dupont de Dinechin, Florent de Dinechin:
Exact Fused Dot Product Add Operators. ARITH 2023: 151-158 - Youssef Fakhreddine, Guillaume Revy:
Using loop transformations for precision tuning in iterative programs. ARITH 2023: 159-166 - Oliver Flatt, Pavel Panchekha:
Making Interval Arithmetic Robust to Overflow. ARITH 2023: 44-47 - Danila A. Gorodecky, Leonel Sousa:
Scalable architecture of constant division on FPGA. ARITH 2023: 16-23 - Stef Graillat, Youness Ibrahimy, Clothilde Jeangoudoux, Christoph Quirin Lauter:
A parallel compensated Horner scheme for SIMD architecture. ARITH 2023: 131-138 - Trenton J. Grale, Earl E. Swartzlander Jr.:
Improved Montgomery Multiplication. ARITH 2023: 60-67 - Tom Hubrecht, Claude-Pierre Jeannerod, Paul Zimmermann:
Towards a correctly-rounded and fast power function in binary64 arithmetic. ARITH 2023: 111-118 - Ghassem Jaberipur, Saeid Gorgin, Navid Ahamadian, Jeong-A Lee:
Modulo-(2q - 3) Multiplication with Fully Modular Partial Product Generation and Reduction. ARITH 2023: 68-75 - Ashish Kapoor, Warren E. Ferguson, Himanshu Jain, Sudipta Kundu:
Formal Verification of Floating-Point Division. ARITH 2023: 93-96 - Emmanouil Kavvousanos, Vasilis Sakellariou, Ioannis Kouretas, Vassilis Paliouras, Thanos Stouraitis:
Improving Residue-Level Sparsity in RNS-based Neural Network Hardware Accelerators via Regularization. ARITH 2023: 102-109 - Ariel E. Kellison, Andrew W. Appel, Mohit Tekriwal, David Bindel:
LAProof: A Library of Formal Proofs of Accuracy and Correctness for Linear Algebra Programs. ARITH 2023: 36-43 - Paul Geneau de Lamarlière, Guillaume Melquiond, Florian Faissole:
Slimmer Formal Proofs for Mathematical Libraries. ARITH 2023: 32-35 - Bogdan Pasca, Martin Langhammer:
Extracting low-precision floating-point adders from embedded hard FP DSP Blocks on FPGAs. ARITH 2023: 139-142 - Pengchang Ren, Reiji Suda, Vorapong Suppakitpaisarn:
Efficient Additions and Montgomery Reductions of Large Integers for SIMD. ARITH 2023: 48-59 - Malek Safieh, Andreas Furch, Fabrizio De Santis:
An Efficient Barrett Reduction Algorithm for Gaussian Integer Moduli. ARITH 2023: 76-83 - Vasilis Sakellariou, Vassilis Paliouras, Ioannis Kouretas, Hani H. Saleh, Thanos Stouraitis:
A multiplier-Free RNS-Based CNN accelerator exploiting bit-Level sparsity. ARITH 2023: 101 - Jihee Seo, Dae-Hyun Kim:
Dual-Purpose Hardware Algorithms and Architectures - Part 2: Integer Division. ARITH 2023: 1-8 - Jihee Seo, Dae-Hyun Kim:
Dual-Purpose Hardware Algorithms and Architectures - Part 1: Floating-Point Division. ARITH 2023: 24-31 - Jongwook Sohn, David K. Dean, Eric Quintana, Wing Shek Wong:
Enhanced Floating-Point Multiply-Add with Full Denormal Support. ARITH 2023: 143-150 - Styliani Tompazi, Georgios Karakonstantis:
AI-based Timing Error Modelling: A Case Study on a Pipelined Floating-point Core. ARITH 2023: 110 - Morgane Vollmer, Karim Bigou, Arnaud Tisserand:
Using Hierarchical Approach to Speed-up RNS Base Extensions in Homomorphic Encryption Context. ARITH 2023: 84-87 - 30th IEEE Symposium on Computer Arithmetic, ARITH 2023, Portland, OR, USA, September 4-6, 2023. IEEE 2023, ISBN 979-8-3503-1922-4 [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-05-17 18:38 CEST 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