activity
20182024
most citedSparsity in Deep Learning: Pruning and growth for efficient inference and training in neural networks

341 citations · 465 across the 18 of their papers we have counts for

collaborators
Showing cs.DSShow all

2 papers · 1 filter

cs.DS2023

Maximum Flows in Parametric Graph Templates

Tal Ben-Nun, Lukas Gianinazzi, Torsten Hoefler +1

Execution graphs of parallel loop programs exhibit a nested, repeating structure. We show how such graphs that are the result of nested repetition can be represented by succinct pa…

cs.DS2020★ 1 cited

Parametric Graph Templates: Properties and Algorithms

Tal Ben-Nun, Lukas Gianinazzi, Torsten Hoefler +1

Hierarchical structure and repetition are prevalent in graphs originating from nature or engineering. These patterns can be represented by a class of parametric-structure graphs, w…