Obserwuj
David A. Bader
Tytuł
Cytowane przez
Cytowane przez
Rok
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
5012001
Fundamental Questions in the Analysis of Large Graphs
J Kepner, DA Bader, R Bond, N Bliss, C Faloutsos, B Hendrickson, ...
Graph Algorithms in the Language of Linear Algebra, 353-357, 2011
479*2011
Approximating betweenness centrality
DA Bader, S Kintali, K Madduri, M Mihail
Algorithms and Models for the Web-Graph: 5th International Workshop, WAW …, 2007
4602007
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
3462010
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
3272006
Encyclopedia of parallel computing
D Padua
Springer Science & Business Media, 2011
3152011
Graph partitioning and graph clustering
DA Bader, H Meyerhenke, P Sanders, D Wagner
American Mathematical Society, 2013
3092013
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
2922006
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
2722012
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
2692016
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
2682009
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
245*2008
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
2312010
Design and performance evaluation of image processing algorithms on GPUs
IK Park, N Singhal, MH Lee, S Cho, C Kim
IEEE Transactions on parallel and distributed systems 22 (1), 91-104, 2010
2242010
GTgraph: A synthetic graph generator suite
DA Bader, K Madduri
Atlanta, GA, February, 2006
209*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
2022005
A new implementation and detailed study of breakpoint analysis
BME Moret, DA Bader, S Wyman, T Warnow, M Yan
Biocomputing 2001, 583-594, 2000
1962000
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
1942008
Detecting insider threats in a real corporate database of computer usage activity
TE Senator, HG Goldberg, A Memory, WT Young, B Rees, R Pierce, ...
Proceedings of the 19th ACM SIGKDD international conference on Knowledge …, 2013
1812013
Benchmarking for graph clustering and partitioning
P Sanders, C Schulz, D Wagner
Encyclopedia of social network analysis and mining. Springer, 2014
1712014
Nie można teraz wykonać tej operacji. Spróbuj ponownie później.
Prace 1–20