default search action
Marat Dukhan
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2020
- [c11]Erich Elsen, Marat Dukhan, Trevor Gale, Karen Simonyan:
Fast Sparse ConvNets. CVPR 2020: 14617-14626 - [c10]Marat Dukhan, Artsiom Ablavatski:
Two-Pass Softmax Algorithm. IPDPS Workshops 2020: 386-395 - [c9]Marat Dukhan:
Indirect Deconvolution Algorithm. IPDPS Workshops 2020: 922-926 - [i6]Marat Dukhan, Artsiom Ablavatski:
The Two-Pass Softmax Algorithm. CoRR abs/2001.04438 (2020)
2010 – 2019
- 2019
- [c8]Xiaoliang Dai, Peizhao Zhang, Bichen Wu, Hongxu Yin, Fei Sun, Yanghan Wang, Marat Dukhan, Yunqing Hu, Yiming Wu, Yangqing Jia, Peter Vajda, Matt Uyttendaele, Niraj K. Jha:
ChamNet: Towards Efficient Network Design Through Platform-Aware Model Adaptation. CVPR 2019: 11398-11407 - [c7]Carole-Jean Wu, David Brooks, Kevin Chen, Douglas Chen, Sy Choudhury, Marat Dukhan, Kim M. Hazelwood, Eldad Isaac, Yangqing Jia, Bill Jia, Tommer Leyvand, Hao Lu, Yang Lu, Lin Qiao, Brandon Reagen, Joe Spisak, Fei Sun, Andrew Tulloch, Peter Vajda, Xiaodong Wang, Yanghan Wang, Bram Wasti, Yiming Wu, Ran Xian, Sungjoo Yoo, Peizhao Zhang:
Machine Learning at Facebook: Understanding Inference at the Edge. HPCA 2019: 331-344 - [i5]Marat Dukhan:
The Indirect Convolution Algorithm. CoRR abs/1907.02129 (2019) - [i4]Erich Elsen, Marat Dukhan, Trevor Gale, Karen Simonyan:
Fast Sparse ConvNets. CoRR abs/1911.09723 (2019) - 2018
- [i3]Xiaoliang Dai, Peizhao Zhang, Bichen Wu, Hongxu Yin, Fei Sun, Yanghan Wang, Marat Dukhan, Yunqing Hu, Yiming Wu, Yangqing Jia, Peter Vajda, Matt Uyttendaele, Niraj K. Jha:
ChamNet: Towards Efficient Network Design through Platform-Aware Model Adaptation. CoRR abs/1812.08934 (2018) - 2016
- [j1]Edmond Chow, Xing Liu, Sanchit Misra, Marat Dukhan, Mikhail Smelyanskiy, Jeff R. Hammond, Yunfei Du, Xiangke Liao, Pradeep Dubey:
Scaling up Hartree-Fock calculations on Tianhe-2. Int. J. High Perform. Comput. Appl. 30(1): 85-102 (2016) - [i2]Marat Dukhan, Richard W. Vuduc, E. Jason Riedy:
Wanted: Floating-Point Add Round-off Error instruction. CoRR abs/1603.00491 (2016) - 2015
- [c6]Marat Dukhan:
PeachPy meets Opcodes: direct machine code generation from Python. PyHPC@SC 2015: 3:1-3:6 - [c5]Oded Green, Marat Dukhan, Richard W. Vuduc
:
Branch-Avoiding Graph Algorithms. SPAA 2015: 212-223 - 2014
- [c4]Jee W. Choi, Marat Dukhan, Xing Liu, Richard W. Vuduc
Algorithmic Time, Energy, and Power on Candidate HPC Compute Building Blocks. IPDPS 2014: 447-457 - [i1]Oded Green, Marat Dukhan, Richard W. Vuduc:
Branch-Avoiding Graph Algorithms. CoRR abs/1411.1460 (2014) - 2013
- [c3]Marat Dukhan:
What a fast FPU means for algorithms: A story of vector elementary functions. Hot Chips Symposium 2013: 1 - [c2]Marat Dukhan, Richard W. Vuduc
Methods for High-Throughput Computation of Elementary Functions. PPAM (1) 2013: 86-95 - 2012
- [c1]William B. March, Kenneth Czechowski, Marat Dukhan, Thomas Benson, Dongryeol Lee, Andrew J. Connolly
Optimizing the computation of n-point correlations on large-scale astronomical data. SC 2012: 74
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:00 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: