| Sisa: Set-centric instruction set architecture for graph mining on processing-in-memory systems M Besta, R Kanakagiri, G Kwasniewski, R Ausavarungnirun, J Beránek, ... MICRO-54: 54th Annual IEEE/ACM International Symposium on Microarchitecture …, 2021 | 51 | 2021 |
| Communication-avoiding parallel minimum cuts and connected components L Gianinazzi, P Kalvoda, A De Palma, M Besta, T Hoefler ACM SIGPLAN Notices 53 (1), 219-232, 2018 | 33 | 2018 |
| Slim graph: Practical lossy graph compression for approximate graph processing, storage, and analytics M Besta, S Weber, L Gianinazzi, R Gerstenberger, A Ivanov, Y Oltchik, ... Proceedings of the International Conference for High Performance Computing …, 2019 | 30 | 2019 |
| High-performance parallel graph coloring with strong guarantees on work, depth, and quality M Besta, A Carigiet, K Janda, Z Vonarburg-Shmaria, L Gianinazzi, ... SC20: International Conference for High Performance Computing, Networking …, 2020 | 24 | 2020 |
| Parallel minimum cuts in near-linear work and low depth B Geissmann, L Gianinazzi Proceedings of the 30th on Symposium on Parallelism in Algorithms and …, 2018 | 20 | 2018 |
| Graphminesuite: Enabling high-performance and programmable graph mining algorithms with set algebra M Besta, Z Vonarburg-Shmaria, Y Schaffner, L Schwarz, G Kwasniewski, ... arXiv preprint arXiv:2103.03653, 2021 | 14 | 2021 |
| Parallel algorithms for finding large cliques in sparse graphs L Gianinazzi, M Besta, Y Schaffner, T Hoefler Proceedings of the 33rd ACM Symposium on Parallelism in Algorithms and …, 2021 | 12 | 2021 |
| Motif prediction with graph neural networks M Besta, R Grob, C Miglioli, N Bernold, G Kwasniewski, G Gjini, ... Proceedings of the 28th ACM SIGKDD Conference on Knowledge Discovery and …, 2022 | 9 | 2022 |
| Pebbles, graphs, and a pinch of combinatorics: Towards tight i/o lower bounds for statically analyzable programs G Kwasniewski, T Ben-Nun, L Gianinazzi, A Calotoiu, T Schneider, ... Proceedings of the 33rd ACM Symposium on Parallelism in Algorithms and …, 2021 | 5 | 2021 |
| Learning combinatorial node labeling algorithms L Gianinazzi, M Fries, N Dryden, T Ben-Nun, M Besta, T Hoefler arXiv preprint arXiv:2106.03594, 2021 | 5 | 2021 |
| Cache oblivious minimum cut B Geissmann, L Gianinazzi Algorithms and Complexity: 10th International Conference, CIAC 2017, Athens …, 2017 | 5 | 2017 |
| ENS-10: A Dataset For Post-Processing Ensemble Weather Forecast S Ashkboos, L Huang, N Dryden, T Ben-Nun, P Dueben, L Gianinazzi, ... arXiv preprint arXiv:2206.14786, 2022 | 3 | 2022 |
| Parallel planar subgraph isomorphism and vertex connectivity L Gianinazzi, T Hoefler Proceedings of the 32nd ACM Symposium on Parallelism in Algorithms and …, 2020 | 3 | 2020 |
| Parametric Graph Templates: Properties and Algorithms T Ben-Nun, L Gianinazzi, T Hoefler, Y Oltchik arXiv preprint arXiv:2011.07001, 2020 | 2 | 2020 |
| The spatial computer: A model for energy-efficient parallel computation L Gianinazzi, T Ben-Nun, S Ashkboos, Y Baumann, P Luczynski, ... arXiv preprint arXiv:2205.04934, 2022 | 1 | 2022 |
| Routing in stochastic public transit networks B Geissmann, L Gianinazzi 19th Symposium on Algorithmic Approaches for Transportation Modelling …, 2019 | | 2019 |
Torsten HoeflerProfessor of Computer Science at ETH ZurichVerified email at inf.ethz.ch
