Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAlbert-Jan Nicholas Yzelman
Person information
- affiliation: Huawei Technologies Switzerland, Zurich, Switzerland
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2023
[j8]Aristeidis Mastoras
, Sotiris Anagnostidis, Albert-Jan Nicholas Yzelman:
Design and Implementation for Nonblocking Execution in GraphBLAS: Tradeoffs and Performance. ACM Trans. Archit. Code Optim. 20(1): 6:1-6:23 (2023)- 2022
- [j7]Pedro J. Martínez-Ferrer, A. N. Yzelman, Vicenç Beltran:
A Native Tensor-Vector Multiplication Algorithm for High Performance Computing. IEEE Trans. Parallel Distributed Syst. 33(12): 3363-3374 (2022) - 2019
- [j6]Filip Pawlowski, Bora Uçar, Albert-Jan Yzelman:
A multi-dimensional Morton-ordered block storage for mode-oblivious tensor computations. J. Comput. Sci. 33: 34-44 (2019) - 2014
- [j5]A. N. Yzelman, Rob H. Bisseling, Dirk Roose, Karl Meerbergen:
MulticoreBSP for C: A High-Performance Library for Shared-Memory Parallel Programming. Int. J. Parallel Program. 42(4): 619-642 (2014) - [j4]Albert-Jan Nicholas Yzelman, Dirk Roose:
High-Level Strategies for Parallel Shared-Memory Sparse Matrix-Vector Multiplication. IEEE Trans. Parallel Distributed Syst. 25(1): 116-125 (2014) - 2012
- [j3]A. N. Yzelman, Rob H. Bisseling:
An object-oriented bulk synchronous parallel library for multicore programming. Concurr. Comput. Pract. Exp. 24(5): 533-553 (2012) - 2011
- [j2]A. N. Yzelman, Rob H. Bisseling:
Two-dimensional cache-oblivious sparse matrix-vector multiplication. Parallel Comput. 37(12): 806-819 (2011) - 2009
- [j1]A. N. Yzelman, Rob H. Bisseling:
Cache-Oblivious Sparse Matrix--Vector Multiplication by Using Sparse Matrix Partitioning Methods. SIAM J. Sci. Comput. 31(4): 3128-3154 (2009)
Conference and Workshop Papers
- 2024
- [c11]Pál András Papp, Georg Anegg, Aikaterini Karanasiou, Albert-Jan Nicholas Yzelman:
Efficient Multi-Processor Scheduling in Increasingly Realistic Models (Brief Summary). IPDPS (Workshops) 2024: 1169-1171 - [c10]Toni Böhnlein, Pál András Papp, Albert-Jan Nicholas Yzelman:
Brief Announcement: Red-Blue Pebbling with Multiple Processors: Time, Communication and Memory Trade-offs. SPAA 2024: 285-287 - [c9]Pál András Papp, Georg Anegg, Aikaterini Karanasiou, Albert-Jan Nicholas Yzelman:
Efficient Multi-Processor Scheduling in Increasingly Realistic Models. SPAA 2024: 463-474 - 2023
- [c8]Alberto Scolari, Albert-Jan Yzelman:
Effective implementation of the High Performance Conjugate Gradient benchmark on GraphBLAS. IPDPS Workshops 2023: 216-225 - [c7]Daniele G. Spampinato, Denis Jelovina, Jiawei Zhuang, Albert-Jan Nicholas Yzelman:
Towards Structured Algebraic Programming. ARRAY@PLDI 2023: 50-61 - [c6]Aristeidis Mastoras, Albert-Jan Nicholas Yzelman:
Studying the expressiveness and performance of parallelization abstractions for linear pipelines. PMAM@PPoPP 2023: 29-38 - [c5]Pál András Papp, Georg Anegg, Albert-Jan Nicholas Yzelman:
Partitioning Hypergraphs is Hard: Models, Inapproximability, and Applications. SPAA 2023: 415-425 - 2022
- [c4]Aristeidis Mastoras, Sotiris Anagnostidis, Albert-Jan Nicholas Yzelman:
Nonblocking execution in GraphBLAS. IPDPS Workshops 2022: 230-233 - 2020
- [c3]Filip Pawlowski, Rob H. Bisseling, Bora Uçar, A. N. Yzelman:
Combinatorial Tiling for Sparse Neural Networks. HPEC 2020: 1-7 - 2019
- [c2]Filip Pawlowski, Bora Uçar, Albert-Jan Yzelman:
High Performance Tensor-Vector Multiplication on Shared-Memory Systems. PPAM (1) 2019: 38-48 - 2015
- [c1]A. N. Yzelman:
Generalised vectorisation for sparse matrix: vector multiplication. IA3@SC 2015: 6:1-6:8
Informal and Other Publications
- 2024
- [i7]Pál András Papp, Georg Anegg, Aikaterini Karanasiou, A. N. Yzelman:
Efficient Multi-Processor Scheduling in Increasingly Realistic Models. CoRR abs/2404.15246 (2024) - 2023
- [i6]Pál András Papp, Georg Anegg, A. N. Yzelman:
DAG Scheduling in the BSP Model. CoRR abs/2303.05989 (2023) - [i5]Alberto Scolari, Albert-Jan Yzelman:
Effective implementation of the High Performance Conjugate Gradient benchmark on GraphBLAS. CoRR abs/2304.08232 (2023) - [i4]Deepak Ajwani, Rob H. Bisseling, Katrin Casel, Ümit V. Çatalyürek, Cédric Chevalier, Florian Chudigiewitsch, Marcelo Fonseca Faraj, Michael R. Fellows, Lars Gottesbüren, Tobias Heuer, George Karypis, Kamer Kaya, Jakub Lacki, Johannes Langguth, Xiaoye Sherry Li, Ruben Mayer, Johannes Meintrup, Yosuke Mizutani, François Pellegrini, Fabrizio Petrini, Frances A. Rosamond, Ilya Safro, Sebastian Schlag, Christian Schulz, Roohani Sharma, Darren Strash, Blair D. Sullivan, Bora Uçar, Albert-Jan Yzelman:
Open Problems in (Hyper)Graph Decomposition. CoRR abs/2310.11812 (2023) - [i3]George Karypis, Christian Schulz, Darren Strash, Deepak Ajwani, Rob H. Bisseling, Katrin Casel, Ümit V. Çatalyürek, Cédric Chevalier, Florian Chudigiewitsch, Marcelo Fonseca Faraj, Michael R. Fellows, Lars Gottesbüren, Tobias Heuer, Kamer Kaya, Jakub Lacki, Johannes Langguth, Xiaoye Sherry Li, Ruben Mayer, Johannes Meintrup, Yosuke Mizutani, François Pellegrini, Fabrizio Petrini, Frances A. Rosamond, Ilya Safro, Sebastian Schlag, Roohani Sharma, Blair D. Sullivan, Bora Uçar, Albert-Jan Yzelman:
Recent Trends in Graph Decomposition (Dagstuhl Seminar 23331). Dagstuhl Reports 13(8): 1-45 (2023) - 2022
- [i2]Pál András Papp, Georg Anegg, A. N. Yzelman:
Partitioning Hypergraphs is Hard: Models, Inapproximability, and Applications. CoRR abs/2208.08257 (2022) - 2019
- [i1]Wijnand Suijlen, A. N. Yzelman:
Lightweight Parallel Foundations: a model-compliant communication layer. CoRR abs/1906.03196 (2019)
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-08 19: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:
