GPU merge path: a GPU merging algorithm. - Oded Green; Robert McColl; David A. Bader (ICS, 2012)

Merge Path - Parallel Merging Made Simple. - Saher Odeh; Oded Green; Zahi Mwassi; Oz Shmueli; Yitzhak Birk (IPDPS Workshops, 2012)

A Fast Algorithm for Streaming Betweenness Centrality. - Oded Green; Robert McColl; David A. Bader (SocialCom/PASSAT, 2012)

A new parallel algorithm for connected components in dynamic graphs. - Robert McColl; Oded Green; David A. Bader (HiPC, 2013)

Faster Betweenness Centrality Based on Data Structure Experimentation. - Oded Green; David A. Bader (ICCS, 2013)

Detecting insider threats in a real corporate database of computer usage activity. - Ted E. Senator; Henry G. Goldberg; Alex Memory; William T. Young; Brad Rees; Robert Pierce; Daniel Huang 003; Matthew Reardon; David A. Bader; Edmond Chow; Irfan A. Essa; Joshua Jones; et al. (KDD, 2013)

Scheduling directives for shared-memory many-core processor systems. - Oded Green; Yitzhak Birk (PMAM, 2013)

A computationally efficient algorithm for the 2D covariance method. - Oded Green; Yitzhak Birk (SC, 2013)

Faster Clustering Coefficient Using Vertex Covers. - Oded Green; David A. Bader (SocialCom, 2013)

Efficient Parallel Computation of the Estimated Covariance Matrix - Oded Green; Lior David; Ami Galperin; Yitzhak Birk (CoRR, 2013)

Load balanced clustering coefficients. - Oded Green; Lluís-Miquel Munguía; David A. Bader (PPAA@PPoPP, 2014)

When merging and branch predictors collide. - Oded Green (IA3@SC, 2014)

Fast triangle counting on the GPU. - Oded Green; Pavan Yalamanchili; Lluís-Miquel Munguía (IA3@SC, 2014)

Merge Path - A Visually Intuitive Approach to Parallel Merging. - Oded Green; Saher Odeh; Yitzhak Birk (CoRR, 2014)

A call for passion. - Oded Green; Yoav Green (XRDS, 2014)

Scheduling directives: Accelerating shared-memory many-core processor execution. - Oded Green; Yitzhak Birk (Parallel Comput., 2014)

High performance computing for irregular algorithms and applications with an emphasis on big data analytics. - Oded Green (2014)

Branch-Avoiding Graph Algorithms. - Oded Green; Marat Dukhan; Richard W. Vuduc (SPAA, 2015)

A Self-Correcting Connected Components Algorithm. - Piyush Sao; Oded Green; Chirag Jain; Richard W. Vuduc (FTXS@HPDC, 2016)

cuSTINGER: Supporting dynamic graph algorithms for GPUs. - Oded Green; David A. Bader (HPEC, 2016)

An Adaptive Parallel Algorithm for Computing Connectivity. - Chirag Jain; Patrick Flick; Tony Pan; Oded Green; Srinivas Aluru (CoRR, 2016)

Exact and Parallel Triangle Counting in Dynamic Graphs. - Devavret Makkar; David A. Bader; Oded Green (HiPC, 2017)

Quickly finding a truss in a haystack. - Oded Green; James Fox; Euna Kim; Federico Busato; Nicola Bombieri; Kartik Lakhotia; Shijie Zhou 001; Shreyas G. Singapura; Hanqing Zeng; Rajgopal Kannan; Viktor K. Prasanna; David A. Bader (HPEC, 2017)

Design and implementation of parallel PageRank on multicore platforms. - Shijie Zhou 001; Kartik Lakhotia; Shreyas G. Singapura; Hanqing Zeng; Rajgopal Kannan; Viktor K. Prasanna; James Fox; Euna Kim; Oded Green; David A. Bader (HPEC, 2017)

Parallelized Kendall's Tau Coefficient Computation via SIMD Vectorized Sorting On Many-Integrated-Core Processors. - Yongchao Liu; Tony Pan; Oded Green; Srinivas Aluru (CoRR, 2017)

An Adaptive Parallel Algorithm for Computing Connected Components. - Chirag Jain; Patrick Flick; Tony Pan; Oded Green; Srinivas Aluru (IEEE Trans. Parallel Distributed Syst., 2017)

Scalable K-Core Decomposition for Static Graphs Using a Dynamic Graph Data Structure. - Alok Tripathy; Fred Hohman; Duen Horng Chau; Oded Green (IEEE BigData, 2018)

Hornet: An Efficient Data Structure for Dynamic Sparse Graphs and Matrices on GPUs. - Federico Busato; Oded Green; Nicola Bombieri; David A. Bader (HPEC, 2018)

Fast and Adaptive List Intersections on the GPU. - James Fox; Oded Green; Kasimir Gabert; Xiaojing An; David A. Bader (HPEC, 2018)

Logarithmic Radix Binning and Vectorized Triangle Counting. - Oded Green; James Fox; Alex Watkins; Alok Tripathy; Kasimir Gabert; Euna Kim; Xiaojing An; Kumar Aatish; David A. Bader (HPEC, 2018)

Scaling Betweenness Centrality in Dynamic Graphs. - Alok Tripathy; Oded Green (HPEC, 2018)

A Fast and Simple Approach to Merge and Merge Sort Using Wide Vector Instructions. - Alex Watkins; Oded Green (IA3@SC, 2018)

Efficient Scalable Median Filtering Using Histogram-Based Operations. - Oded Green (IEEE Trans. Image Process., 2018)

Skip the Intersection: Quickly Counting Common Neighbors on Shared-Memory Systems. - Xiaojing An; Kasimir Gabert; James Fox; Oded Green; David A. Bader (HPEC, 2019)

Improving Scheduling for Irregular Applications with Logarithmic Radix Binning. - James Fox; Alok Tripathy; Oded Green (HPEC, 2019)

Performance Impact of Memory Channels on Sparse and Irregular Algorithms. - Oded Green; James Fox; Jeffrey Young 001; Jun Shirako; David A. Bader (IA3@SC, 2019)

Self-stabilizing Connected Components. - Piyush Sao; Christian Engelmann; Srinivas Eswar; Oded Green; Richard W. Vuduc (FTXS@SC, 2019)

Approximately and Efficiently Estimating Dynamic Point-to-Point Shortest Path. - Alok Tripathy; Oded Green (IEEE BigData, 2020)

Using RAPIDS AI to Accelerate Graph Data Science Workflows. - Todd Hricik; David A. Bader; Oded Green (HPEC, 2020)

Anti-Section Transitive Closure. - Oded Green; Zhihui Du; Sanyamee Patel; Zehui Xie; Hang Liu; David A. Bader (HiPC, 2021)

Inverse-Deletion BFS - Revisiting Static Graph BFS Traversals with Dynamic Graph Operations. - Oded Green (HPEC, 2021)

ButterFly BFS - An Efficient Communication Pattern for Multi Node Traversals. - Oded Green (CoRR, 2021)

Scalable Hash Table for NUMA Systems. - Alok Tripathy; Oded Green (CoRR, 2021)

HashGraph - Scalable Hash Tables Using a Sparse Graph Data Structure. - Oded Green (ACM Trans. Parallel Comput., 2021)

Generating Permutations Using Hash Tables. - Oded Green; Corey Nolet; Joe Eaton (HPEC, 2022)

Accelerating Datalog applications with cuDF. - Ahmedur Rahman Shovon; Landon Richard Dyken; Oded Green; Thomas Gilray; Sidharth Kumar (IA3@SC, 2022)

Scalable Katz Ranking Computation in Large Static and Dynamic Graphs. - Alexander van der Grinten; Elisabetta Bergamini; Oded Green; David A. Bader; Henning Meyerhenke (ACM J. Exp. Algorithmics, 2022)

Parallel Triangles and Squares Count for Multigraphs Using Vertex Covers. - Luca Cappelletti; Tommaso Fontana; Oded Green; David A. Bader (ICCS (4), 2023)