Lukas Gianinazzi

Orcid: 0000-0001-5975-4526

According to our database1, Lukas Gianinazzi authored at least 27 papers between 2017 and 2024.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Topologies of Reasoning: Demystifying Chains, Trees, and Graphs of Thoughts.
CoRR, 2024

DiffDA: a diffusion model for weather-scale data assimilation.
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

Graph of Thoughts: Solving Elaborate Problems with Large Language Models.
Proceedings of the Thirty-Eighth AAAI Conference on Artificial Intelligence, 2024

2023
HOT: Higher-Order Dynamic Graph Representation Learning with Efficient Transformers.
CoRR, 2023

High-Performance and Programmable Attentional Graph Neural Networks with Global Tensor Formulations.
Proceedings of the International Conference for High Performance Computing, 2023

Streaming Task Graph Scheduling for Dataflow Architectures.
Proceedings of the 32nd International Symposium on High-Performance Parallel and Distributed Computing, 2023

Maximum Flows in Parametric Graph Templates.
Proceedings of the Algorithms and Complexity - 13th International Conference, 2023

2022
ENS-10: A Dataset For Post-Processing Ensemble Weather Forecast.
CoRR, 2022

The spatial computer: A model for energy-efficient parallel computation.
CoRR, 2022

ENS-10: A Dataset For Post-Processing Ensemble Weather Forecasts.
Proceedings of the Advances in Neural Information Processing Systems 35: Annual Conference on Neural Information Processing Systems 2022, 2022

Motif Prediction with Graph Neural Networks.
Proceedings of the KDD '22: The 28th ACM SIGKDD Conference on Knowledge Discovery and Data Mining, Washington, DC, USA, August 14, 2022

2021
Parallel Minimum Cuts in Near-linear Work and Low Depth.
ACM Trans. Parallel Comput., 2021

GraphMineSuite: Enabling High-Performance and Programmable Graph Mining Algorithms with Set Algebra.
Proc. VLDB Endow., 2021

Learning Combinatorial Node Labeling Algorithms.
CoRR, 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

Parallel Algorithms for Finding Large Cliques in Sparse Graphs.
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
Parametric Graph Templates: Properties and Algorithms.
CoRR, 2020

Parallel Planar Subgraph Isomorphism and Vertex Connectivity.
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

Routing in Stochastic Public Transit Networks.
Proceedings of the 19th Symposium on Algorithmic Approaches for Transportation Modelling, 2019

2018
Communication-avoiding parallel minimum cuts and connected components.
Proceedings of the 23rd ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, 2018

2017
Cache Oblivious Minimum Cut.
Proceedings of the Algorithms and Complexity - 10th International Conference, 2017


  Loading...