default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMatei Istoan
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2021
[j3]Emeric Brun, David Defour
, Pablo de Oliveira Castro, Matei Istoan, Davide Mancusi, Eric Petit, Alan Vaquet:
A Study of the Effects and Benefits of Custom-Precision Mathematical Libraries for HPC Codes. IEEE Trans. Emerg. Top. Comput. 9(3): 1467-1478 (2021)- [c10]David Defour, Pablo de Oliveira Castro, Matei Istoan, Eric Petit:
Shadow computation with BFloat16 to estimate the numerical accuracy of summations. ARITH 2021: 33-36 - [c9]Emeric Brun, David Defour, Pablo de Oliveira Castro, Matei Istoan, Davide Mancusi, Eric Petit, Alan Vaquet:
A Study of the Effects and Benefits of Custom-Precision Mathematical Libraries for HPC Codes. ARITH 2021: 62 - 2020
- [c8]David Defour, Pablo de Oliveira Castro, Matei Istoan, Eric Petit:
Custom-Precision Mathematical Library Explorations for Code Profiling and Optimization. ARITH 2020: 121-124 - [i1]David Defour, Pablo de Oliveira Castro, Matei Istoan, Eric Petit:
Custom-Precision Mathematical Library Explorations for Code Profiling and Optimization. CoRR abs/2005.02732 (2020)
2010 – 2019
- 2019
- [j2]Anastasia Volkova, Matei Istoan, Florent de Dinechin, Thibault Hilaire:
Towards Hardware IIR Filters Computing Just Right: Direct Form I Case Study. IEEE Trans. Computers 68(4): 597-608 (2019) - 2018
- [c7]Nicolas Brisebarre, George A. Constantinides, Milos Ercezovac, Silviu-Ioan Filip, Matei Istoan, Jean-Michel Muller:
A High Throughput Polynomial and Rational Function Approximations Evaluator. ARITH 2018: 99-106 - 2017
- [b1]Matei Istoan:
High-performance coarse operators for FPGA-based computing. (Opérateurs grossiers haute performance pour l'informatique basée FPGA). University of Lyon, France, 2017 - [c6]Matei Istoan, Bogdan Pasca:
Flexible Fixed-Point Function Generation for FPGAs. ARITH 2017: 123-130 - [c5]Martin Kumm, Johannes Kappauf, Matei Istoan, Peter Zipf:
Resource Optimal Design of Large Multipliers for FPGAs. ARITH 2017: 131-138 - [c4]Matei Istoan, Florent de Dinechin:
Automating the pipeline of arithmetic datapaths. DATE 2017: 704-709 - 2015
- [c3]Florent de Dinechin, Matei Istoan:
Hardware Implementations of Fixed-Point Atan2. ARITH 2015: 34-41 - 2014
- [c2]Florent de Dinechin, Matei Istoan, Abdelbassat Massouri:
Sum-of-product architectures computing just right. ASAP 2014: 41-47 - 2013
- [j1]Florent de Dinechin, Matei Istoan, Guillaume Sergent:
Fixed-point trigonometric functions on FPGAs. SIGARCH Comput. Archit. News 41(5): 83-88 (2013) - [c1]Nicolas Brunie, Florent de Dinechin, Matei Istoan, Guillaume Sergent, Kinga Illyes, Bogdan Popa:
Arithmetic core generation using bit heaps. FPL 2013: 1-8
Coauthor Index
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.
last updated on 2024-04-24 22:53 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
