default search action
Lukas Gianinazzi
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [c21]Maciej Besta, Nils Blach, Ales Kubicek, Robert Gerstenberger, Michal Podstawski, Lukas Gianinazzi, Joanna Gajda, Tomasz Lehmann
, Hubert Niewiadomski, Piotr Nyczyk, Torsten Hoefler:
Graph of Thoughts: Solving Elaborate Problems with Large Language Models. AAAI 2024: 17682-17690 - [c20]Piotr Luczynski
Near-Optimal Wafer-Scale Reduce. HPDC 2024: 334-347 - [c19]Langwen Huang, Lukas Gianinazzi, Yuejiang Yu, Peter D. Düben, Torsten Hoefler:
DiffDA: a Diffusion model for weather-scale Data Assimilation. ICML 2024 - [c18]Yves Baumann, Tal Ben-Nun, Maciej Besta, Lukas Gianinazzi, Torsten Hoefler, Piotr Luczynski:
Low-Depth Spatial Tree Algorithms. IPDPS 2024: 180-192 - [c17]Lukas Gianinazzi
Arrow Matrix Decomposition: A Novel Approach for Communication-Efficient Sparse Matrix Multiplication. PPoPP 2024: 404-416 - [i23]Langwen Huang, Lukas Gianinazzi, Yuejiang Yu, Peter D. Düben, Torsten Hoefler:
DiffDA: a diffusion model for weather-scale data assimilation. CoRR abs/2401.05932 (2024) - [i22]Maciej Besta, Florim Memedi, Zhenyu Zhang, Robert Gerstenberger, Nils Blach, Piotr Nyczyk, Marcin Copik
Topologies of Reasoning: Demystifying Chains, Trees, and Graphs of Thoughts. CoRR abs/2401.14295 (2024) - [i21]Lukas Gianinazzi, Alexandros Nikolaos Ziogas, Langwen Huang, Piotr Luczynski, Saleh Ashkboos, Florian Scheidl, Armon Carigiet, Chio Ge, Nabil Abubaker, Maciej Besta, Tal Ben-Nun, Torsten Hoefler:
Arrow Matrix Decomposition: A Novel Approach for Communication-Efficient Sparse Matrix Multiplication. CoRR abs/2402.19364 (2024) - [i20]Yves Baumann, Tal Ben-Nun, Maciej Besta, Lukas Gianinazzi, Torsten Hoefler, Piotr Luczynski:
Low-Depth Spatial Tree Algorithms. CoRR abs/2404.12953 (2024) - [i19]Piotr Luczynski, Lukas Gianinazzi, Patrick Iff, Leighton Wilson, Daniele De Sensi, Torsten Hoefler:
Near-Optimal Wafer-Scale Reduce. CoRR abs/2404.15888 (2024) - [i18]Maciej Besta, Florian Scheidl, Lukas Gianinazzi, Shachar Klaiman, Jürgen Müller, Torsten Hoefler:
Demystifying Higher-Order Graph Neural Networks. CoRR abs/2406.12841 (2024) - 2023
- [c16]Tal Ben-Nun
Maximum Flows in Parametric Graph Templates. CIAC 2023: 97-111 - [c15]Tiziano De Matteis
Streaming Task Graph Scheduling for Dataflow Architectures. HPDC 2023: 225-237 - [c14]Maciej Besta, Afonso Claudino Catarino, Lukas Gianinazzi, Nils Blach, Piotr Nyczyk, Hubert Niewiadomski, Torsten Hoefler:
HOT: Higher-Order Dynamic Graph Representation Learning With Efficient Transformers. LoG 2023: 15 - [c13]Maciej Besta
High-Performance and Programmable Attentional Graph Neural Networks with Global Tensor Formulations. SC 2023: 66:1-66:16 - [d2]Maciej Besta, Pawel Renc
GNN Scaling 0.1 Software Artifact. Zenodo, 2023 - [d1]Lukas Gianinazzi
Arrow Matrix Decompositions. Zenodo, 2023 - [i17]Tiziano De Matteis, Lukas Gianinazzi, Johannes de Fine Licht, Torsten Hoefler:
Streaming Task Graph Scheduling for Dataflow Architectures. CoRR abs/2306.02730 (2023) - [i16]Tal Ben-Nun, Lukas Gianinazzi, Torsten Hoefler, Yishai Oltchik:
Maximum Flows in Parametric Graph Templates. CoRR abs/2307.08420 (2023) - [i15]Maciej Besta, Nils Blach, Ales Kubicek, Robert Gerstenberger, Lukas Gianinazzi, Joanna Gajda, Tomasz Lehmann, Michal Podstawski, Hubert Niewiadomski, Piotr Nyczyk, Torsten Hoefler:
Graph of Thoughts: Solving Elaborate Problems with Large Language Models. CoRR abs/2308.09687 (2023) - [i14]Maciej Besta, Afonso Claudino Catarino, Lukas Gianinazzi, Nils Blach, Piotr Nyczyk, Hubert Niewiadomski, Torsten Hoefler:
HOT: Higher-Order Dynamic Graph Representation Learning with Efficient Transformers. CoRR abs/2311.18526 (2023) - 2022
- [c12]Maciej Besta, Raphael Grob, Cesare Miglioli
Motif Prediction with Graph Neural Networks. KDD 2022: 35-45 - [c11]Saleh Ashkboos, Langwen Huang, Nikoli Dryden, Tal Ben-Nun, Peter Dueben, Lukas Gianinazzi, Luca Kummer, Torsten Hoefler:
ENS-10: A Dataset For Post-Processing Ensemble Weather Forecasts. NeurIPS 2022 - [i13]Lukas Gianinazzi, Tal Ben-Nun, Saleh Ashkboos, Yves Baumann, Piotr Luczynski, Torsten Hoefler:
The spatial computer: A model for energy-efficient parallel computation. CoRR abs/2205.04934 (2022) - [i12]Saleh Ashkboos, Langwen Huang, Nikoli Dryden, Tal Ben-Nun, Peter Dueben, Lukas Gianinazzi, Luca Kummer, Torsten Hoefler:
ENS-10: A Dataset For Post-Processing Ensemble Weather Forecast. CoRR abs/2206.14786 (2022) - 2021
- [j2]Maciej Besta, Zur Vonarburg-Shmaria, Yannick Schaffner, Leonardo Schwarz, Grzegorz Kwasniewski, Lukas Gianinazzi
GraphMineSuite: Enabling High-Performance and Programmable Graph Mining Algorithms with Set Algebra. Proc. VLDB Endow. 14(11): 1922-1936 (2021) - [j1]Barbara Geissmann, Lukas Gianinazzi:
Parallel Minimum Cuts in Near-linear Work and Low Depth. ACM Trans. Parallel Comput. 8(2): 8:1-8:20 (2021) - [c10]Maciej Besta, Raghavendra Kanakagiri, Grzegorz Kwasniewski, Rachata Ausavarungnirun, Jakub Beránek
SISA: Set-Centric Instruction Set Architecture for Graph Mining on Processing-in-Memory Systems. MICRO 2021: 282-297 - [c9]Lukas Gianinazzi
Parallel Algorithms for Finding Large Cliques in Sparse Graphs. SPAA 2021: 243-253 - [c8]Grzegorz Kwasniewski, Tal Ben-Nun, Lukas Gianinazzi
Pebbles, Graphs, and a Pinch of Combinatorics: Towards Tight I/O Lower Bounds for Statically Analyzable Programs. SPAA 2021: 328-339 - [i11]Maciej Besta, Zur Vonarburg-Shmaria, Yannick Schaffner, Leonardo Schwarz, Grzegorz Kwasniewski, Lukas Gianinazzi, Jakub Beránek, Kacper Janda, Tobias Holenstein, Sebastian Leisinger, Peter Tatkowski, Esref Özdemir, Adrian Balla, Marcin Copik, Philipp Lindenberger, Pavel Kalvoda, Marek Konieczny, Onur Mutlu, Torsten Hoefler:
GraphMineSuite: Enabling High-Performance and Programmable Graph Mining Algorithms with Set Algebra. CoRR abs/2103.03653 (2021) - [i10]Maciej Besta, Raghavendra Kanakagiri, Grzegorz Kwasniewski, Rachata Ausavarungnirun, Jakub Beránek, Konstantinos Kanellopoulos, Kacper Janda, Zur Vonarburg-Shmaria, Lukas Gianinazzi, Ioana Stefan, Juan Gómez-Luna, Marcin Copik, Lukas Kapp-Schwoerer, Salvatore Di Girolamo, Marek Konieczny, Onur Mutlu, Torsten Hoefler:
SISA: Set-Centric Instruction Set Architecture for Graph Mining on Processing-in-Memory Systems. CoRR abs/2104.07582 (2021) - [i9]Grzegorz Kwasniewski, Tal Ben-Nun, Lukas Gianinazzi, Alexandru Calotoiu, Timo Schneider, Alexandros Nikolaos Ziogas, Maciej Besta, Torsten Hoefler:
Pebbles, Graphs, and a Pinch of Combinatorics: Towards Tight I/O Lower Bounds for Statically Analyzable Programs. CoRR abs/2105.07203 (2021) - [i8]Maciej Besta, Raphael Grob, Cesare Miglioli, Nicola Bernold, Grzegorz Kwasniewski, Gabriel Gjini, Raghavendra Kanakagiri, Saleh Ashkboos, Lukas Gianinazzi, Nikoli Dryden, Torsten Hoefler:
Motif Prediction with Graph Neural Networks. CoRR abs/2106.00761 (2021) - [i7]Lukas Gianinazzi, Maximilian Fries, Nikoli Dryden, Tal Ben-Nun, Maciej Besta, Torsten Hoefler:
Learning Combinatorial Node Labeling Algorithms. CoRR abs/2106.03594 (2021) - [i6]Lukas Gianinazzi, Maciej Besta, Yannick Schaffner, Torsten Hoefler:
Parallel Algorithms for Finding Large Cliques in Sparse Graphs. CoRR abs/2109.09663 (2021) - 2020
- [c7]Maciej Besta, Armon Carigiet, Kacper Janda, Zur Vonarburg-Shmaria, Lukas Gianinazzi, Torsten Hoefler:
High-performance parallel graph coloring with strong guarantees on work, depth, and quality. SC 2020: 99 - [c6]Lukas Gianinazzi
Parallel Planar Subgraph Isomorphism and Vertex Connectivity. SPAA 2020: 269-280 - [i5]Lukas Gianinazzi, Torsten Hoefler:
Parallel Planar Subgraph Isomorphism and Vertex Connectivity. CoRR abs/2007.01199 (2020) - [i4]Maciej Besta, Armon Carigiet, Zur Vonarburg-Shmaria, Kacper Janda, Lukas Gianinazzi, Torsten Hoefler:
High-Performance Parallel Graph Coloring with Strong Guarantees on Work, Depth, and Quality. CoRR abs/2008.11321 (2020) - [i3]Tal Ben-Nun, Lukas Gianinazzi, Torsten Hoefler, Yishai Oltchik:
Parametric Graph Templates: Properties and Algorithms. CoRR abs/2011.07001 (2020)
2010 – 2019
- 2019
- [c5]Barbara Geissmann, Lukas Gianinazzi:
Routing in Stochastic Public Transit Networks. ATMOS 2019: 4:1-4:18 - [c4]Maciej Besta, Simon Weber
Slim graph: practical lossy graph compression for approximate graph processing, storage, and analytics. SC 2019: 35:1-35:25 - [i2]Maciej Besta, Simon Weber, Lukas Gianinazzi, Robert Gerstenberger, Andrey Ivanov, Yishai Oltchik, Torsten Hoefler:
Slim Graph: Practical Lossy Graph Compression for Approximate Graph Processing, Storage, and Analytics. CoRR abs/1912.08950 (2019) - 2018
- [c3]Lukas Gianinazzi
Communication-avoiding parallel minimum cuts and connected components. PPoPP 2018: 219-232 - [c2]Barbara Geissmann, Lukas Gianinazzi
Parallel Minimum Cuts in Near-linear Work and Low Depth. SPAA 2018: 1-11 - [i1]Barbara Geissmann, Lukas Gianinazzi:
Parallel Minimum Cuts in Near-linear Work and Low Depth. CoRR abs/1807.09524 (2018) - 2017
- [c1]Barbara Geissmann, Lukas Gianinazzi:
Cache Oblivious Minimum Cut. CIAC 2017: 285-296
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 22:21 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: