Grzegorz Kwasniewski

Orcid: 0000-0001-8943-1381

According to our database1, Grzegorz Kwasniewski authored at least 23 papers between 2014 and 2024.

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

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

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

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

2022
Deinsum: Practically I/O Optimal Multilinear Algebra.
CoRR, 2022

Deinsum: Practically I/O Optimal Multi-Linear Algebra.
Proceedings of the SC22: International Conference for High Performance Computing, 2022

ProbGraph: High-Performance and High-Accuracy Graph Mining with Probabilistic Set Representations.
Proceedings of the SC22: International Conference for High Performance Computing, 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

Lifting C semantics for dataflow optimization.
Proceedings of the ICS '22: 2022 International Conference on Supercomputing, Virtual Event, June 28, 2022

2021
Performance modeling and optimal schedules for data oblivious programs.
PhD thesis, 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

On the parallel I/O optimality of linear algebra kernels: near-optimal matrix factorizations.
Proceedings of the International Conference for High Performance Computing, 2021

On the parallel I/O optimality of linear algebra kernels: near-optimal LU factorization.
Proceedings of the PPoPP '21: 26th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, 2021

SeBS: a serverless benchmark suite for function-as-a-service computing.
Proceedings of the Middleware '21: 22nd International Middleware Conference, Québec City, Canada, December 6, 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
Flexible Communication Avoiding Matrix Multiplication on FPGA with High-Level Synthesis.
Proceedings of the FPGA '20: The 2020 ACM/SIGDA International Symposium on Field-Programmable Gate Arrays, 2020

2019
Red-blue pebbling revisited: near optimal parallel matrix-matrix multiplication.
Proceedings of the International Conference for High Performance Computing, 2019

2016
Automatic Performance Modeling of HPC Applications.
Proceedings of the Software for Exascale Computing - SPPEXA 2013-2015, 2016

Extreme scale plasma turbulence simulations on top supercomputers worldwide.
Proceedings of the International Conference for High Performance Computing, 2016

A PCIe congestion-aware performance model for densely populated accelerator servers.
Proceedings of the International Conference for High Performance Computing, 2016

2015
Using Compiler Techniques to Improve Automatic Performance Modeling.
Proceedings of the 2015 International Conference on Parallel Architectures and Compilation, 2015

2014
Automatic complexity analysis of explicitly parallel programs.
Proceedings of the 26th ACM Symposium on Parallelism in Algorithms and Architectures, 2014


  Loading...