David A. Bader
Title
Cited by
Cited by
Year
A linear-time algorithm for computing inversion distance between signed permutations with an experimental study
DA Bader, BME Moret, M Yan
Workshop on Algorithms and Data Structures, 365-376, 2001
4992001
Approximating betweenness centrality
DA Bader, S Kintali, K Madduri, M Mihail
International Workshop on Algorithms and Models for the Web-Graph, 124-137, 2007
4102007
Scalable graph exploration on multicore processors
V Agarwal, F Petrini, D Pasetto, DA Bader
SC'10: Proceedings of the 2010 ACM/IEEE International Conference for High …, 2010
3242010
Designing multithreaded algorithms for breadth-first search and st-connectivity on the Cray MTA-2
DA Bader, K Madduri
2006 International Conference on Parallel Processing (ICPP'06), 523-530, 2006
3032006
Parallel algorithms for evaluating centrality indices in real-world networks
DA Bader, K Madduri
2006 International Conference on Parallel Processing (ICPP'06), 539-550, 2006
2572006
A faster parallel algorithm and efficient multithreaded implementations for evaluating betweenness centrality on massive datasets
K Madduri, D Ediger, K Jiang, DA Bader, D Chavarria-Miranda
2009 IEEE International Symposium on Parallel & Distributed Processing, 1-8, 2009
2362009
Graph partitioning and graph clustering
DA Bader, H Meyerhenke, P Sanders, D Wagner
American Mathematical Society, 2013
2102013
STINGER: High performance data structure for streaming graphs
D Ediger, R McColl, J Riedy, DA Bader
High Performance Extreme Computing (HPEC), 2012 IEEE Conference on, 1-5, 2012
2042012
Massive social network analysis: Mining twitter for social good
D Ediger, K Jiang, J Riedy, DA Bader, C Corley, R Farber, WN Reynolds
2010 39th International Conference on Parallel Processing, 583-593, 2010
1992010
A new implementation and detailed study of breakpoint analysis
BME Moret, DA Bader, S Wyman, T Warnow, M Yan
Biocomputing 2001, 583-594, 2000
1972000
Who should test whom?
S McDonald, HM Edwards
Communications of the ACM 50 (1), 66-71, 2007
192*2007
On the Representation and Multiplication of Hypersparse Matrices
JR Gilbert, S Reinhardt, VB Shah, VB Shah, JR Gilbert, S Reinhardt, ...
IEEE International Parallel and Distributed Processing Symposium (IPDPS 2008 …, 2008
191*2008
GTgraph: A synthetic graph generator suite
DA Bader, K Madduri
Atlanta, GA, February, 2006
190*2006
Design and implementation of the HPCS graph analysis benchmark on symmetric multiprocessors
DA Bader, K Madduri
International Conference on High-Performance Computing, 465-476, 2005
1872005
Snap, small-world network analysis and partitioning: An open-source parallel graph framework for the exploration of large-scale networks
DA Bader, K Madduri
2008 IEEE international symposium on parallel and distributed processing, 1-12, 2008
1862008
Mathematical foundations of the GraphBLAS
J Kepner, P Aaltonen, D Bader, A Buluç, F Franchetti, J Gilbert, ...
2016 IEEE High Performance Extreme Computing Conference (HPEC), 1-9, 2016
1592016
Applications
DA Bader, R Pennington
The International Journal of High Performance Computing Applications 15 (2 …, 2001
1512001
Dynamic load balancing in distributed systems in the presence of delays: A regeneration-theory approach
S Dhakal, MM Hayat, JE Pezoa, C Yang, DA Bader
IEEE transactions on parallel and distributed systems 18 (4), 485-497, 2007
1502007
Fast shared-memory algorithms for computing the minimum spanning forest of sparse graphs
DA Bader, G Cong
Journal of Parallel and Distributed Computing 66 (11), 1366-1378, 2006
1422006
A fast, parallel spanning tree algorithm for symmetric multiprocessors (SMPs)
DA Bader, G Cong
Journal of Parallel and Distributed Computing 65 (9), 994-1006, 2005
1382005
The system can't perform the operation now. Try again later.
Articles 1–20