20 citations · 21 across the 4 of their papers we have counts for
Showing cs.DSShow all
3 papers · 1 filter
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.DS2018
Scalable Katz Ranking Computation in Large Static and Dynamic Graphs
Alexander van der Grinten, Elisabetta Bergamini, Oded Green +2
Network analysis defines a number of centrality measures to identify the most central nodes in a network. Fast computation of those measures is a major challenge in algorithmic net…
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…