David A. Bader
TitleCited byYear
A linear-time algorithm for computing inversion distance between signed permutations with an experimental study
DA Bader, BME Moret, M Yan
Journal of Computational Biology 8 (5), 483-491, 2001
Approximating betweenness centrality
DA Bader, S Kintali, K Madduri, M Mihail
International Workshop on Algorithms and Models for the Web-Graph, 124-137, 2007
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
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
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
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
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
A new implementation and detailed study of breakpoint analysis
BME Moret, DA Bader, S Wyman, T Warnow, M Yan
Biocomputing 2001, 583-594, 2000
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
The magazine archive includes every article published in Communications of the ACM for over the past 50 years.
S McDonald, HM Edwards
Communications of the ACM 50 (1), 66-71, 2007
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
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
Graph partitioning and graph clustering
DA Bader, H Meyerhenke, P Sanders, D Wagner
American Mathematical Soc., 2013
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
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
DA Bader, R Pennington
The International Journal of High Performance Computing Applications 15 (2 …, 2001
The Shortest Path Problem: Ninth DIMACS Implementation Challenge
C Demetrescu, AV Goldberg, DS Johnson
American Mathematical Soc., 2009
Programming petascale applications with Charm++ and AMPI
LV Kale, E Bohm, CL Mendes, T Wilmarth, G Zheng, D Bader
Petascale Computing: Algorithms and Applications 1, 421-441, 2007
Petascale computing: algorithms and applications
DA Bader
CRC press, 2007
SIMPLE: A methodology for programming high performance algorithms on clusters of symmetric multiprocessors (SMPs)
DA Bader, J JáJá
Journal of Parallel and Distributed Computing 58 (1), 92-108, 1999
The system can't perform the operation now. Try again later.
Articles 1–20