default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDStuart F. Oberman
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[i3]Mingjie Liu, Teodor-Dumitru Ene, Robert Kirby, Chris Cheng, Nathaniel Ross Pinckney, Rongjian Liang, Jonah Alben, Himyanshu Anand, Sanmitra Banerjee, Ismet Bayraktaroglu, Bonita Bhaskaran, Bryan Catanzaro, Arjun Chaudhuri, Sharon Clay, Bill Dally, Laura Dang, Parikshit Deshpande, Siddhanth Dhodhi, Sameer Halepete, Eric Hill, Jiashang Hu, Sumit Jain, Brucek Khailany, Kishor Kunal, Xiaowei Li, Hao Liu, Stuart F. Oberman, Sujeet Omar, Sreedhar Pratty, Jonathan Raiman, Ambar Sarkar, Zhengjiang Shao, Hanfei Sun, Pratik P. Suthar, Varun Tej, Kaizhe Xu, Haoxing Ren:
ChipNeMo: Domain-Adapted LLMs for Chip Design. CoRR abs/2311.00176 (2023)- 2022
- [j12]Stuart F. Oberman
, Leonel Sousa, Bogdan Pasca, Alberto Nannarelli:
Guest Editorial: Special Section on Emerging and Impacting Trends on Computer Arithmetic. IEEE Trans. Emerg. Top. Comput. 10(3): 1239-1240 (2022) - [i2]Rajarshi Roy, Jonathan Raiman, Neel Kant, Ilyas Elkin, Robert Kirby, Michael Y. Siu, Stuart F. Oberman, Saad Godil, Bryan Catanzaro:
PrefixRL: Optimization of Parallel Prefix Circuits using Deep Reinforcement Learning. CoRR abs/2205.07000 (2022) - [i1]Paulius Micikevicius, Dusan Stosic, Neil Burgess, Marius Cornea, Pradeep Dubey, Richard Grisenthwaite, Sangwon Ha, Alexander Heinecke, Patrick Judd, John Kamalu, Naveen Mellempudi, Stuart F. Oberman, Mohammad Shoeybi, Michael Y. Siu, Hao Wu:
FP8 Formats for Deep Learning. CoRR abs/2209.05433 (2022) - 2021
- [c7]Rajarshi Roy, Jonathan Raiman, Neel Kant, Ilyas Elkin, Robert Kirby, Michael Y. Siu, Stuart F. Oberman, Saad Godil, Bryan Catanzaro:
PrefixRL: Optimization of Parallel Prefix Circuits using Deep Reinforcement Learning. DAC 2021: 853-858
2010 – 2019
- 2017
- [j11]Javier Hormigo, Jean-Michel Muller, Stuart F. Oberman, Nathalie Revol, Arnaud Tisserand, Julio Villalba-Moreno:
Introduction to the Special Issue on Computer Arithmetic. IEEE Trans. Computers 66(12): 1991-1993 (2017) - 2016
- [e1]Paolo Montuschi, Michael J. Schulte, Javier Hormigo, Stuart F. Oberman, Nathalie Revol:
23nd IEEE Symposium on Computer Arithmetic, ARITH 2016, Silicon Valley, CA, USA, July 10-13, 2016. IEEE Computer Society 2016, ISBN 978-1-5090-1616-7 [contents]
2000 – 2009
- 2008
- [j10]Erik Lindholm, John Nickolls, Stuart F. Oberman, John Montrym:
NVIDIA Tesla: A Unified Graphics and Computing Architecture. IEEE Micro 28(2): 39-55 (2008) - 2005
- [j9]José-Alejandro Piñeiro, Stuart F. Oberman, Jean-Michel Muller, Javier D. Bruguera:
High-Speed Function Approximation Using a Minimax Quadratic Interpolator. IEEE Trans. Computers 54(3): 304-318 (2005) - [c6]Roger A. Golliver, Silvia M. Müller, Stuart F. Oberman, Martin S. Schmookler, Debjit Das Sarma, Andrew Beaumont-Smith:
Pain versus Gain in the Hardware Design of FPUs and Supercomputers. IEEE Symposium on Computer Arithmetic 2005: 39 - [c5]Stuart F. Oberman, Michael Y. Siu:
A High-Performance Area-Efficient Multifunction Interpolator. IEEE Symposium on Computer Arithmetic 2005: 272-279
1990 – 1999
- 1999
- [j8]Michael Golden, Steve Hesley, Alisa Scherer, Matthew Crowley, Scott C. Johnson, Stephan Meier, Dirk Meyer, Jerry D. Moench, Stuart F. Oberman, Hamid Partovi, Fred Weber, Scott White, Tim Wood, John Yong:
A seventh-generation x86 microprocessor. IEEE J. Solid State Circuits 34(11): 1466-1477 (1999) - [j7]Stuart F. Oberman, Greg Favor, Fred Weber:
AMD 3DNow! technology: architecture and implementations. IEEE Micro 19(2): 37-48 (1999) - [c4]Stuart F. Oberman:
Floating Point Division and Square Root Algorithms and Implementation in the AMD-K7 Microprocessor. IEEE Symposium on Computer Arithmetic 1999: 106-115 - 1998
- [j6]Stuart F. Oberman, Michael J. Flynn:
Reducing the Mean Latency of Floating-Point Addition. Theor. Comput. Sci. 196(1-2): 201-214 (1998) - [j5]Stuart F. Oberman, Michael J. Flynn:
Minimizing the complexity of SRT tables. IEEE Trans. Very Large Scale Integr. Syst. 6(1): 141-149 (1998) - 1997
- [j4]Hesham A. Al-Twaijry, Stuart F. Oberman, Steve T. Fu, Michael J. Flynn:
The SNAP Project: Building Validated Floating Point. J. Univers. Comput. Sci. 4(2): 99-109 (1997) - [j3]Stuart F. Oberman, Michael J. Flynn:
Design Issues in Division and Other Floating-Point Operations. IEEE Trans. Computers 46(2): 154-161 (1997) - [j2]Stuart F. Oberman, Michael J. Flynn:
Division Algorithms and Implementations. IEEE Trans. Computers 46(8): 833-854 (1997) - [c3]David L. Harris, Stuart F. Oberman, Mark Horowitz:
SRT Division Architectures and Implementations. IEEE Symposium on Computer Arithmetic 1997: 18-25 - [c2]Stuart F. Oberman, Hesham A. Al-Twaijry, Michael J. Flynn:
The SNAP Project: Design of Floating Point Arithmetic Unit. IEEE Symposium on Computer Arithmetic 1997: 156- - 1996
- [j1]Stuart F. Oberman, Michael J. Flynn:
Reducing division latency with reciprocal caches. Reliab. Comput. 2(2): 147-153 (1996) - [c1]Stuart F. Oberman, Michael J. Flynn:
A Variable Latency Pipelined Floating-Point Adder. Euro-Par, Vol. II 1996: 183-192
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 23:21 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:
