16 citations · 57 across the 26 of their papers we have counts for
Showing cs.CCShow all
2 papers · 1 filter
cs.CC2017
On Optimal Trees for Irregular Gather and Scatter Collectives
Jesper Larsson Träff
We study the complexity of finding communication trees with the lowest possible completion time for rooted, irregular gather and scatter collective communication operations in full…
cs.CC2015
The Shortest Path Problem with Edge Information Reuse is NP-Complete
Jesper Larsson Träff
We show that the following variation of the single-source shortest path problem is NP-complete. Let a weighted, directed, acyclic graph with source and sink vertices $s…