Oded Green

Latest

• Scalable Hash Table for NUMA Systems
• Accurately and Efficiently Estimating Dynamic Point-to-Point Shortest Path
• Improving Scheduling for Irregular Applications with Logarithmic Radix Binning
• Scalable K-Core Decomposition for Static Graphs Using a Dynamic Graph Data Structure
• Logarithmic Radix Binning and Vectorized Triangle Counting
• Scaling Betweenness Centrality in Dynamic Graphs