1 citations · 1 across the 1 of their papers we have counts for
3 papers
cs.DC2019
Performance Impact of Memory Channels on Sparse and Irregular Algorithms
Oded Green, James Fox, Jeffrey Young +2
Graph processing is typically considered to be a memory-bound rather than compute-bound problem. One common line of thought is that more available memory bandwidth corresponds to b…
cs.DS2019
HashGraph -- Scalable Hash Tables Using A Sparse Graph Data Structure
Oded Green
Hash tables are ubiquitous and used in a wide range of applications for efficient probing of large and unsorted data. If designed properly, hash-tables can enable efficients look u…
cs.DS2013★ 1 cited
Efficient Parallel Computation of the Estimated Covariance Matrix
Oded Green, Lior David, Ami Galperin +1
Computation of a signal's estimated covariance matrix is an important building block in signal processing, e.g., for spectral estimation. Each matrix element is a sum of products o…