Search Results - Green, Oded

Refine Results
  1. 1
    Efficient Scalable Median Filtering Using Histogram-Based Operations

    Efficient Scalable Median Filtering Using Histogram-Based Operations by Green, Oded

    Get full text
    Items that this one cites
    Items that cite this one
    Article
    Save to List
    Saved in:
  2. 2
    HashGraph—Scalable Hash Tables Using a Sparse Graph Data Structure

    HashGraph—Scalable Hash Tables Using a Sparse Graph Data Structure by Green, Oded

    Get full text
    Items that this one cites
    Items that cite this one
    Article
    Save to List
    Saved in:
  3. 3
    An Adaptive Parallel Algorithm for Computing Connected Components

    An Adaptive Parallel Algorithm for Computing Connected Components by Jain, Chirag, Flick, Patrick, Pan, Tony, Green, Oded, Aluru, Srinivas

    Get full text
    Items that this one cites
    Items that cite this one
    Article
    Save to List
    Saved in:
  4. 4
    Faster Betweenness Centrality Based on Data Structure Experimentation

    Faster Betweenness Centrality Based on Data Structure Experimentation by Green, Oded, Bader, David A.

    Get full text
    Items that this one cites
    Items that cite this one
    Article
    Save to List
    Saved in:
  5. 5
    Scheduling directives: Accelerating shared-memory many-core processor execution

    Scheduling directives: Accelerating shared-memory many-core processor execution by Green, Oded, Birk, Yitzhak

    Published in Parallel computing
    Get full text
    Items that this one cites
    Article
    Save to List
    Saved in:
  6. 6
    Scalable Katz Ranking Computation in Large Static and Dynamic Graphs

    Scalable Katz Ranking Computation in Large Static and Dynamic Graphs by Grinten van der, Alexander, Bergamini, Elisabetta, Green, Oded, Bader, David A., Meyerhenke, Henning

    Get full text
    Items that this one cites
    Article
    Save to List
    Saved in:
  7. 7
    A Fast Algorithm for Streaming Betweenness Centrality

    A Fast Algorithm for Streaming Betweenness Centrality by Green, O., McColl, R., Bader, D. A.

    Request full text
    Items that cite this one
    Conference Proceeding
    Save to List
    Saved in:
  8. 8
    A new parallel algorithm for connected components in dynamic graphs

    A new parallel algorithm for connected components in dynamic graphs by McColl, Robert, Green, Oded, Bader, David A.

    Request full text
    Conference Proceeding
    Save to List
    Saved in:
  9. 9
    Anti-Section Transitive Closure

    Anti-Section Transitive Closure by Green, Oded, Du, Zhihui, Patel, Sanyamee, Xie, Zehui, Liu, Hang, Bader, David A.

    Request full text
    Conference Proceeding
    Save to List
    Saved in:
  10. 10
    ButterFly BFS -- An Efficient Communication Pattern for Multi Node Traversals

    ButterFly BFS -- An Efficient Communication Pattern for Multi Node Traversals by Green, Oded

    Published in arXiv.org
    Get full text
    Article
    Save to List
    Saved in:
  11. 11
    HashGraph -- Scalable Hash Tables Using A Sparse Graph Data Structure

    HashGraph -- Scalable Hash Tables Using A Sparse Graph Data Structure by Green, Oded

    Published in arXiv.org
    Get full text
    Article
    Save to List
    Saved in:
  12. 12
    When Merging and Branch Predictors Collide

    When Merging and Branch Predictors Collide by Green, Oded

    Request full text
    Conference Proceeding
    Save to List
    Saved in:
  13. 13
    Scalable Hash Table for NUMA Systems

    Scalable Hash Table for NUMA Systems by Tripathy, Alok, Green, Oded

    Published in arXiv.org
    Get full text
    Article
    Save to List
    Saved in:
  14. 14
    Accelerating Datalog applications with cuDF

    Accelerating Datalog applications with cuDF by Shovon, Ahmedur Rahman, Dyken, Landon Richard, Green, Oded, Gilray, Thomas, Kumar, Sidharth

    Request full text
    Conference Proceeding
    Save to List
    Saved in:
  15. 15
    A call for passion

    A call for passion by Green, Oded, Green, Yoav

    Get full text
    Article
    Save to List
    Saved in:
  16. 16
    A computationally efficient algorithm for the 2D covariance method

    A computationally efficient algorithm for the 2D covariance method by Green, Oded, Birk, Yitzhak

    Request full text
    Conference Proceeding
    Save to List
    Saved in:
  17. 17
    Merge Path - Parallel Merging Made Simple

    Merge Path - Parallel Merging Made Simple by Odeh, S., Green, O., Mwassi, Z., Shmueli, O., Birk, Y.

    Request full text
    Conference Proceeding
    Save to List
    Saved in:
  18. 18
    Fast Triangle Counting on the GPU

    Fast Triangle Counting on the GPU by Green, Oded, Yalamanchili, Pavan, Munguia, Lluis-Miquel

    Request full text
    Conference Proceeding
    Save to List
    Saved in:
  19. 19
    Performance Impact of Memory Channels on Sparse and Irregular Algorithms

    Performance Impact of Memory Channels on Sparse and Irregular Algorithms by Green, Oded, Fox, James, Young, Jeffrey, Shirako, Jun, Bader, David

    Published in arXiv.org
    Get full text
    Article
    Save to List
    Saved in:
  20. 20
    Parallelized Kendall's Tau Coefficient Computation via SIMD Vectorized Sorting On Many-Integrated-Core Processors

    Parallelized Kendall's Tau Coefficient Computation via SIMD Vectorized Sorting On Many-Integrated-Core Processors by Liu, Yongchao, Pan, Tony, Green, Oded, Aluru, Srinivas

    Published in arXiv.org
    Get full text
    Article
    Save to List
    Saved in:

Search Tools: