Cache-oblivious sparse matrix–vector multiplication by using sparse matrix partitioning methods AN Yzelman, RH Bisseling SIAM Journal on Scientific Computing 31 (4), 3128-3154, 2009 | 117 | 2009 |
High-level strategies for parallel shared-memory sparse matrix-vector multiplication AJN Yzelman, D Roose IEEE Transactions on Parallel and Distributed Systems 25 (1), 116-125, 2013 | 70 | 2013 |
MulticoreBSP for C: a high-performance library for shared-memory parallel programming AN Yzelman, RH Bisseling, D Roose, K Meerbergen International Journal of Parallel Programming 42, 619-642, 2014 | 53 | 2014 |
Two-dimensional cache-oblivious sparse matrix–vector multiplication AN Yzelman, RH Bisseling Parallel Computing 37 (12), 806-819, 2011 | 53 | 2011 |
An object‐oriented bulk synchronous parallel library for multicore programming AN Yzelman, RH Bisseling Concurrency and Computation: Practice and Experience 24 (5), 533-553, 2012 | 44* | 2012 |
A cache-oblivious sparse matrix–vector multiplication scheme based on the Hilbert curve AJN Yzelman, RH Bisseling Progress in Industrial Mathematics at ECMI 2010, 627-633, 2012 | 34 | 2012 |
Two-dimensional approaches to sparse matrix partitioning RH Bisseling, BO Fagginger Auer, AN Yzelman, T van Leeuwen, ... CRC Press, 2012 | 22 | 2012 |
A C++ GraphBLAS: specification, implementation, parallelisation, and evaluation AN Yzelman, D Di Nardo, JM Nash, WJ Suijlen Preprint 58, 2020 | 16 | 2020 |
Generalised vectorisation for sparse matrix–vector multiplication AN Yzelman Proceedings of the 5th Workshop on Irregular Applications: Architectures and …, 2015 | 15 | 2015 |
A multi-dimensional Morton-ordered block storage for mode-oblivious tensor computations F Pawłowski, B Uçar, AJ Yzelman Journal of computational science 33, 34-44, 2019 | 11 | 2019 |
Node counting in wireless ad-hoc networks J Evers, D Kiss, W Kowalczyk, T Navilarekallu, M Renger, L Sella, ... | 11 | 2011 |
Fast sparse matrix-vector multiplication by partitioning and reordering AN Yzelman Utrecht University, 2011 | 10 | 2011 |
Nonblocking execution in GraphBLAS A Mastoras, S Anagnostidis, AJN Yzelman 2022 IEEE International Parallel and Distributed Processing Symposium …, 2022 | 8 | 2022 |
Sparse matrix--vector multiplication: parallelization and vectorization AJ Yzelman, D Roose, K Meerbergen Elsevier, 2014 | 8 | 2014 |
Partitioning Hypergraphs is Hard: Models, Inapproximability, and Applications P András Papp, G Anegg, AN Yzelman arXiv e-prints, arXiv: 2208.08257, 2022 | 7* | 2022 |
Lightweight Parallel Foundations: a model-compliant communication layer W Suijlen, AN Yzelman arXiv preprint arXiv:1906.03196, 2019 | 7 | 2019 |
Mondriaan for sparse matrix partitioning R Bisseling, BF Auer, AJ Yzelman, B Vastenhouw Utrecht University (2002–present), 2012 | 7 | 2012 |
Design and implementation for nonblocking execution in GraphBLAS: Tradeoffs and performance A Mastoras, S Anagnostidis, AJN Yzelman ACM Transactions on Architecture and Code Optimization 20 (1), 1-23, 2022 | 6 | 2022 |
DAG Scheduling in the BSP Model PA Papp, G Anegg, AN Yzelman arXiv preprint arXiv:2303.05989, 2023 | 5 | 2023 |
Combinatorial Tiling for Sparse Neural Networks F Pawłowski, RH Bisseling, B Uçar, AN Yzelman 2020 IEEE High Performance Extreme Computing Conference (HPEC), 1-7, 2020 | 5 | 2020 |