Search

Oded Green

Parallel Triangles and Squares Count for Multigraphs Using Vertex Covers
Scalable Katz Ranking Computation in Large Static and Dynamic Graphs
Anti-Section Transitive Closure
Using RAPIDS AI to Accelerate Graph Data Science Workflows
Performance Impact of Memory Channels on Sparse and Irregular Algorithms
Skip the Intersection: Quickly Counting Common Neighbors on Shared-Memory Systems
Fast and Adaptive List Intersections on the GPU
Hornet: An Efficient Data Structure for Dynamic Sparse Graphs and Matrices on GPUs
Logarithmic Radix Binning and Vectorized Triangle Counting
Scalable Katz Ranking Computation in Large Static and Dynamic Graphs
Design and implementation of parallel PageRank on multicore platforms
Exact and Parallel Triangle Counting in Dynamic Graphs
Quickly finding a truss in a haystack
cuSTINGER: Supporting dynamic graph algorithms for GPUs
Semantic database applications at the Samtavro Cemetery, Georgia
Load balanced clustering coefficients
A new parallel algorithm for connected components in dynamic graphs
Detecting insider threats in a real corporate database of computer usage activity
Faster Betweenness Centrality Based on Data Structure Experimentation
Faster Clustering Coefficient Using Vertex Covers
A Fast Algorithm for Streaming Betweenness Centrality
GPU Merge Path: A GPU Merging Algorithm

Published with Hugo Blox Builder — the free, open source website builder that empowers creators.