175 results on '"Bader, David A."'
Search Results
2. Fast Triangle Counting
3. Property Graphs in Arachne
4. Triangle Counting Through Cover-Edges
5. Billion-scale Detection of Isomorphic Nodes
6. High-Performance Truss Analytics in Arkouda
7. Arachne: An Arkouda Package for Large-Scale Graph Analytics
8. Anti-Section Transitive Closure
9. A GraphBLAS Implementation of Triangle Centrality
10. Enabling Exploratory Large Scale Graph Analytics through Arkouda
11. Large Scale String Analytics in Arkouda
12. LAGraph: Linear Algebra, Network Analysis Libraries, and the Study of Graph Algorithms
13. Using RAPIDS AI to Accelerate Graph Data Science Workflows
14. An Efficient LP Rounding Scheme for Replica Placement
15. GPU Accelerated Anomaly Detection of Large Scale Light Curves
16. Performance Impact of Memory Channels on Sparse and Irregular Algorithms
17. Skip the Intersection: Quickly Counting Common Neighbors on Shared-Memory Systems
18. Linux and Supercomputing: How My Passion for Building COTS Systems Led to an HPC Revolution.
19. Hornet: An Efficient Data Structure for Dynamic Sparse Graphs and Matrices on GPUs
20. Fast and Adaptive List Intersections on the GPU
21. Logarithmic Radix Binning and Vectorized Triangle Counting
22. Introduction to HiCOMB 2018
23. Exact and Parallel Triangle Counting in Dynamic Graphs
24. Quickly finding a truss in a haystack
25. Design and implementation of parallel PageRank on multicore platforms
26. Introduction to EMBRACE Workshop
27. cuSTINGER: Supporting dynamic graph algorithms for GPUs
28. Mathematical foundations of the GraphBLAS
29. New stopping criteria for spectral partitioning
30. Aging data in dynamic graphs: A comparative study
31. A local measure of community change in dynamic graphs
32. A Memory and Time Scalable Parallelization of the Reptile Error-Correction Code
33. HiCOMB Introduction and Committees
34. GABB 2016 Keynote
35. Fast Execution of Simultaneous Breadth-First Searches on Sparse Graphs
36. Parallel Methods for Verifying the Consistency of Weakly-Ordered Architectures
37. A fast, energy-efficient abstraction for simultaneous breadth-first searches
38. HiCOMB Introduction and Committees
39. ParLearning Keynotes
40. A Methodology for Co-Location Aware Application Performance Modeling in Multicore Computing
41. Scalable and High Performance Betweenness Centrality on the GPU
42. Optimizing energy consumption and parallel performance for static and dynamic betweenness centrality using GPUs
43. Designing a Heuristic Cross-Architecture Combination for Breadth-First Search
44. Revisiting Edge and Node Parallelism for Dynamic GPU Graph Analytics
45. HiCOMB Introduction and Committees
46. GABB Introduction
47. A new parallel algorithm for connected components in dynamic graphs
48. Standards for graph algorithm primitives
49. Faster Clustering Coefficient Using Vertex Covers
50. A dynamic algorithm for local community detection in graphs.
Catalog
Books, media, physical & digital resources
Discovery Service for Jio Institute Digital Library
For full access to our library's resources, please sign in.