default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDRichard Veras
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Books and Theses
- 2017
[b1]Richard Veras:
A Systematic Approach for Obtaining Performance on Matrix-Like Operations. Carnegie Mellon University, USA, 2017
Journal Articles
- 2018
- [j1]Franz Franchetti
, Tze Meng Low, Doru-Thom Popovici, Richard Michael Veras, Daniele G. Spampinato, Jeremy R. Johnson, Markus Püschel, James C. Hoe, José M. F. Moura:
SPIRAL: Extreme Performance Portability. Proc. IEEE 106(11): 1935-1968 (2018)
Conference and Workshop Papers
- 2023
- [c12]Khaled Abdelaal, Richard Veras:
A Framework for Analyzing the Robustness of Graph Models. HPEC 2023: 1-6 - [c11]Khaled Abdelaal, Richard Veras:
Observe Locally, Classify Globally: Using GNNs to Identify Sparse Matrix Structure. IWANN (1) 2023: 149-161 - 2022
- [c10]Meggie van den Oever, Lauren E. Grimley, Richard Michael Veras:
Using q-learning to select the best among functionally equivalent implementations. ARRAY@PLDI 2022: 37-45 - 2021
- [c9]Sudhindra Gopal Krishna, Aditya Narasimhan, Sridhar Radhakrishnan, Richard Veras:
On Large-Scale Matrix-Matrix Multiplication On Compressed Structures. IEEE BigData 2021: 2976-2985 - 2019
- [c8]Rui Li, Aravind Sukumaran-Rajam, Richard Veras, Tze Meng Low, Fabrice Rastello, Atanas Rountev, P. Sadayappan:
Analytical cache modeling and tilesize optimization for tensor contractions. SC 2019: 74:1-74:13 - 2017
- [c7]Richard Michael Veras, Franz Franchetti:
A scale-free structure for real world networks. HPEC 2017: 1-7 - 2016
- [c6]Richard Veras, Tze Meng Low, Franz Franchetti:
A scale-free structure for power-law graphs. HPEC 2016: 1-7 - [c5]Richard Veras, Doru-Thom Popovici, Tze Meng Low, Franz Franchetti:
Compilers, hands-off my hands-on optimizations. WPMVP@PPoPP 2016: 4:1-4:8 - 2014
- [c4]Richard Veras, Franz Franchetti:
Capturing the Expert: Generating Fast Matrix-Multiply Kernels with Spiral. VECPAR 2014: 236-244 - 2013
- [c3]Thomas Henretty, Richard Veras, Franz Franchetti, Louis-Noël Pouchet, J. Ramanujam, P. Sadayappan:
A stencil compiler for short-vector SIMD architectures. ICS 2013: 13-24 - [c2]Martin Kong, Richard Veras, Kevin Stock, Franz Franchetti, Louis-Noël Pouchet, P. Sadayappan:
When polyhedral transformations meet SIMD code generation. PLDI 2013: 127-138 - 2012
- [c1]Jamie Liu, Ben Jaiyen, Richard Veras, Onur Mutlu:
RAIDR: Retention-aware intelligent DRAM refresh. ISCA 2012: 1-12
Informal and Other Publications
- 2024
- [i3]Chase Cummins, Richard Veras:
Reinforcement Learning for Graph Coloring: Understanding the Power and Limits of Non-Label Invariant Representations. CoRR abs/2401.12470 (2024) - 2023
- [i2]Khaled Abdelaal, Richard Veras:
Observe Locally, Classify Globally: Using GNNs to Identify Sparse Matrix Structure. CoRR abs/2309.02442 (2023) - 2016
- [i1]Richard Michael Veras, Tze Meng Low, Tyler Michael Smith, Robert A. van de Geijn, Franz Franchetti:
Automating the Last-Mile for High Performance Dense Linear Algebra. CoRR abs/1611.08035 (2016)
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-08-05 21:18 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:
