default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDOded Green
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Books and Theses
- 2014
[b1]Oded Green:
High performance computing for irregular algorithms and applications with an emphasis on big data analytics. Georgia Institute of Technology, Atlanta, GA, USA, 2014
Journal Articles
- 2022
- [j6]Alexander van der Grinten
, Elisabetta Bergamini, Oded Green, David A. Bader, Henning Meyerhenke:
Scalable Katz Ranking Computation in Large Static and Dynamic Graphs. ACM J. Exp. Algorithmics 27: 1.7:1-1.7:16 (2022) - 2021
- [j5]Oded Green:
HashGraph - Scalable Hash Tables Using a Sparse Graph Data Structure. ACM Trans. Parallel Comput. 8(2): 11:1-11:17 (2021) - 2018
- [j4]Oded Green:
Efficient Scalable Median Filtering Using Histogram-Based Operations. IEEE Trans. Image Process. 27(5): 2217-2228 (2018) - 2017
- [j3]Chirag Jain, Patrick Flick, Tony Pan, Oded Green, Srinivas Aluru:
An Adaptive Parallel Algorithm for Computing Connected Components. IEEE Trans. Parallel Distributed Syst. 28(9): 2428-2439 (2017) - 2014
- [j2]Oded Green, Yoav Green:
A call for passion. XRDS 21(1): 11 (2014) - [j1]Oded Green, Yitzhak Birk:
Scheduling directives: Accelerating shared-memory many-core processor execution. Parallel Comput. 40(2): 90-106 (2014)
Conference and Workshop Papers
- 2023
- [c36]Luca Cappelletti, Tommaso Fontana, Oded Green, David A. Bader:
Parallel Triangles and Squares Count for Multigraphs Using Vertex Covers. ICCS (4) 2023: 635-646 - 2022
- [c35]Oded Green, Corey Nolet, Joe Eaton:
Generating Permutations Using Hash Tables. HPEC 2022: 1-7 - [c34]Ahmedur Rahman Shovon, Landon Richard Dyken, Oded Green, Thomas Gilray, Sidharth Kumar:
Accelerating Datalog applications with cuDF. IA3@SC 2022: 41-45 - 2021
- [c33]Oded Green, Zhihui Du, Sanyamee Patel, Zehui Xie, Hang Liu, David A. Bader:
Anti-Section Transitive Closure. HiPC 2021: 192-201 - [c32]Oded Green:
Inverse-Deletion BFS - Revisiting Static Graph BFS Traversals with Dynamic Graph Operations. HPEC 2021: 1-7 - 2020
- [c31]Alok Tripathy, Oded Green:
Approximately and Efficiently Estimating Dynamic Point-to-Point Shortest Path. IEEE BigData 2020: 3015-3024 - [c30]Todd Hricik, David A. Bader, Oded Green:
Using RAPIDS AI to Accelerate Graph Data Science Workflows. HPEC 2020: 1-4 - 2019
- [c29]Xiaojing An, Kasimir Gabert, James Fox, Oded Green, David A. Bader:
Skip the Intersection: Quickly Counting Common Neighbors on Shared-Memory Systems. HPEC 2019: 1-7 - [c28]James Fox, Alok Tripathy, Oded Green:
Improving Scheduling for Irregular Applications with Logarithmic Radix Binning. HPEC 2019: 1-7 - [c27]Piyush Sao, Christian Engelmann, Srinivas Eswar, Oded Green, Richard W. Vuduc:
Self-stabilizing Connected Components. FTXS@SC 2019: 50-59 - [c26]Oded Green, James Fox, Jeffrey Young, Jun Shirako, David A. Bader:
Performance Impact of Memory Channels on Sparse and Irregular Algorithms. IA3@SC 2019: 67-70 - 2018
- [c25]Alok Tripathy, Fred Hohman, Duen Horng Chau, Oded Green:
Scalable K-Core Decomposition for Static Graphs Using a Dynamic Graph Data Structure. IEEE BigData 2018: 1134-1141 - [c24]Alexander van der Grinten, Elisabetta Bergamini, Oded Green, David A. Bader, Henning Meyerhenke:
Scalable Katz Ranking Computation in Large Static and Dynamic Graphs. ESA 2018: 42:1-42:14 - [c23]Federico Busato, Oded Green, Nicola Bombieri, David A. Bader:
Hornet: An Efficient Data Structure for Dynamic Sparse Graphs and Matrices on GPUs. HPEC 2018: 1-7 - [c22]James Fox, Oded Green, Kasimir Gabert, Xiaojing An, David A. Bader:
Fast and Adaptive List Intersections on the GPU. HPEC 2018: 1-7 - [c21]Oded Green, James Fox, Alex Watkins, Alok Tripathy, Kasimir Gabert, Euna Kim, Xiaojing An, Kumar Aatish, David A. Bader:
Logarithmic Radix Binning and Vectorized Triangle Counting. HPEC 2018: 1-7 - [c20]Alok Tripathy, Oded Green:
Scaling Betweenness Centrality in Dynamic Graphs. HPEC 2018: 1-7 - [c19]Alex Watkins, Oded Green:
A Fast and Simple Approach to Merge and Merge Sort Using Wide Vector Instructions. IA3@SC 2018: 37-44 - 2017
- [c18]Devavret Makkar, David A. Bader, Oded Green:
Exact and Parallel Triangle Counting in Dynamic Graphs. HiPC 2017: 2-12 - [c17]Oded Green, James Fox, Euna Kim, Federico Busato, Nicola Bombieri, Kartik Lakhotia, Shijie Zhou, Shreyas G. Singapura, Hanqing Zeng, Rajgopal Kannan, Viktor K. Prasanna, David A. Bader:
Quickly finding a truss in a haystack. HPEC 2017: 1-7 - [c16]Shijie Zhou, Kartik Lakhotia, Shreyas G. Singapura, Hanqing Zeng, Rajgopal Kannan, Viktor K. Prasanna, James Fox, Euna Kim, Oded Green, David A. Bader:
Design and implementation of parallel PageRank on multicore platforms. HPEC 2017: 1-6 - 2016
- [c15]Piyush Sao, Oded Green, Chirag Jain, Richard W. Vuduc:
A Self-Correcting Connected Components Algorithm. FTXS@HPDC 2016: 9-16 - [c14]Oded Green, David A. Bader:
cuSTINGER: Supporting dynamic graph algorithms for GPUs. HPEC 2016: 1-6 - 2015
- [c13]Oded Green, Marat Dukhan, Richard W. Vuduc:
Branch-Avoiding Graph Algorithms. SPAA 2015: 212-223 - 2014
- [c12]Oded Green, Lluís-Miquel Munguía, David A. Bader:
Load balanced clustering coefficients. PPAA@PPoPP 2014: 3-10 - [c11]Oded Green, Pavan Yalamanchili, Lluís-Miquel Munguía:
Fast triangle counting on the GPU. IA3@SC 2014: 1-8 - [c10]Oded Green:
When merging and branch predictors collide. IA3@SC 2014: 33-40 - 2013
- [c9]Robert McColl, Oded Green, David A. Bader:
A new parallel algorithm for connected components in dynamic graphs. HiPC 2013: 246-255 - [c8]Oded Green, David A. Bader:
Faster Betweenness Centrality Based on Data Structure Experimentation. ICCS 2013: 399-408 - [c7]Ted E. Senator, Henry G. Goldberg, Alex Memory, William T. Young, Brad Rees, Robert Pierce, Daniel Huang, Matthew Reardon, David A. Bader, Edmond Chow, Irfan A. Essa, Joshua Jones, Vinay Bettadapura, Duen Horng Chau, Oded Green, Oguz Kaya, Anita Zakrzewska, Erica Briscoe, Rudolph L. Mappus IV, Robert McColl, Lora Weiss, Thomas G. Dietterich, Alan Fern, Weng-Keen Wong, Shubhomoy Das, Andrew Emmott, Jed Irvine, Jay Yoon Lee, Danai Koutra, Christos Faloutsos, Daniel D. Corkill, Lisa Friedland, Amanda Gentzel, David D. Jensen:
Detecting insider threats in a real corporate database of computer usage activity. KDD 2013: 1393-1401 - [c6]Oded Green, Yitzhak Birk:
Scheduling directives for shared-memory many-core processor systems. PMAM 2013: 115-124 - [c5]Oded Green, Yitzhak Birk:
A computationally efficient algorithm for the 2D covariance method. SC 2013: 89:1-89:12 - [c4]Oded Green, David A. Bader:
Faster Clustering Coefficient Using Vertex Covers. SocialCom 2013: 321-330 - 2012
- [c3]Oded Green, Robert McColl, David A. Bader:
GPU merge path: a GPU merging algorithm. ICS 2012: 331-340 - [c2]Saher Odeh, Oded Green, Zahi Mwassi, Oz Shmueli, Yitzhak Birk:
Merge Path - Parallel Merging Made Simple. IPDPS Workshops 2012: 1611-1618 - [c1]Oded Green, Robert McColl, David A. Bader:
A Fast Algorithm for Streaming Betweenness Centrality. SocialCom/PASSAT 2012: 11-20
Informal and Other Publications
- 2021
- [i10]Oded Green:
ButterFly BFS - An Efficient Communication Pattern for Multi Node Traversals. CoRR abs/2103.13577 (2021) - [i9]Alok Tripathy, Oded Green:
Scalable Hash Table for NUMA Systems. CoRR abs/2104.00792 (2021) - 2019
- [i8]Oded Green:
HashGraph - Scalable Hash Tables Using A Sparse Graph Data Structure. CoRR abs/1907.02900 (2019) - [i7]Oded Green, James Fox, Jeffrey Young, Jun Shirako, David A. Bader:
Performance Impact of Memory Channels on Sparse and Irregular Algorithms. CoRR abs/1910.03679 (2019) - 2018
- [i6]Alexander van der Grinten, Elisabetta Bergamini, Oded Green, David A. Bader, Henning Meyerhenke:
Scalable Katz Ranking Computation in Large Static and Dynamic Graphs. CoRR abs/1807.03847 (2018) - 2017
- [i5]Yongchao Liu, Tony Pan, Oded Green, Srinivas Aluru:
Parallelized Kendall's Tau Coefficient Computation via SIMD Vectorized Sorting On Many-Integrated-Core Processors. CoRR abs/1704.03767 (2017) - 2016
- [i4]Chirag Jain, Patrick Flick, Tony Pan, Oded Green, Srinivas Aluru:
An Adaptive Parallel Algorithm for Computing Connectivity. CoRR abs/1607.06156 (2016) - 2014
- [i3]Oded Green, Saher Odeh, Yitzhak Birk:
Merge Path - A Visually Intuitive Approach to Parallel Merging. CoRR abs/1406.2628 (2014) - [i2]Oded Green, Marat Dukhan, Richard W. Vuduc:
Branch-Avoiding Graph Algorithms. CoRR abs/1411.1460 (2014) - 2013
- [i1]Oded Green, Lior David, Ami Galperin, Yitzhak Birk:
Efficient Parallel Computation of the Estimated Covariance Matrix. CoRR abs/1303.2285 (2013)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-11-07 21:35 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
