| Graph of thoughts: Solving elaborate problems with large language models M Besta, N Blach, A Kubicek, R Gerstenberger, M Podstawski, ... Proceedings of the AAAI Conference on Artificial Intelligence 38 (16), 17682 …, 2024 | 542 | 2024 |
| 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 | 102 | 2021 |
| 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 | 40 | 2020 |
| 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 | 38 | 2022 |
| 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 | 38 | 2019 |
| 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 | 37 | 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 | 36 | 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 | 28 | 2021 |
| 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 | 28 | 2018 |
| Ens-10: A dataset for post-processing ensemble weather forecasts S Ashkboos, L Huang, N Dryden, T Ben-Nun, P Dueben, L Gianinazzi, ... Advances in Neural Information Processing Systems 35, 21974-21987, 2022 | 24 | 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 | 18 | 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 | 18 | 2021 |
| Diffda: a diffusion model for weather-scale data assimilation L Huang, L Gianinazzi, Y Yu, PD Dueben, T Hoefler arXiv preprint arXiv:2401.05932, 2024 | 16 | 2024 |
| Topologies of reasoning: Demystifying chains, trees, and graphs of thoughts M Besta, F Memedi, Z Zhang, R Gerstenberger, N Blach, P Nyczyk, ... arXiv preprint arXiv:2401.14295, 2024 | 12 | 2024 |
| The spatial computer: A model for energy-efficient parallel computation L Gianinazzi, T Ben-Nun, M Besta, S Ashkboos, Y Baumann, P Luczynski, ... arXiv preprint arXiv:2205.04934, 2022 | 7 | 2022 |
| Graph of thoughts: Solving elaborate problems with large language models. CoRR, abs/2308.09687, 2023. doi: 10.48550 M Besta, N Blach, A Kubicek, R Gerstenberger, L Gianinazzi, J Gajda, ... arXiv preprint ARXIV.2308.09687, 0 | 7 | |
| High-Performance and Programmable Attentional Graph Neural Networks with Global Tensor Formulations M Besta, P Renc, R Gerstenberger, P Sylos Labini, A Ziogas, T Chen, ... Proceedings of the International Conference for High Performance Computing …, 2023 | 6 | 2023 |
| HOT: Higher-Order Dynamic Graph Representation Learning with Efficient Transformers M Besta, AC Catarino, L Gianinazzi, N Blach, P Nyczyk, H Niewiadomski, ... Learning on Graphs Conference, 15: 1-15: 20, 2024 | 5 | 2024 |
| Cache oblivious minimum cut B Geissmann, L Gianinazzi International Conference on Algorithms and Complexity, 285-296, 2017 | 5 | 2017 |
| Arrow Matrix Decomposition: A Novel Approach for Communication-Efficient Sparse Matrix Multiplication L Gianinazzi, AN Ziogas, L Huang, P Luczynski, S Ashkboosh, F Scheidl, ... Proceedings of the 29th ACM SIGPLAN Annual Symposium on Principles and …, 2024 | 4 | 2024 |
Torsten HoeflerProfessor of Computer Science at ETH ZurichVerified email at inf.ethz.ch
