32 citations · 50 across the 13 of their papers we have counts for
3 papers · 1 filter
A parallel priority queue with fast updates for GPU architectures
Kyle Berney, John Iacono, Ben Karsin +1
The single-source shortest path (SSSP) problem is a well-studied problem that is used in many applications. In the parallel setting, a work-efficient algorithm that additionally at…
Locality
Peyman Afshani, John Iacono, Varunkumar Jayapaul +2
The program performance on modern hardware is characterized by \emph{locality of reference}, that is, it is faster to access data that is close in address space to data that has be…
Fragile Complexity of Comparison-Based Algorithms
Peyman Afshani, Rolf Fagerberg, David Hammer +5
We initiate a study of algorithms with a focus on the computational complexity of individual elements, and introduce the fragile complexity of comparison-based algorithms as the ma…