Lukas Gianinazzi
Orcid: 0000-0001-5975-4526
According to our database1,
Lukas Gianinazzi
authored at least 32 papers
between 2017 and 2024.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
Online presence:
-
on orcid.org
On csauthors.net:
Bibliography
2024
CoRR, 2024
Arrow Matrix Decomposition: A Novel Approach for Communication-Efficient Sparse Matrix Multiplication.
Proceedings of the 29th ACM SIGPLAN Annual Symposium on Principles and Practice of Parallel Programming, 2024
Proceedings of the IEEE International Parallel and Distributed Processing Symposium, 2024
Proceedings of the Forty-first International Conference on Machine Learning, 2024
Proceedings of the 33rd International Symposium on High-Performance Parallel and Distributed Computing, 2024
Proceedings of the Thirty-Eighth AAAI Conference on Artificial Intelligence, 2024
2023
High-Performance and Programmable Attentional Graph Neural Networks with Global Tensor Formulations.
Proceedings of the International Conference for High Performance Computing, 2023
Proceedings of the Learning on Graphs Conference, 27-30 November 2023, Virtual Event., 2023
Proceedings of the 32nd International Symposium on High-Performance Parallel and Distributed Computing, 2023
Proceedings of the Algorithms and Complexity - 13th International Conference, 2023
2022
Proceedings of the Advances in Neural Information Processing Systems 35: Annual Conference on Neural Information Processing Systems 2022, 2022
Proceedings of the KDD '22: The 28th ACM SIGKDD Conference on Knowledge Discovery and Data Mining, Washington, DC, USA, August 14, 2022
2021
ACM Trans. Parallel Comput., 2021
GraphMineSuite: Enabling High-Performance and Programmable Graph Mining Algorithms with Set Algebra.
Proc. VLDB Endow., 2021
SISA: Set-Centric Instruction Set Architecture for Graph Mining on Processing-in-Memory Systems.
CoRR, 2021
GraphMineSuite: Enabling High-Performance and Programmable Graph Mining Algorithms with Set Algebra.
CoRR, 2021
Pebbles, Graphs, and a Pinch of Combinatorics: Towards Tight I/O Lower Bounds for Statically Analyzable Programs.
Proceedings of the SPAA '21: 33rd ACM Symposium on Parallelism in Algorithms and Architectures, 2021
Proceedings of the SPAA '21: 33rd ACM Symposium on Parallelism in Algorithms and Architectures, 2021
SISA: Set-Centric Instruction Set Architecture for Graph Mining on Processing-in-Memory Systems.
Proceedings of the MICRO '21: 54th Annual IEEE/ACM International Symposium on Microarchitecture, 2021
2020
Proceedings of the SPAA '20: 32nd ACM Symposium on Parallelism in Algorithms and Architectures, 2020
High-performance parallel graph coloring with strong guarantees on work, depth, and quality.
Proceedings of the International Conference for High Performance Computing, 2020
2019
Slim graph: practical lossy graph compression for approximate graph processing, storage, and analytics.
Proceedings of the International Conference for High Performance Computing, 2019
Proceedings of the 19th Symposium on Algorithmic Approaches for Transportation Modelling, 2019
2018
Proceedings of the 23rd ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, 2018
2017
Proceedings of the Algorithms and Complexity - 10th International Conference, 2017