![](https://dblp1.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp1.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp1.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp1.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp1.uni-trier.de/img/search.dark.16x16.png)
default search action
David Raymond Lutz
Person information
- affiliation: ARM Austin Design Center, TX, USA
Refine list
![note](https://dblp1.uni-trier.de/img/note-mark.dark.12x12.png)
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [c13]David Raymond Lutz, Anisha Saini, Mairin Kroes, Thomas Elmer, Harsha Valsaraju:
Fused FP8 4-Way Dot Product With Scaling and FP32 Accumulation. ARITH 2024: 40-47
2010 – 2019
- 2019
- [j2]Neil Burgess
, Christopher E. Goodyer
, Christopher Neal Hinds
, David Raymond Lutz
:
High-Precision Anchored Accumulators for Reproducible Floating-Point Summation. IEEE Trans. Computers 68(7): 967-978 (2019) - [c12]David Raymond Lutz
:
ARM Floating Point 2019: Latency, Area, Power. ARITH 2019: 97-98 - 2017
- [c11]David Raymond Lutz
:
Optimized leading zero anticipators for faster fused multiply-adds. ACSSC 2017: 741-744 - [c10]David Raymond Lutz, Christopher Neal Hinds:
High-Precision Anchored Accumulators for Reproducible Floating-Point Summation. ARITH 2017: 98-105 - 2013
- [c9]Neil Burgess, David Raymond Lutz:
Exhaustive testing of Fused Multiply-Add RTL. ACSSC 2013: 405-406 - 2012
- [c8]Neil Burgess, David Raymond Lutz:
Experiments with synthesizing multiplier reduction trees. ACSCC 2012: 360-364 - 2011
- [c7]David Raymond Lutz
:
Fused Multiply-Add Microarchitecture Comprising Separate Early-Normalizing Multiply and Add Pipelines. IEEE Symposium on Computer Arithmetic 2011: 123-128
2000 – 2009
- 2003
- [c6]David Raymond Lutz, Chris N. Hinds:
Performance of the Floating-Point AMR Encoder on a Commercial Single-Issue Vector Processor. ESTIMedia 2003: 94-101
1990 – 1999
- 1999
- [c5]David Raymond Lutz, B. Kahne:
Performance analysis for chipsets and systems. IPCCC 1999: 445-450 - 1997
- [c4]David Raymond Lutz
, Doddaballapur Narasimha-Murthy Jayasimha:
The Half-Adder Form and Early Branch Condition Resolution. IEEE Symposium on Computer Arithmetic 1997: 266-273 - 1996
- [c3]David Raymond Lutz
, Doddaballapur Narasimha-Murthy Jayasimha:
Early Zero Detection. ICCD 1996: 545- - 1995
- [j1]David Raymond Lutz
, Doddaballapur Narasimha-Murthy Jayasimha:
Do Fixed-Processor Communication-Time Tradeoffs Exist? Parallel Process. Lett. 5: 311-320 (1995) - 1991
- [c2]Wolfgang Küchlin, David Raymond Lutz
, Nicholas J. Nevin:
Integer Multiplication in PARSAC-2 on Stock Microprocessors. AAECC 1991: 206-217 - [c1]David Raymond Lutz
, Doddaballapur Narasimha-Murthy Jayasimha:
What is an effective schedule? SPDP 1991: 158-161
Coauthor Index
![](https://dblp1.uni-trier.de/img/cog.dark.24x24.png)
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-07-18 21:56 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint