David A. Bader
David A. Bader
Home
People
Posts
Projects
Books
Publications
Talks
Contact
CV
Light
Dark
Automatic
David Bader
Latest
Quantum interior point method (US20240144066A1)
A detailed, end-to-end assessment of a quantum algorithm for portfolio optimization, released by Goldman Sachs and AWS
Contour Algorithm for Connectivity
Fast Triangle Counting (Graph Challenge Innovation Award)
Triangle Counting Through Cover-Edges (Graph Challenge Student Innovation Award)
Property Graphs in Arachne
Parallel Longest Common SubSequence Analysis In Chapel
End-to-end resource analysis for quantum interior point methods and portfolio optimization
Tunnel: Parallel-inducing sort for large string analytics
Parallel Triangles and Squares Count for Multigraphs Using Vertex Covers
Minimum-Mapping based Connected Components Algorithm
Billion-scale Detection of Isomorphic Nodes
A Simple and Efficient Algorithm for Finding Minimum Spanning Tree Replacement Edges
End-to-end resource analysis for quantum interior point methods and portfolio optimization
High-Performance Truss Analysis in Arkouda
Parallel Suffix Sorting for Large String Analytics
Triangle Centrality in Arkouda
Arachne: An Arkouda Package for Large-Scale Graph Analytics
Interactive Graph Analytics at Scale in Arkouda
Truss Analytics Algorithms and Integration in Arkouda
Scalable Katz Ranking Computation in Large Static and Dynamic Graphs
Anomaly Detection in Catalog Streams
Anti-Section Transitive Closure
Dynamics signature based anomaly detection
Large Scale String Analytics In Arkouda
Enabling Exploratory Large Scale Graph Analytics through Arkouda
A GraphBLAS implementation of Triangle Centrality
K-Truss Implementation in Arkouda (Extended Abstract)
Massive Graph Analytics (Chapman & Hall / CRC Press), 2022
Linux and Supercomputing: How my passion for building COTS systems led to an HPC revolution
Interactive Graph Stream Analytics in Arkouda
An Efficient LP Rounding Scheme for Replica Placement
GPU Accelerated Anomaly Detection of Large Scale Light Curves
Using RAPIDS AI to Accelerate Graph Data Science Workflows
Accelerating and Expanding End-to-End Data Science Workflows with DL/ML Interoperability Using RAPIDS
Traversing Large Graphs on GPUs with Unified Memory
Performance Impact of Memory Channels on Sparse and Irregular Algorithms
Ranking in Dynamic Graphs Using Exponential Centrality
Semantic database applications at the Samtavro Cemetery, Georgia
Graphs, Matrices, and the GraphBLAS: Seven Good Reasons
Graph Analysis Trends and Opportunities
Graph Partitioning and Graph Clustering (American Mathematical Society), 2013
Scientific Computing with Multicore and Accelerators (Chapman & Hall / CRC Press), 2011
Analyzing Massive Social Networks Using Multicore and Multithreaded Architectures
GPUMemSort: A High Performance Graphic Co-processors Sorting Algorithm for Large Scale In-Memory Data
On accelerating iterative algorithms with CUDA: A case study on Conditional Random Fields training algorithm for biological sequence alignment
Petascale Computing: Algorithms and Applications (Chapman & Hall / CRC Press), 2008
New approaches for using gene order data in phylogeny reconstruction
Cite
×