default search action
Search dblp
Full-text search
- > Home
Please enter a search query
- case-insensitive prefix search: default
e.g., sig matches "SIGIR" as well as "signal" - exact word search: append dollar sign ($) to word
e.g., graph$ matches "graph", but not "graphics" - boolean and: separate words by space
e.g., codd model - boolean or: connect words by pipe symbol (|)
e.g., graph|network
Update May 7, 2017: Please note that we had to disable the phrase search operator (.) and the boolean not operator (-) due to technical problems. For the time being, phrase search queries will yield regular prefix search result, and search terms preceded by a minus will be interpreted as regular (positive) search terms.
Author search results
no matches
Venue search results
no matches
Refine list
refine by author
- no options
- temporarily not available
refine by venue
- no options
- temporarily not available
refine by type
- no options
- temporarily not available
refine by access
- no options
- temporarily not available
refine by year
- no options
- temporarily not available
Publication search results
found 16 matches
- 2022
- Noushin Azami, Martin Burtscher:
Compressed In-memory Graphs for Accelerating GPU-based Analytics. IA3@SC 2022: 32-40 - Paolo Sylos Labini, Massimo Bernaschi, Werner Nutt, Francesco Silvestri, Flavio Vella:
Blocking Sparse Matrices to Leverage Dense-Specific Multiplication. IA3@SC 2022: 19-24 - Brian A. Page, Peter M. Kogge:
The Evolution of a New Model of Computation. IA3@SC 2022: 9-18 - Ahmedur Rahman Shovon, Landon Richard Dyken, Oded Green, Thomas Gilray, Sidharth Kumar:
Accelerating Datalog applications with cuDF. IA3@SC 2022: 41-45 - Hikaru Takayashiki, Masayuki Sato, Kazuhiko Komatsu, Hiroaki Kobayashi:
Page-Address Coalescing of Vector Gather Instructions for Efficient Address Translation. IA3@SC 2022: 1-8 - Pedro Valero-Lara, Cameron Greenwalt, Jeffrey S. Vetter:
SparseLU, A Novel Algorithm and Math Library for Sparse LU Factorization. IA3@SC 2022: 25-31 - 12th IEEE/ACM Workshop on Irregular Applications: Architectures and Algorithms, IA3@SC 2022, Dallas, TX, USA, November 13-18, 2022. IEEE 2022, ISBN 978-1-6654-7506-8 [contents]
- 2021
- Ümit V. Çatalyürek:
Implementing Performance Portable Graph Algorithms Using Task-Based Execution. IA3@SC 2021: 1 - Jinhao Chen, Timothy A. Davis, Christopher J. Lourenco, Erick Moreno-Centeno:
Sparse Exact Factorization Update. IA3@SC 2021: 35-42 - Eric Cheng:
Project 38: Innovative Architectures for High-Performance Computing Systems. IA3@SC 2021: 1 - Brian A. Page, Peter M. Kogge:
Greatly Accelerated Scaling of Streaming Problems with A Migrating Thread Architecture. IA3@SC 2021: 11-18 - Peter Pirkelbauer, Seth Bromberger, Keita Iwabuchi, Roger Pearce:
Towards Scalable Data Processing in Python with CLIPPy. IA3@SC 2021: 43-52 - Scott Sallinen, Matei Ripeanu:
No More Leaky PageRank. IA3@SC 2021: 27-34 - Leonardo Solis-Vasquez, Erich Focht, Andreas Koch:
Mapping Irregular Computations for Molecular Docking to the SX-Aurora TSUBASA Vector Engine. IA3@SC 2021: 1-10 - Christopher P. Stone, Aaron Walden, Mohammad Zubair, Eric J. Nielsen:
Accelerating unstructured-grid CFD algorithms on NVIDIA and AMD GPUs. IA3@SC 2021: 19-26 - 11th IEEE/ACM Workshop on Irregular Applications: Architectures and Algorithms, IA3@SC 2021, St. Louis, MO, USA, November 15, 2021. IEEE 2021, ISBN 978-1-6654-1126-4 [contents]
loading more results
failed to load more results, please try again later
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.
retrieved on 2025-01-09 06:14 CET from data curated by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint