Oded Green

Corey Nolet

Joe Eaton

Proceedings of the IEEE High Performance Extreme Computing Conference, 2022

2021

HashGraph - Scalable Hash Tables Using a Sparse Graph Data Structure.

[BibT_eX]

[DOI]

ACM Trans. Parallel Comput., 2021

Scalable Hash Table for NUMA Systems.

[BibT_eX]

[DOI]

CoRR, 2021

ButterFly BFS - An Efficient Communication Pattern for Multi Node Traversals.

[BibT_eX]

[DOI]

CoRR, 2021

Inverse-Deletion BFS - Revisiting Static Graph BFS Traversals with Dynamic Graph Operations.

[BibT_eX]

[DOI]

Proceedings of the 2021 IEEE High Performance Extreme Computing Conference, 2021

Anti-Section Transitive Closure.

[BibT_eX]

[DOI]

Proceedings of the 28th IEEE International Conference on High Performance Computing, 2021

2020

Using RAPIDS AI to Accelerate Graph Data Science Workflows.

[BibT_eX]

[DOI]

Todd Hricik

Proceedings of the 2020 IEEE High Performance Extreme Computing Conference, 2020

Approximately and Efficiently Estimating Dynamic Point-to-Point Shortest Path.

[BibT_eX]

[DOI]

Proceedings of the 2020 IEEE International Conference on Big Data (IEEE BigData 2020), 2020

2019

Self-stabilizing Connected Components.

[BibT_eX]

[DOI]

Proceedings of the 9th IEEE/ACM Workshop on Fault Tolerance for HPC at eXtreme Scale, 2019

Performance Impact of Memory Channels on Sparse and Irregular Algorithms.

[BibT_eX]

[DOI]

Proceedings of the 9th IEEE/ACM Workshop on Irregular Applications: Architectures and Algorithms, 2019

Improving Scheduling for Irregular Applications with Logarithmic Radix Binning.

[BibT_eX]

[DOI]

James Fox

Proceedings of the 2019 IEEE High Performance Extreme Computing Conference, 2019

Skip the Intersection: Quickly Counting Common Neighbors on Shared-Memory Systems.

[BibT_eX]

[DOI]

Proceedings of the 2019 IEEE High Performance Extreme Computing Conference, 2019

2018

Efficient Scalable Median Filtering Using Histogram-Based Operations.

[BibT_eX]

[DOI]

IEEE Trans. Image Process., 2018

A Fast and Simple Approach to Merge and Merge Sort Using Wide Vector Instructions.

[BibT_eX]

[DOI]

Alex Watkins

Proceedings of the 8th IEEE/ACM Workshop on Irregular Applications: Architectures and Algorithms, 2018

Scaling Betweenness Centrality in Dynamic Graphs.

[BibT_eX]

[DOI]

Proceedings of the 2018 IEEE High Performance Extreme Computing Conference, 2018

Logarithmic Radix Binning and Vectorized Triangle Counting.

[BibT_eX]

[DOI]

Proceedings of the 2018 IEEE High Performance Extreme Computing Conference, 2018

Fast and Adaptive List Intersections on the GPU.

[BibT_eX]

[DOI]

Proceedings of the 2018 IEEE High Performance Extreme Computing Conference, 2018

Hornet: An Efficient Data Structure for Dynamic Sparse Graphs and Matrices on GPUs.

[BibT_eX]

[DOI]

Proceedings of the 2018 IEEE High Performance Extreme Computing Conference, 2018

Scalable K-Core Decomposition for Static Graphs Using a Dynamic Graph Data Structure.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Conference on Big Data (IEEE BigData 2018), 2018

2017

An Adaptive Parallel Algorithm for Computing Connected Components.

[BibT_eX]

[DOI]

IEEE Trans. Parallel Distributed Syst., 2017

Parallelized Kendall's Tau Coefficient Computation via SIMD Vectorized Sorting On Many-Integrated-Core Processors.

[BibT_eX]

[DOI]

CoRR, 2017

Design and implementation of parallel PageRank on multicore platforms.

[BibT_eX]

[DOI]

Proceedings of the 2017 IEEE High Performance Extreme Computing Conference, 2017

Quickly finding a truss in a haystack.

[BibT_eX]

[DOI]

Proceedings of the 2017 IEEE High Performance Extreme Computing Conference, 2017

Exact and Parallel Triangle Counting in Dynamic Graphs.

[BibT_eX]

[DOI]

Devavret Makkar

Proceedings of the 24th IEEE International Conference on High Performance Computing, 2017

2016

An Adaptive Parallel Algorithm for Computing Connectivity.

[BibT_eX]

[DOI]

CoRR, 2016

cuSTINGER: Supporting dynamic graph algorithms for GPUs.

[BibT_eX]

[DOI]

Proceedings of the 2016 IEEE High Performance Extreme Computing Conference, 2016

A Self-Correcting Connected Components Algorithm.

[BibT_eX]

[DOI]

Proceedings of the ACM Workshop on Fault-Tolerance for HPC at Extreme Scale, 2016

2015

Branch-Avoiding Graph Algorithms.

[BibT_eX]

[DOI]

Marat Dukhan

Richard W. Vuduc

Proceedings of the 27th ACM on Symposium on Parallelism in Algorithms and Architectures, 2015

2014

High performance computing for irregular algorithms and applications with an emphasis on big data analytics.

[BibT_eX]

[DOI]

PhD thesis, 2014

Scheduling directives: Accelerating shared-memory many-core processor execution.

[BibT_eX]

[DOI]

Parallel Comput., 2014

A call for passion.

[BibT_eX]

[DOI]

Yoav Green

XRDS, 2014

Merge Path - A Visually Intuitive Approach to Parallel Merging.

[BibT_eX]

[DOI]

Saher Odeh

CoRR, 2014

Fast triangle counting on the GPU.

[BibT_eX]

[DOI]

Pavan Yalamanchili

Lluís-Miquel Munguía

Proceedings of the Fourth Workshop on Irregular Applications, 2014

When merging and branch predictors collide.

[BibT_eX]

[DOI]

Proceedings of the Fourth Workshop on Irregular Applications, 2014

Load balanced clustering coefficients.

[BibT_eX]

[DOI]

Lluís-Miquel Munguía

Proceedings of the first workshop on Parallel programming for analytics applications, 2014

2013

Efficient Parallel Computation of the Estimated Covariance Matrix

[BibT_eX]

[DOI]

CoRR, 2013

Faster Clustering Coefficient Using Vertex Covers.

[BibT_eX]

[DOI]

Proceedings of the International Conference on Social Computing, SocialCom 2013, 2013

A computationally efficient algorithm for the 2D covariance method.

[BibT_eX]

[DOI]

Proceedings of the International Conference for High Performance Computing, 2013

Scheduling directives for shared-memory many-core processor systems.

[BibT_eX]

[DOI]

Proceedings of the 2013 PPOPP International Workshop on Programming Models and Applications for Multicores and Manycores, 2013

Detecting insider threats in a real corporate database of computer usage activity.

[BibT_eX]

[DOI]

Proceedings of the 19th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, 2013

Faster Betweenness Centrality Based on Data Structure Experimentation.

[BibT_eX]

[DOI]

Proceedings of the International Conference on Computational Science, 2013

A new parallel algorithm for connected components in dynamic graphs.

[BibT_eX]

[DOI]

Robert McColl

Proceedings of the 20th Annual International Conference on High Performance Computing, 2013

2012

A Fast Algorithm for Streaming Betweenness Centrality.

[BibT_eX]

[DOI]

Robert McColl

Proceedings of the 2012 International Conference on Privacy, 2012

Merge Path - Parallel Merging Made Simple.

[BibT_eX]

[DOI]

Proceedings of the 26th IEEE International Parallel and Distributed Processing Symposium Workshops & PhD Forum, 2012

GPU merge path: a GPU merging algorithm.

[BibT_eX]

[DOI]

Robert McColl