| Detecting insider threats in a real corporate database of computer usage activity E Ted, HG Goldberg, A Memory, WT Young, B Rees, R Pierce, D Huang, ... 19th ACM SIGKDD international conference on Knowledge discovery and data …, 2013 | 197 | 2013 |
| Gpu merge path: a gpu merging algorithm O Green, R McColl, DA Bader 26th ACM international conference on Supercomputing, 331-340, 2012 | 183 | 2012 |
| A Fast Algorithm for Streaming Betweenness Centrality O Green, R McColl, DA Bader International Conference on Social Computing (SocialCom), 11 - 20, 2012 | 147 | 2012 |
| Hornet: An Efficient Data Structure for Dynamic Sparse Graphs and Matrices on GPUs F Busato, O Green, N Bombieri, DA Bader IEEE Proc. High Performance Extreme Computing (HPEC), Waltham, MA, 2018 | 138 | 2018 |
| cuSTINGER: Supporting Dynamic Graph Algorithms for GPUs O Green, D Bader IEEE High Performance Extreme Computing Conference, 2016 | 105 | 2016 |
| Fast triangle counting on the GPU O Green, P Yalamanchili, LM Munguía 2014 4th Workshop on Irregular Applications: Architectures and Algorithms …, 2014 | 91 | 2014 |
| Merge path-parallel merging made simple S Odeh, O Green, Z Mwassi, O Shmueli, Y Birk Parallel and Distributed Processing Symposium Workshops & PhD Forum (IPDPSW …, 2012 | 83* | 2012 |
| Faster Betweenness Centrality Based on Data Structure Experimentation O Green, DA Bader International Conference on Computational Science 18, 399-408, 2013 | 62 | 2013 |
| A New Parallel Algorithm for Connected Components in Dynamic Graphs R McColl, O Green, D Bader IEEE International Conference on High Performance Computing, 2013 | 61 | 2013 |
| Efficient Scalable Median Filtering Using Histogram-Based Operations O Green IEEE Transactions on Image Processing 27 (5), 2217-2228, 2018 | 43 | 2018 |
| An Adaptive Parallel Algorithm for Computing Connected Components C Jain, P Flick, T Pan, O Green, S Aluru IEEE Transactions on Parallel and Distributed Systems 28 (9), 2428-2439, 2017 | 38 | 2017 |
| Fast and Adaptive List Intersections on the GPU J Fox, O Green, K Gabert, X An, DA Bader 2018 IEEE High Performance extreme Computing Conference (HPEC), 1-7, 2018 | 37 | 2018 |
| Load Balanced Clustering Coefficients O Green, LM Munguia, DA Bader ACM Workshop on Parallel Programming for Analytics Applications (PPAA), 2014 | 33 | 2014 |
| Exact and Parallel Triangle Counting in Dynamic Graphs D Makkar, DA Bader, O Green 2017 IEEE 24th International Conference on High Performance Computing (HiPC …, 2017 | 31 | 2017 |
| Branch Avoiding Graph Algorithms O Green, M Dukhan, R Vucuc 27th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), 2015 | 30 | 2015 |
| Faster Clustering Coefficient Using Vertex Covers O Green, DA Bader International Conference on Social Computing (SocialCom), 2013 | 30 | 2013 |
| Quickly Finding a k-Truss in a Haystack O Green, J Fox, E Kim, F Busato, N Bombieri, K Lakhotia, S Zhou, ... IEEE High Performance Extreme Computing Conference (HPEC), 2017 | 29 | 2017 |
| Design and implementation of parallel PageRank on multicore platforms S Zhou, K Lakhotia, SG Singapura, H Zeng, R Kannan, VK Prasanna, ... High Performance Extreme Computing Conference (HPEC), 2017 IEEE, 1-6, 2017 | 28 | 2017 |
| HashGraph—Scalable Hash Tables Using a Sparse Graph Data Structure O Green ACM Transactions on Parallel Computing (TOPC) 8 (2), 1-17, 2021 | 26 | 2021 |
| Logarithmic Radix Binning and Vectorized Triangle Counting O Green, J Fox, A Watkins, A Tripathy, K Gabert, E Kim, X An, K Aatish, ... IEEE Proc. High Performance Extreme Computing (HPEC), Waltham, MA, 2018 | 26 | 2018 |
David A. BaderDistinguished Professor, New Jersey Institute of TechnologyVerified email at njit.edu
