David Bader
David Bader
Distinguished Professor, Data Science
Institute for Data Science, Suite 3610, 101 Hudson St, Jersey City, NJ 07302
About Me
David A. Bader is a Distinguished Professor and a founder of the Department of Data Science in the Ying Wu College of Computing and Director of the Institute for Data Science at New Jersey Institute of Technology. He is a Fellow of the IEEE, ACM, AAAS, and SIAM; a recipient of the IEEE Sidney Fernbach Award; and 2022 Innovation Hall of Fame inductee of the University of Maryland's A. James Clark School of Engineering.
Education
Ph.D.; University of Maryland; Electrical Engineering; 1996
M.S.; Lehigh University; Electrical Engineering; 1991
B.S.; Lehigh University; Computer Engineering; 1990
M.S.; Lehigh University; Electrical Engineering; 1991
B.S.; Lehigh University; Computer Engineering; 1990
Awards & Honors
2022 Innovation Hall of Fame inductee, University of Maryland’s A. James School of Engineering
2021 Fellow, ACM
2021 Meritorious Service Award, IEEE Computer Society
2021 Sidney Fernbach Award, IEEE Computer Society
2021 Honorary Member, National Academy of Inventors
2021 Fellow, ACM
2021 Meritorious Service Award, IEEE Computer Society
2021 Sidney Fernbach Award, IEEE Computer Society
2021 Honorary Member, National Academy of Inventors
SHOW MORE
2021 Distinguished Visitors Program, IEEE Computer Society
2019 Fellow, SIAM
2014 Outstanding Senior Faculty Research Award, Georgia Tech
2013 Outstanding Service Contributions Award, IEEE Computer Society Technical Committee on Parallel Processing
2012 Distinguished Alumni Award, University of Maryland’s Electrical and Computer Engineering
2012 Fellow, AAAS
2011 Golden Core Member Award, IEEE Computer Society
2010 Fellow, IEEE
2010 Meritorious Service Award, IEEE Computer Society
2007 Dean's Award, Georgia Tech, College of Computing
2002 Lawton-Ellis Award, University of New Mexico
2001 CAREER, National Science Foundation
2001 Regents' Lecturer, University of New Mexico
2000 Junior Research Excellence Award, University of New Mexico
2000 Young Outstanding Engineer Award, IEEE
2019 Fellow, SIAM
2014 Outstanding Senior Faculty Research Award, Georgia Tech
2013 Outstanding Service Contributions Award, IEEE Computer Society Technical Committee on Parallel Processing
2012 Distinguished Alumni Award, University of Maryland’s Electrical and Computer Engineering
2012 Fellow, AAAS
2011 Golden Core Member Award, IEEE Computer Society
2010 Fellow, IEEE
2010 Meritorious Service Award, IEEE Computer Society
2007 Dean's Award, Georgia Tech, College of Computing
2002 Lawton-Ellis Award, University of New Mexico
2001 CAREER, National Science Foundation
2001 Regents' Lecturer, University of New Mexico
2000 Junior Research Excellence Award, University of New Mexico
2000 Young Outstanding Engineer Award, IEEE
COLLAPSE
Website
2025 Spring Courses
CS 726 - INDEPENDENT STUDY II
CS 790A - DOCT DISSERTATION & RES
DS 726 - INDEPENDENT STUDY II
DS 488 - INDEPENDENT STUDY IN DS
DS 701B - MASTER'S THESIS
CS 488 - INDEPENDENT STUDY IN CS
CS 701B - MASTER'S THESIS
CS 725 - INDEPENDENT STUDY I
DS 642 - APPLICATIONS PARALLEL COMPUT
DS 700B - MASTER'S PROJECT
DS 792B - PRE-DOCTORAL RESEARCH
CS 700B - MASTER'S PROJECT
CS 792 - PRE-DOCTORAL RESEARCH
DS 725 - INDEPENDENT STUDY I
DS 790A - DOCT DISSERTATION & RES
CS 790A - DOCT DISSERTATION & RES
DS 726 - INDEPENDENT STUDY II
DS 488 - INDEPENDENT STUDY IN DS
DS 701B - MASTER'S THESIS
CS 488 - INDEPENDENT STUDY IN CS
CS 701B - MASTER'S THESIS
CS 725 - INDEPENDENT STUDY I
DS 642 - APPLICATIONS PARALLEL COMPUT
DS 700B - MASTER'S PROJECT
DS 792B - PRE-DOCTORAL RESEARCH
CS 700B - MASTER'S PROJECT
CS 792 - PRE-DOCTORAL RESEARCH
DS 725 - INDEPENDENT STUDY I
DS 790A - DOCT DISSERTATION & RES
Past Courses
CS 644: INTRODUCTION TO BIG DATA
DS 642: APPLICATIONS OF PARALLEL COMPUTING
DS 642: APPLICATIONS OF PARALLEL COMPUTING
Research Interests
Data Science, High Performance Computing, Real-World Analytics
Conference Paper
“A Deployment Tool for Large Scale Graph Analytics Framework Arachne”
September 2024.
“Enhanced Knowledge Graph Attention Networks for Efficient Graph Learning (Outstanding Student Paper Award)”
September 2024.
“VF2-PS: Parallel and Scalable Subgraph Monomorphism in Arachne”
September 2024.
“Graph-Based Profiling of Dependency Vulnerability Remediation”
6th International Conference on Science of Cyber Security (SciSec), August 2024.
“On the Design of Graph Analytical Software in Chapel”
The 11th Annual Chapel Implementers and Users Workshop (ChapelCon), June 2024.
September 2024.
“Enhanced Knowledge Graph Attention Networks for Efficient Graph Learning (Outstanding Student Paper Award)”
September 2024.
“VF2-PS: Parallel and Scalable Subgraph Monomorphism in Arachne”
September 2024.
“Graph-Based Profiling of Dependency Vulnerability Remediation”
6th International Conference on Science of Cyber Security (SciSec), August 2024.
“On the Design of Graph Analytical Software in Chapel”
The 11th Annual Chapel Implementers and Users Workshop (ChapelCon), June 2024.
SHOW MORE
“Contour Algorithm for Connectivity”
The 30th IEEE International Conference on High Performance Computing, Data, and Analytics (HiPC), December 2023.
“Fast Triangle Counting (Graph Challenge Innovation Award)”
IEEE, September 2023.
“Parallel Longest Common SubSequence Analysis In Chapel”
IEEE, September 2023.
“Property Graphs in Arachne”
IEEE, September 2023.
“Triangle Counting Through Cover-Edges (Graph Challenge Student Innovation Award)”
IEEE, September 2023.
“Billion-scale Detection of Isomorphic Nodes”
Workshop in Graphs, Architectures, Programming, and Learning (GrAPL), held in conjunction with \textit{The IEEE International Parallel and Distributed Processing Symposium (IPDPS 2023), May 2023.
“High-Performance Truss Analysis in Arkouda”
December 2022.
“Arachne: An Arkouda Package for Large-Scale Graph Analytics”
The 26th Annual IEEE High Performance Extreme Computing Conference, September 2022.
“Triangle Centrality in Arkouda”
{The 26th Annual IEEE High Performance Extreme Computing Conference, September 2022.
“Parallel Suffix Sorting for Large String Analytics”
14th International Conference on Parallel Processing and Applied Mathematics (PPAM), September 2022.
“Truss Analytics Algorithms and Integration in Arkouda”
June 2022.
“Graph Analysis Trends and Opportunities”
November 2014.
The 30th IEEE International Conference on High Performance Computing, Data, and Analytics (HiPC), December 2023.
“Fast Triangle Counting (Graph Challenge Innovation Award)”
IEEE, September 2023.
“Parallel Longest Common SubSequence Analysis In Chapel”
IEEE, September 2023.
“Property Graphs in Arachne”
IEEE, September 2023.
“Triangle Counting Through Cover-Edges (Graph Challenge Student Innovation Award)”
IEEE, September 2023.
“Billion-scale Detection of Isomorphic Nodes”
Workshop in Graphs, Architectures, Programming, and Learning (GrAPL), held in conjunction with \textit{The IEEE International Parallel and Distributed Processing Symposium (IPDPS 2023), May 2023.
“High-Performance Truss Analysis in Arkouda”
December 2022.
“Arachne: An Arkouda Package for Large-Scale Graph Analytics”
The 26th Annual IEEE High Performance Extreme Computing Conference, September 2022.
“Triangle Centrality in Arkouda”
{The 26th Annual IEEE High Performance Extreme Computing Conference, September 2022.
“Parallel Suffix Sorting for Large String Analytics”
14th International Conference on Parallel Processing and Applied Mathematics (PPAM), September 2022.
“Truss Analytics Algorithms and Integration in Arkouda”
June 2022.
“Graph Analysis Trends and Opportunities”
November 2014.
COLLAPSE
Journal Article
Alexander M Dalzell, B. David Clader, Grant Salton, Mario Berta, Cedric Yen-Yu Lin, David A Bader, Nikitas Stamatopoulos, Martin J. A. Schuetz, Fernando G.S.L. Brandão, Helmut G. Katzgraber, William J. Zeng. 2023. “End-to-end resource analysis for quantum interior point methods and portfolio optimization.” PRX Quantum, vol. 4, no. 4, pp. 040325.
Zhihui Du, Sen Zhang, David Bader. 2023. “Tunnel: Parallel-inducing sort for large string analytics.” Future Generation Computer Systems, vol. 149, pp. 650-663.
Chen Yang, Zhihui Du, Xiaofeng Meng, Xukang Zhang, Xinli Hao, David Bader. 2023. “Anomaly Detection in Catalog Streams.” IEEE Transactions on Big Data, vol. 9, no. 1, pp. 294-311.
David Bader, Paul Burkhardt. 2022. “A Simple and Efficient Algorithm for Finding Minimum Spanning Tree Replacement Edges.” Journal of Graph Algorithms and Applications, vol. 26, no. 4, pp. 577-588.
Alexander van der Grinten, Elisabetta Bergamini, Oded Green, David Bader, Henning Meyerhencke. 2022. “Scalable Katz Ranking Computation in Large Static and Dynamic Graphs.” ACM Journal of Experimental Algorithmics, vol. 22, no. 1.7, pp. 16.
Zhihui Du, Sen Zhang, David Bader. 2023. “Tunnel: Parallel-inducing sort for large string analytics.” Future Generation Computer Systems, vol. 149, pp. 650-663.
Chen Yang, Zhihui Du, Xiaofeng Meng, Xukang Zhang, Xinli Hao, David Bader. 2023. “Anomaly Detection in Catalog Streams.” IEEE Transactions on Big Data, vol. 9, no. 1, pp. 294-311.
David Bader, Paul Burkhardt. 2022. “A Simple and Efficient Algorithm for Finding Minimum Spanning Tree Replacement Edges.” Journal of Graph Algorithms and Applications, vol. 26, no. 4, pp. 577-588.
Alexander van der Grinten, Elisabetta Bergamini, Oded Green, David Bader, Henning Meyerhencke. 2022. “Scalable Katz Ranking Computation in Large Static and Dynamic Graphs.” ACM Journal of Experimental Algorithmics, vol. 22, no. 1.7, pp. 16.
SHOW MORE
Zhihui Du, Oliver Alvarado Rodriguez, Joseph Patchett, David Bader. 2021. “Interactive Graph Stream Analytics in Arkouda.” Algorithms, vol. 14, no. 8.
David Bader. 2021. “Linux and Supercomputing: How my passion for building COTS systems led to an HPC revolution.” IEEE Annals on the History of Computing, vol. 43, no. 3.
Ivan Hendy Goenawan, Zhihui Du, Chao Wu, Yankui Sun, Jianyan Wei, David Bader. 2021. “Dynamics Signature based Anomaly Detection.” Software: Practice and Experience, vol. 53, no. 1, pp. 160-175.
Prasun Gera, Hyojong Kim, Piyush Sao, Hyesoon Kim, David Bader. 2020. “Traversing Large Graphs on GPUs with Unified Memory.” Proceedings of the VLDB Endowment, vol. 13, no. 7, pp. 1119-1133.
David Bader. 2019. “Editorial from the Editor-in-Chief.” ACM Transactions on Parallel Computing TOPC, vol. 6, no. 1, pp. 1--2.
Lluís-Miquel Munguía, Shabbir Ahmed, David Bader, George L. Nemhauser, Yufen Shao, Dimitri J. Papageorgiou. 2019. “Tailoring parallel alternating criteria search for domain specific MIPs: Application to maritime inventory routing.” Computers & Operations Research, vol. 111, pp. 21 - 34.
Adam McLaughlin, David Bader. 2018. “Accelerating GPU betweenness centrality.” Communications of the ACM, vol. 61, no. 8, pp. 85--92.
Lluís-Miquel Munguía, Shabbir Ahmed, David Bader, George L. Nemhauser, Yufen Shao. 2018. “Alternating criteria search: a parallel large neighborhood search algorithm for mixed integer programs.” Computational Optimization and Applications, vol. 69, no. 1, pp. 1--24.
Eisha Nathan, David Bader. 2018. “Incrementally updating Katz centrality in dynamic graphs.” Social Network Analysis and Mining, vol. 8, no. 1, pp. 26.
Eisha Nathan, Geoffrey Sanders, Van Emden Henson, David Bader. 2018. “Numerically approximating centrality for graph ranking guarantees.” Journal of Computational Science, vol. 26, pp. 205--216.
Lluís-Miquel Munguía, Shabbir Ahmed, David Bader, George L. Nemhauser, Vikas Goel, Yufen Shao. 2017. “A parallel local search framework for the Fixed-Charge Multicommodity Network Flow problem.” Computers \& Optimization Research, vol. 77, pp. 44--57.
Yang You, Haohuan Fu, David Bader, Guangwen Yang. 2017. “Designing and implementing a heuristic cross-architecture combination for graph traversal.” Journal of Parallel and Distributed Computing, vol. 108, pp. 95--105.
David Bader. 2017. “Editor's Note.” IEEE Transactions on Parallel and Distributed Systems, vol. 28, no. 12, pp. 3328--3329.
David Bader. 2017. “Editor's Note.” IEEE Transactions on Parallel and Distributed Systems, vol. 28, no. 1, pp. 1.
Zhaoming Yin, Jijun Tang, Stephen W. Schaeffer, David Bader. 2017. “Exemplar or Matching: Modeling DCJ Problems with Unequal Content Genome Data.” CoRR, vol. abs/1705.06559.
Eisha Nathan, Geoffrey Sanders, James Fairbanks, Van Emden Henson, David Bader. 2017. “Graph Ranking Guarantees for Numerical Approximations to Katz Centrality.” Procedia Computer Science, vol. 108, pp. 68--78.
Eisha Nathan, Anita Zakrzewska, E. Jason Riedy, David Bader. 2017. “Local Community Detection in Dynamic Graphs Using Personalized Centrality.” Algorithms, vol. 10, no. 3, pp. 102--128.
Zhihui Du, Rong Ge, Victor W. Lee, Richard W. Vuduc, David Bader, Ligang He. 2017. “Modeling the Power Variability of Core Speed Scaling on Homogeneous Multicore Systems.” Scientific Programming, vol. 2017, pp. 8686971:1--13.
James P. Fairbanks, David Bader, Geoffrey D. Sanders. 2017. “Spectral partitioning with blends of eigenvectors.” Journal of Complex Networks, vol. 5, no. 4, pp. 551--580.
Quan Yang, Zhihui Du, Zhou-Jian Cao, Jian Tao, David Bader. 2016. “A New Parallel Method for Binary Black Hole Simulations.” Scientific Programming, vol. 2016, pp. 2360492:1--14.
David Bader. 2016. “Editor's Note.” IEEE Transactions on Parallel and Distributed Systems, vol. 27, no. 1, pp. 1.
David Bader. 2016. “Evolving MPI+X Toward Exascale.” IEEE Computer, vol. 49, no. 8, pp. 10.
Zhaoming Yin, Jijun Tang, Stephen W. Schaeffer, David Bader. 2016. “Exemplar or matching: modeling DCJ problems with unequal content genome data.” Journal of Combinatorial Optimization, vol. 32, no. 4, pp. 1165--1181.
Daniel Dauwe, Eric Jonardi, Ryan Friese, Sudeep Pasricha, Anthony A. Maciejewski, David Bader, Howard Jay Siegel. 2016. “HPC node performance and energy modeling with the co-location of applications.” Journal of Supercomputing, vol. 72, no. 12, pp. 4771--4809.
Anita Zakrzewska, David Bader. 2016. “Tracking local communities in streaming graphs with a dynamic algorithm.” Social Network Analysis and Mining, vol. 6, no. 1, pp. 65:1--16.
James P. Fairbanks, Ramakrishnan Kannan, Haesun Park, David Bader. 2015. “Behavioral clusters in dynamic graphs.” Parallel Computing, vol. 47, pp. 38--50.
David Bader. 2015. “Editor's Note.” IEEE Transactions on Parallel and Distributed Systems, vol. 26, no. 1, pp. 1.
Jeremy Kepner, David Bader, Aydın Buluç, John Gilbert, Timothy Mattson, Henning Meyerhenke. 2015. “Graphs, Matrices, and the GraphBLAS: Seven Good Reasons.” Procedia Computer Science, vol. 51, pp. 2453--2462.
James P. Fairbanks, Geoffrey D. Sanders, David Bader. 2015. “Spectral Partitioning with Blends of Eigenvectors.” CoRR, vol. abs/1510.04658.
David Bader. 2015. “State of the Journal.” IEEE Transactions on Computers, vol. 64, no. 6, pp. 1506--1508.
Yunpeng Chai, Zhihui Du, Xiao Qin, David Bader. 2015. “WEC: Improving Durability of SSD Cache Drives by Caching Write-Efficient Data.” IEEE Transactions on Computers, vol. 64, no. 11, pp. 3304--3316.
David Bader, Petra Mutzel. 2014. “Introduction to Special Issue ALENEX'12.” ACM Journal of Experimental Algorithmics, vol. 19, no. 1.
Tim Mattson, David Bader, Jonathan W. Berry, Aydin Bulu\cc, Jack J. Dongarra, Christos Faloutsos, John Feo, John R. Gilbert, Joseph Gonzalez, Bruce Hendrickson, Jeremy Kepner, Charles E. Leiserson, Andrew Lumsdaine, David A. Padua, Stephen W. Poole, Steven P. Reinhardt, Mike Stonebraker, Steve Wallach, Andrew Yoo. 2014. “Standards for Graph Algorithm Primitives.” CoRR, vol. abs/1408.0393, pp. 1--2.
David Bader. 2014. “State of the Journal.” IEEE Transactions on Parallel and Distributed Systems, vol. 25, no. 1, pp. 1.
Robert McColl, David Ediger, Jason Poovey, Dan Campbell, David Bader. 2013. “A Brief Study of Open Source Graph Databases.” CoRR, vol. abs/1309.2675.
Oded Green, David Bader. 2013. “Faster Betweenness Centrality Based on Data Structure Experimentation.” Procedia Computer Science, vol. 18, pp. 399--408.
David Ediger, Karl Jiang, E. Jason Riedy, David Bader. 2013. “GraphCT: Multithreaded Algorithms for Massive Graph Analysis.” IEEE Transactions on Parallel \& Distributed Systems, vol. 24, no. 11, pp. 2220--2229.
E. Jason Riedy, David Bader. 2013. “Massive streaming data analytics: a graph-based approach.” ACM Crossroads, vol. 19, no. 3, pp. 37--43.
Xing Liu, Pushkar R. Pande, Henning Meyerhenke, David Bader. 2013. “PASQUAL: Parallel Techniques for Next Generation Genome Sequence Assembly.” IEEE Transactions on Parallel \& Distributed Systems, vol. 24, no. 5, pp. 977--986.
Zhaoming Yin, Jijun Tang, Stephen W. Schaeffer, David Bader. 2013. “Streaming Breakpoint Graph Analytics for Accelerating and Parallelizing the Computation of DCJ Median of Three Genomes.” Procedia Computer Science, vol. 18, pp. 561--570.
Shel Swenson, Yogesh Simmhan, Viktor K. Prasanna, Manish Parashar, E. Jason Riedy, David Bader, Richard W. Vuduc. 2013. “Sustainable Software Development for Next-Gen Sequencing (NGS) Bioinformatics on Emerging Platforms.” CoRR, vol. abs/1309.1828.
David Bader, Philippas Tsigas. 2012. “ACM journal on experimental algorithmics special issue on multicore algorithms.” ACM Journal of Experimental Algorithmics, vol. 17, no. 1, pp. 1.
Yunpeng Chai, Zhihui Du, David Bader, Xiao Qin. 2012. “Efficient Data Migration to Conserve Energy in Streaming Media Storage Systems.” IEEE Transactions on Parallel \& Distributed Systems, vol. 23, no. 11, pp. 2081--2093.
M. Shel Swenson, Joshua Anderson, Andrew Ash, Prashant Gaurav, Zsuzsanna Sükösd, David Bader, Stephen C. Harvey, Christine E. Heitsch. 2012. “GTfold: Enabling parallel RNA secondary structure prediction on multi-core desktops.” BMC Research Notes, vol. 5, pp. 341--347.
Seunghwa Kang, David Ediger, David Bader. 2011. “Algorithm Engineering Challenges in Multicore and Manycore Systems.” it - Information Technology, vol. 53, no. 6, pp. 266--273.
Yin Ye, Zhihui Du, David Bader. 2011. “GPUMemSort: A High Performance Graphic Co-processors Sorting Algorithm for Large Scale In-Memory Data.” GSTF International Journal on Computing, vol. 1, no. 2, pp. 23--28.
David Bader, David R. Kaeli, Volodymyr V. Kindratenko. 2011. “Guest Editor's Introduction: Special Issue on High-Performance Computing with Accelerators.” IEEE Transactions on Parallel and Distributed Systems, vol. 22, no. 1, pp. 3--6.
Mingyu Chen, David Bader. 2011. “On the random access performance of Cell Broadband Engine with graph analysis application.” CoRR, vol. abs/1105.5881.
Seunghwa Kang, Jijun Tang, Stephen W. Schaeffer, David Bader. 2011. “Rec-DCM-Eigen: Reconstructing a Less Parsimonious but More Accurate Tree in Shorter Time.” PLOS ONE, vol. 6, no. 8, pp. 1--12.
David Bader, Virat Agarwal, Seunghwa Kang. 2009. “Computing discrete transforms on the Cell Broadband Engine.” Parallel Computing, vol. 35, no. 3, pp. 119--137.
Virat Agarwal, David Bader, Lin Dan, Lurng-Kuo Liu, Davide Pasetto, Michael Perrone, Fabrizio Petrini. 2009. “Faster FAST: multicore acceleration of streaming financial data.” Computer Science - Research and Development, vol. 23, no. 3-4, pp. 249--257.
David Bader, Kamesh Madduri. 2008. “A graph-theoretic analysis of the human protein-interaction network using multicore parallel algorithms.” Parallel Computing, vol. 34, no. 11, pp. 627--639.
David Bader, Srinivas Aluru. 2008. “Guest editorial: High-performance computational biology.” Parallel Computing, vol. 34, no. 11, pp. 613--615.
Sagar Dhakal, Majeed M. Hayat, Jorge E. Pezoa, Cundong Yang, David Bader. 2007. “Dynamic Load Balancing in Distributed Systems in the Presence of Delays: A Regeneration-Theory Approach.” IEEE Transactions on Parallel \& Distributed Systems, vol. 18, no. 4, pp. 485--497.
David Bader, Virat Agarwal, Kamesh Madduri, Seunghwa Kang. 2007. “High performance combinatorial algorithm design on the Cell Broadband Engine processor.” Parallel Computing, vol. 33, no. 10-11, pp. 720--740.
Diana H. P. Low, Bharadwaj Veeravalli, David Bader. 2007. “On the design of high-performance algorithms for aligning multiple protein sequences on mesh-based multiprocessor architectures.” Journal of Parallel and Distributed Computing, vol. 67, no. 9, pp. 1007--1017.
David Bader, Usman W. Roshan, Alexandros Stamatakis. 2006. “Computational Grand Challenges in Assembling the Tree of Life: Problems and Solutions.” Advances in Computers, vol. 68, pp. 127--176.
Guojing Cong, David Bader. 2006. “Designing irregular parallel algorithms with mutual exclusion and lock-free protocols.” Journal of Parallel and Distributed Computing, vol. 66, no. 6, pp. 854--866.
David Bader, K. Madduri, J. R. Gilbert, V. Shah, J. Kepner, T. Meuse, A. Krishnamurthy. 2006. “Designing Scalable Synthetic Compact Applications for Benchmarking High Productivity Computing Systems.” CTWatch Quarterly, vol. 2, no. 4B, pp. 41--51.
Srinivas Aluru, Nancy M. Amato, David Bader. 2006. “Editorial: Special Section on High-Performance Computational Biology.” IEEE Transactions on Parallel and Distributed Systems, vol. 17, no. 8, pp. 737--739.
David Bader, Guojing Cong. 2006. “Fast shared-memory algorithms for computing the minimum spanning forest of sparse graphs.” Journal of Parallel and Distributed Computing, vol. 66, no. 11, pp. 1366--1378.
David Bader, Guojing Cong. 2005. “A fast, parallel spanning tree algorithm for symmetric multiprocessors (SMPs).” Journal of Parallel and Distributed Computing, vol. 65, no. 9, pp. 994--1006.
Marc Snir, David Bader. 2004. “A Framework for Measuring Supercomputer Productivity.” International Journal of High Performance Computing Applications, vol. 18, no. 4, pp. 417--432.
David Bader. 2004. “An improved, randomized algorithm for parallel selection with an experimental study.” Journal of Parallel and Distributed Computing, vol. 64, no. 9, pp. 1051--1059.
David Bader. 2004. “Computational biology and high-performance computing.” Communications of the ACM, vol. 47, no. 11, pp. 34--41.
David Bader, Srinivas Aluru. 2004. “Special Issue: High Performance Computational Biology.” Concurrency and Computation: Practice and Experience, vol. 16, no. 9, pp. 817--821.
Srinivas Aluru, David Bader. 2003. “Guest Editor's Introduction: Special issue on high-performance computational biology.” Journal of Parallel and Distributed Computing, vol. 63, no. 7-8, pp. 671--673.
Bernard M. E. Moret, David Bader, Tandy J. Warnow. 2002. “High-Performance Algorithm Engineering for Computational Phylogenetics.” The Journal of Supercomputing, vol. 22, no. 1, pp. 99--111.
Yuzhong Sun, Xiaola Lin, Yi Pan, R. W. H. Lau, David Bader, P. Y. S. Cheung. 2002. “Generalized block shift network for clusters.” IEEE Transactions on Circuits and Systems I: Fundamental Theory and Applications, vol. 49, no. 4, pp. 543--546.
David Bader, Bernard M. E. Moret, Mi Yan. 2001. “A Linear-Time Algorithm for Computing Inversion Distance Between Two Signed Permutations with an Experimental Study.” Journal of Computational Biology, vol. 8, no. 5, pp. 483--491.
David Bader, Rob Pennington. 2001. “Applications.” IJHPCA, vol. 15, no. 2, pp. 181--185.
David Bader, Robert Pennington. 2001. “Cluster Computing: Applications.” The International Journal of High Performance Computing Applications, vol. 15, no. 2, pp. 181--186.
Satya Kalluri, Joseph JaJa, David Bader, John Townshend, Joseph Jájá, Hassan Fallahadl, Zengyan Zhang, Hassan Fallah-adl. 2000. “High performance computing algorithms for land cover dynamics using remote sensing data.” International Journal of Remote Sensing, vol. 21, no. 6-7, pp. 1513--1536.
Zengyan Zhang, Joseph F. JaJa, David Bader, Satya N. V. Kalluri, Huiping Song, Nazmi El Saleous, Eric Vermote, John R. G. Townshend. 2000. “Kronos: A software system for the processing and retrieval of large-scale AVHRR data sets.” PE \& RS - Photogrammetric Engineering and Remote Sensing, vol. 66, pp. 1073--1082.
David Bader. 1999. “A New, Architectural Paradigm for High-performance Computing.” Scalable Computing: Practice and Experience, vol. 2, no. 2.
David Bader, Joseph JaJa. 1999. “SIMPLE: A Methodology for Programming High Performance Algorithms on Clusters of Symmetric Multiprocessors (SMPs).” Journal of Parallel and Distributed Computing, vol. 58, no. 1, pp. 92--108.
David R. Helman, Joseph JaJa, David Bader. 1998. “A New Deterministic Parallel Sorting Algorithm with an Experimental Evaluation.” ACM Journal of Experimental Algorithmics, vol. 3, no. 4, pp. 1--24.
David R. Helman, David Bader, Joseph JaJa. 1998. “A Randomized Parallel Sorting Algorithm with an Experimental Study.” Journal of Parallel and Distributed Computing, vol. 52, no. 1, pp. 1--23.
David Bader, Joseph JaJa, David Harwood, Larry S. Davis. 1996. “Parallel algorithms for image enhancement and segmentation by region growing, with an experimental study.” The Journal of Supercomputing, vol. 10, no. 2, pp. 141--168.
David Bader, Joseph JaJa. 1996. “Parallel Algorithms for Image Histogramming and Connected Components with an Experimental Study.” Journal of Parallel and Distributed Computing, vol. 35, no. 2, pp. 173--190.
David Bader, David R. Helman, Joseph JaJa. 1996. “Practical Parallel Algorithms for Personalized Communication and Integer Sorting.” ACM Journal of Experimental Algorithmics, vol. 1, no. 3, pp. 1--42.
David Bader, Joseph JaJa, Rama Chellappa. 1995. “Scalable data parallel algorithms for texture synthesis using Gibbs random fields.” IEEE Transactions on Image Processing, vol. 4, no. 10, pp. 1456--1460.
David Bader. 2021. “Linux and Supercomputing: How my passion for building COTS systems led to an HPC revolution.” IEEE Annals on the History of Computing, vol. 43, no. 3.
Ivan Hendy Goenawan, Zhihui Du, Chao Wu, Yankui Sun, Jianyan Wei, David Bader. 2021. “Dynamics Signature based Anomaly Detection.” Software: Practice and Experience, vol. 53, no. 1, pp. 160-175.
Prasun Gera, Hyojong Kim, Piyush Sao, Hyesoon Kim, David Bader. 2020. “Traversing Large Graphs on GPUs with Unified Memory.” Proceedings of the VLDB Endowment, vol. 13, no. 7, pp. 1119-1133.
David Bader. 2019. “Editorial from the Editor-in-Chief.” ACM Transactions on Parallel Computing TOPC, vol. 6, no. 1, pp. 1--2.
Lluís-Miquel Munguía, Shabbir Ahmed, David Bader, George L. Nemhauser, Yufen Shao, Dimitri J. Papageorgiou. 2019. “Tailoring parallel alternating criteria search for domain specific MIPs: Application to maritime inventory routing.” Computers & Operations Research, vol. 111, pp. 21 - 34.
Adam McLaughlin, David Bader. 2018. “Accelerating GPU betweenness centrality.” Communications of the ACM, vol. 61, no. 8, pp. 85--92.
Lluís-Miquel Munguía, Shabbir Ahmed, David Bader, George L. Nemhauser, Yufen Shao. 2018. “Alternating criteria search: a parallel large neighborhood search algorithm for mixed integer programs.” Computational Optimization and Applications, vol. 69, no. 1, pp. 1--24.
Eisha Nathan, David Bader. 2018. “Incrementally updating Katz centrality in dynamic graphs.” Social Network Analysis and Mining, vol. 8, no. 1, pp. 26.
Eisha Nathan, Geoffrey Sanders, Van Emden Henson, David Bader. 2018. “Numerically approximating centrality for graph ranking guarantees.” Journal of Computational Science, vol. 26, pp. 205--216.
Lluís-Miquel Munguía, Shabbir Ahmed, David Bader, George L. Nemhauser, Vikas Goel, Yufen Shao. 2017. “A parallel local search framework for the Fixed-Charge Multicommodity Network Flow problem.” Computers \& Optimization Research, vol. 77, pp. 44--57.
Yang You, Haohuan Fu, David Bader, Guangwen Yang. 2017. “Designing and implementing a heuristic cross-architecture combination for graph traversal.” Journal of Parallel and Distributed Computing, vol. 108, pp. 95--105.
David Bader. 2017. “Editor's Note.” IEEE Transactions on Parallel and Distributed Systems, vol. 28, no. 12, pp. 3328--3329.
David Bader. 2017. “Editor's Note.” IEEE Transactions on Parallel and Distributed Systems, vol. 28, no. 1, pp. 1.
Zhaoming Yin, Jijun Tang, Stephen W. Schaeffer, David Bader. 2017. “Exemplar or Matching: Modeling DCJ Problems with Unequal Content Genome Data.” CoRR, vol. abs/1705.06559.
Eisha Nathan, Geoffrey Sanders, James Fairbanks, Van Emden Henson, David Bader. 2017. “Graph Ranking Guarantees for Numerical Approximations to Katz Centrality.” Procedia Computer Science, vol. 108, pp. 68--78.
Eisha Nathan, Anita Zakrzewska, E. Jason Riedy, David Bader. 2017. “Local Community Detection in Dynamic Graphs Using Personalized Centrality.” Algorithms, vol. 10, no. 3, pp. 102--128.
Zhihui Du, Rong Ge, Victor W. Lee, Richard W. Vuduc, David Bader, Ligang He. 2017. “Modeling the Power Variability of Core Speed Scaling on Homogeneous Multicore Systems.” Scientific Programming, vol. 2017, pp. 8686971:1--13.
James P. Fairbanks, David Bader, Geoffrey D. Sanders. 2017. “Spectral partitioning with blends of eigenvectors.” Journal of Complex Networks, vol. 5, no. 4, pp. 551--580.
Quan Yang, Zhihui Du, Zhou-Jian Cao, Jian Tao, David Bader. 2016. “A New Parallel Method for Binary Black Hole Simulations.” Scientific Programming, vol. 2016, pp. 2360492:1--14.
David Bader. 2016. “Editor's Note.” IEEE Transactions on Parallel and Distributed Systems, vol. 27, no. 1, pp. 1.
David Bader. 2016. “Evolving MPI+X Toward Exascale.” IEEE Computer, vol. 49, no. 8, pp. 10.
Zhaoming Yin, Jijun Tang, Stephen W. Schaeffer, David Bader. 2016. “Exemplar or matching: modeling DCJ problems with unequal content genome data.” Journal of Combinatorial Optimization, vol. 32, no. 4, pp. 1165--1181.
Daniel Dauwe, Eric Jonardi, Ryan Friese, Sudeep Pasricha, Anthony A. Maciejewski, David Bader, Howard Jay Siegel. 2016. “HPC node performance and energy modeling with the co-location of applications.” Journal of Supercomputing, vol. 72, no. 12, pp. 4771--4809.
Anita Zakrzewska, David Bader. 2016. “Tracking local communities in streaming graphs with a dynamic algorithm.” Social Network Analysis and Mining, vol. 6, no. 1, pp. 65:1--16.
James P. Fairbanks, Ramakrishnan Kannan, Haesun Park, David Bader. 2015. “Behavioral clusters in dynamic graphs.” Parallel Computing, vol. 47, pp. 38--50.
David Bader. 2015. “Editor's Note.” IEEE Transactions on Parallel and Distributed Systems, vol. 26, no. 1, pp. 1.
Jeremy Kepner, David Bader, Aydın Buluç, John Gilbert, Timothy Mattson, Henning Meyerhenke. 2015. “Graphs, Matrices, and the GraphBLAS: Seven Good Reasons.” Procedia Computer Science, vol. 51, pp. 2453--2462.
James P. Fairbanks, Geoffrey D. Sanders, David Bader. 2015. “Spectral Partitioning with Blends of Eigenvectors.” CoRR, vol. abs/1510.04658.
David Bader. 2015. “State of the Journal.” IEEE Transactions on Computers, vol. 64, no. 6, pp. 1506--1508.
Yunpeng Chai, Zhihui Du, Xiao Qin, David Bader. 2015. “WEC: Improving Durability of SSD Cache Drives by Caching Write-Efficient Data.” IEEE Transactions on Computers, vol. 64, no. 11, pp. 3304--3316.
David Bader, Petra Mutzel. 2014. “Introduction to Special Issue ALENEX'12.” ACM Journal of Experimental Algorithmics, vol. 19, no. 1.
Tim Mattson, David Bader, Jonathan W. Berry, Aydin Bulu\cc, Jack J. Dongarra, Christos Faloutsos, John Feo, John R. Gilbert, Joseph Gonzalez, Bruce Hendrickson, Jeremy Kepner, Charles E. Leiserson, Andrew Lumsdaine, David A. Padua, Stephen W. Poole, Steven P. Reinhardt, Mike Stonebraker, Steve Wallach, Andrew Yoo. 2014. “Standards for Graph Algorithm Primitives.” CoRR, vol. abs/1408.0393, pp. 1--2.
David Bader. 2014. “State of the Journal.” IEEE Transactions on Parallel and Distributed Systems, vol. 25, no. 1, pp. 1.
Robert McColl, David Ediger, Jason Poovey, Dan Campbell, David Bader. 2013. “A Brief Study of Open Source Graph Databases.” CoRR, vol. abs/1309.2675.
Oded Green, David Bader. 2013. “Faster Betweenness Centrality Based on Data Structure Experimentation.” Procedia Computer Science, vol. 18, pp. 399--408.
David Ediger, Karl Jiang, E. Jason Riedy, David Bader. 2013. “GraphCT: Multithreaded Algorithms for Massive Graph Analysis.” IEEE Transactions on Parallel \& Distributed Systems, vol. 24, no. 11, pp. 2220--2229.
E. Jason Riedy, David Bader. 2013. “Massive streaming data analytics: a graph-based approach.” ACM Crossroads, vol. 19, no. 3, pp. 37--43.
Xing Liu, Pushkar R. Pande, Henning Meyerhenke, David Bader. 2013. “PASQUAL: Parallel Techniques for Next Generation Genome Sequence Assembly.” IEEE Transactions on Parallel \& Distributed Systems, vol. 24, no. 5, pp. 977--986.
Zhaoming Yin, Jijun Tang, Stephen W. Schaeffer, David Bader. 2013. “Streaming Breakpoint Graph Analytics for Accelerating and Parallelizing the Computation of DCJ Median of Three Genomes.” Procedia Computer Science, vol. 18, pp. 561--570.
Shel Swenson, Yogesh Simmhan, Viktor K. Prasanna, Manish Parashar, E. Jason Riedy, David Bader, Richard W. Vuduc. 2013. “Sustainable Software Development for Next-Gen Sequencing (NGS) Bioinformatics on Emerging Platforms.” CoRR, vol. abs/1309.1828.
David Bader, Philippas Tsigas. 2012. “ACM journal on experimental algorithmics special issue on multicore algorithms.” ACM Journal of Experimental Algorithmics, vol. 17, no. 1, pp. 1.
Yunpeng Chai, Zhihui Du, David Bader, Xiao Qin. 2012. “Efficient Data Migration to Conserve Energy in Streaming Media Storage Systems.” IEEE Transactions on Parallel \& Distributed Systems, vol. 23, no. 11, pp. 2081--2093.
M. Shel Swenson, Joshua Anderson, Andrew Ash, Prashant Gaurav, Zsuzsanna Sükösd, David Bader, Stephen C. Harvey, Christine E. Heitsch. 2012. “GTfold: Enabling parallel RNA secondary structure prediction on multi-core desktops.” BMC Research Notes, vol. 5, pp. 341--347.
Seunghwa Kang, David Ediger, David Bader. 2011. “Algorithm Engineering Challenges in Multicore and Manycore Systems.” it - Information Technology, vol. 53, no. 6, pp. 266--273.
Yin Ye, Zhihui Du, David Bader. 2011. “GPUMemSort: A High Performance Graphic Co-processors Sorting Algorithm for Large Scale In-Memory Data.” GSTF International Journal on Computing, vol. 1, no. 2, pp. 23--28.
David Bader, David R. Kaeli, Volodymyr V. Kindratenko. 2011. “Guest Editor's Introduction: Special Issue on High-Performance Computing with Accelerators.” IEEE Transactions on Parallel and Distributed Systems, vol. 22, no. 1, pp. 3--6.
Mingyu Chen, David Bader. 2011. “On the random access performance of Cell Broadband Engine with graph analysis application.” CoRR, vol. abs/1105.5881.
Seunghwa Kang, Jijun Tang, Stephen W. Schaeffer, David Bader. 2011. “Rec-DCM-Eigen: Reconstructing a Less Parsimonious but More Accurate Tree in Shorter Time.” PLOS ONE, vol. 6, no. 8, pp. 1--12.
David Bader, Virat Agarwal, Seunghwa Kang. 2009. “Computing discrete transforms on the Cell Broadband Engine.” Parallel Computing, vol. 35, no. 3, pp. 119--137.
Virat Agarwal, David Bader, Lin Dan, Lurng-Kuo Liu, Davide Pasetto, Michael Perrone, Fabrizio Petrini. 2009. “Faster FAST: multicore acceleration of streaming financial data.” Computer Science - Research and Development, vol. 23, no. 3-4, pp. 249--257.
David Bader, Kamesh Madduri. 2008. “A graph-theoretic analysis of the human protein-interaction network using multicore parallel algorithms.” Parallel Computing, vol. 34, no. 11, pp. 627--639.
David Bader, Srinivas Aluru. 2008. “Guest editorial: High-performance computational biology.” Parallel Computing, vol. 34, no. 11, pp. 613--615.
Sagar Dhakal, Majeed M. Hayat, Jorge E. Pezoa, Cundong Yang, David Bader. 2007. “Dynamic Load Balancing in Distributed Systems in the Presence of Delays: A Regeneration-Theory Approach.” IEEE Transactions on Parallel \& Distributed Systems, vol. 18, no. 4, pp. 485--497.
David Bader, Virat Agarwal, Kamesh Madduri, Seunghwa Kang. 2007. “High performance combinatorial algorithm design on the Cell Broadband Engine processor.” Parallel Computing, vol. 33, no. 10-11, pp. 720--740.
Diana H. P. Low, Bharadwaj Veeravalli, David Bader. 2007. “On the design of high-performance algorithms for aligning multiple protein sequences on mesh-based multiprocessor architectures.” Journal of Parallel and Distributed Computing, vol. 67, no. 9, pp. 1007--1017.
David Bader, Usman W. Roshan, Alexandros Stamatakis. 2006. “Computational Grand Challenges in Assembling the Tree of Life: Problems and Solutions.” Advances in Computers, vol. 68, pp. 127--176.
Guojing Cong, David Bader. 2006. “Designing irregular parallel algorithms with mutual exclusion and lock-free protocols.” Journal of Parallel and Distributed Computing, vol. 66, no. 6, pp. 854--866.
David Bader, K. Madduri, J. R. Gilbert, V. Shah, J. Kepner, T. Meuse, A. Krishnamurthy. 2006. “Designing Scalable Synthetic Compact Applications for Benchmarking High Productivity Computing Systems.” CTWatch Quarterly, vol. 2, no. 4B, pp. 41--51.
Srinivas Aluru, Nancy M. Amato, David Bader. 2006. “Editorial: Special Section on High-Performance Computational Biology.” IEEE Transactions on Parallel and Distributed Systems, vol. 17, no. 8, pp. 737--739.
David Bader, Guojing Cong. 2006. “Fast shared-memory algorithms for computing the minimum spanning forest of sparse graphs.” Journal of Parallel and Distributed Computing, vol. 66, no. 11, pp. 1366--1378.
David Bader, Guojing Cong. 2005. “A fast, parallel spanning tree algorithm for symmetric multiprocessors (SMPs).” Journal of Parallel and Distributed Computing, vol. 65, no. 9, pp. 994--1006.
Marc Snir, David Bader. 2004. “A Framework for Measuring Supercomputer Productivity.” International Journal of High Performance Computing Applications, vol. 18, no. 4, pp. 417--432.
David Bader. 2004. “An improved, randomized algorithm for parallel selection with an experimental study.” Journal of Parallel and Distributed Computing, vol. 64, no. 9, pp. 1051--1059.
David Bader. 2004. “Computational biology and high-performance computing.” Communications of the ACM, vol. 47, no. 11, pp. 34--41.
David Bader, Srinivas Aluru. 2004. “Special Issue: High Performance Computational Biology.” Concurrency and Computation: Practice and Experience, vol. 16, no. 9, pp. 817--821.
Srinivas Aluru, David Bader. 2003. “Guest Editor's Introduction: Special issue on high-performance computational biology.” Journal of Parallel and Distributed Computing, vol. 63, no. 7-8, pp. 671--673.
Bernard M. E. Moret, David Bader, Tandy J. Warnow. 2002. “High-Performance Algorithm Engineering for Computational Phylogenetics.” The Journal of Supercomputing, vol. 22, no. 1, pp. 99--111.
Yuzhong Sun, Xiaola Lin, Yi Pan, R. W. H. Lau, David Bader, P. Y. S. Cheung. 2002. “Generalized block shift network for clusters.” IEEE Transactions on Circuits and Systems I: Fundamental Theory and Applications, vol. 49, no. 4, pp. 543--546.
David Bader, Bernard M. E. Moret, Mi Yan. 2001. “A Linear-Time Algorithm for Computing Inversion Distance Between Two Signed Permutations with an Experimental Study.” Journal of Computational Biology, vol. 8, no. 5, pp. 483--491.
David Bader, Rob Pennington. 2001. “Applications.” IJHPCA, vol. 15, no. 2, pp. 181--185.
David Bader, Robert Pennington. 2001. “Cluster Computing: Applications.” The International Journal of High Performance Computing Applications, vol. 15, no. 2, pp. 181--186.
Satya Kalluri, Joseph JaJa, David Bader, John Townshend, Joseph Jájá, Hassan Fallahadl, Zengyan Zhang, Hassan Fallah-adl. 2000. “High performance computing algorithms for land cover dynamics using remote sensing data.” International Journal of Remote Sensing, vol. 21, no. 6-7, pp. 1513--1536.
Zengyan Zhang, Joseph F. JaJa, David Bader, Satya N. V. Kalluri, Huiping Song, Nazmi El Saleous, Eric Vermote, John R. G. Townshend. 2000. “Kronos: A software system for the processing and retrieval of large-scale AVHRR data sets.” PE \& RS - Photogrammetric Engineering and Remote Sensing, vol. 66, pp. 1073--1082.
David Bader. 1999. “A New, Architectural Paradigm for High-performance Computing.” Scalable Computing: Practice and Experience, vol. 2, no. 2.
David Bader, Joseph JaJa. 1999. “SIMPLE: A Methodology for Programming High Performance Algorithms on Clusters of Symmetric Multiprocessors (SMPs).” Journal of Parallel and Distributed Computing, vol. 58, no. 1, pp. 92--108.
David R. Helman, Joseph JaJa, David Bader. 1998. “A New Deterministic Parallel Sorting Algorithm with an Experimental Evaluation.” ACM Journal of Experimental Algorithmics, vol. 3, no. 4, pp. 1--24.
David R. Helman, David Bader, Joseph JaJa. 1998. “A Randomized Parallel Sorting Algorithm with an Experimental Study.” Journal of Parallel and Distributed Computing, vol. 52, no. 1, pp. 1--23.
David Bader, Joseph JaJa, David Harwood, Larry S. Davis. 1996. “Parallel algorithms for image enhancement and segmentation by region growing, with an experimental study.” The Journal of Supercomputing, vol. 10, no. 2, pp. 141--168.
David Bader, Joseph JaJa. 1996. “Parallel Algorithms for Image Histogramming and Connected Components with an Experimental Study.” Journal of Parallel and Distributed Computing, vol. 35, no. 2, pp. 173--190.
David Bader, David R. Helman, Joseph JaJa. 1996. “Practical Parallel Algorithms for Personalized Communication and Integer Sorting.” ACM Journal of Experimental Algorithmics, vol. 1, no. 3, pp. 1--42.
David Bader, Joseph JaJa, Rama Chellappa. 1995. “Scalable data parallel algorithms for texture synthesis using Gibbs random fields.” IEEE Transactions on Image Processing, vol. 4, no. 10, pp. 1456--1460.
COLLAPSE
Academic Blog Posts
“GraphBLAS and GraphChallenge Advance Network Frontiers”
SIAM News, October (4th Quarter/Autumn) 2022.
SIAM News, October (4th Quarter/Autumn) 2022.
Chapter
Zhihui Du, Oliver Alvarado Rodriguez, Joseph Patchett, David Bader. 2022. “Interactive Graph Analytics at Scale in Arkouda.” In David A. Bader (Eds.), Massive Graph Analytics pp. 549--589. Chapman & Hall / CRC Press, 2022.
David Bader, Kamesh Madduri. 2019. “High-Performance Phylogenetic Inference.” In Warnow, Tandy (Eds.), pp. 39--45. Cham, : Springer International Publishing, 2019.
David Bader, Andrea Kappes, Henning Meyerhenke, Peter Sanders, Christian Schulz, Dorothea Wagner. 2018. “Benchmarking for Graph Clustering and Partitioning.” In Alhajj, Reda; Rokne, Jon (Eds.), New York, : Springer, 2018.
David Bader. 2016. “Engineering Algorithms for Computational Biology.” In Kao, Ming-Yang (Eds.), pp. 628--630. New York, : Springer, 2016.
David Bader. 2016. “High Performance Algorithm Engineering for Large-Scale Problems.” In Kao, Ming-Yang (Eds.), pp. 914--918. Berlin, : Springer, 2016.
David Bader, Kamesh Madduri. 2019. “High-Performance Phylogenetic Inference.” In Warnow, Tandy (Eds.), pp. 39--45. Cham, : Springer International Publishing, 2019.
David Bader, Andrea Kappes, Henning Meyerhenke, Peter Sanders, Christian Schulz, Dorothea Wagner. 2018. “Benchmarking for Graph Clustering and Partitioning.” In Alhajj, Reda; Rokne, Jon (Eds.), New York, : Springer, 2018.
David Bader. 2016. “Engineering Algorithms for Computational Biology.” In Kao, Ming-Yang (Eds.), pp. 628--630. New York, : Springer, 2016.
David Bader. 2016. “High Performance Algorithm Engineering for Large-Scale Problems.” In Kao, Ming-Yang (Eds.), pp. 914--918. Berlin, : Springer, 2016.
SHOW MORE
David Bader. 2016. “Sorting Signed Permutations by Reversal (Reversal Distance).” In Kao, Ming-Yang (Eds.), pp. 2026--2028. New York, : Springer, 2016.
David Bader, Henning Meyerhenke, Peter Sanders, Christian Schulz, Andrea Kappes, Dorothea Wagner. 2014. “Benchmarking for Graph Clustering and Partitioning.” In Alhajj, Reda; Rokne, Jon (Eds.), pp. 73--82. New York, : Springer, 2014.
Seunghwa Kang, Nitin Arora, Aashay Shringarpure, Richard W. Vuduc, David Bader. 2013. “Evaluating Multicore Processors and Accelerators for Dense Numerical Computations.” In Rajasekaran, Sanguthevar; Fiondella, Lance; Ahmed, Mohamed; Ammar, Reda A. (Eds.), pp. 241--280. New York, : Chapman \& Hall, 2013.
E. Jason Riedy, Henning Meyerhenke, David Ediger, David Bader. 2013. “Parallel Community Detection for Massive Graphs.” In Bader, David A.; Meyerhenke, Henning; Sanders, Peter; Wagner, Dorothea (Eds.), pp. 207--222. Providence, RI, : American Mathematical Society, 2013.
E. Jason Riedy, Henning Meyerhenke, David Ediger, David Bader. 2013. “Parallel community detection for massive graphs.” In Bader, David A.; Meyerhenke, Henning; Sanders, Peter; Wagner, Dorothea (Eds.), pp. 207--222. Providence, RI, : AMC, 2013.
David Bader, Kamesh Madduri. 2012. “Computational Challenges in Emerging Combinatorial Scientific Computing Applications.” In Naumann, Uwe; Schenk, Olaf (Eds.), pp. 471--494. New York, : Chapman \& Hall, 2012.
Jeremy Kepner, David Bader, Robert Bond, Nadya Bliss, Christos Faloutsos, Bruce Hendrickson, John Gilbert, Eric Robinson. 2011. “Fundamental Questions in the Analysis of Large Graphs.” In Kepner, Jeremy; Gilbert, John R. (Eds.), pp. 353--357. Philadelphia, PA, : SIAM, 2011.
David Bader, Guojing Cong. 2011. “Graph Algorithms.” In Padua, David (Eds.), pp. 796--805. Boston, MA, : Springer, 2011.
Guojing Cong, David Bader. 2011. “Hybrid Programming With SIMPLE.” In Padua, David (Eds.), pp. 851--860. Boston, MA, : Springer, 2011.
David Bader, Christine Heitsch, Kamesh Madduri. 2011. “Large-Scale Network Analysis.” In Kepner, Jeremy; Gilbert, John R. (Eds.), pp. 253--285. Philadelphia, PA, : SIAM, 2011.
David Bader, Guojing Cong. 2011. “Spanning Tree, Minimum Weight.” In Padua, David (Eds.), pp. 1870--1877. Boston, MA, : Springer, 2011.
David Bader, Guojing Cong. 2011. “SWARM: A Parallel Programming Framework for Multicore Processors.” In Padua, David (Eds.), pp. 1966--1971. Boston, MA, : Springer, 2011.
David Bader, Virat Agarwal, Kamesh Madduri, Fabrizio Petrini. 2010. “Combinatorial Algorithm Design on the Cell/B.E. Processor.” In Kurzak, Jakub; Bader, David A.; Dongarra, Jack (Eds.), pp. 195--216. Boca Raton, : CRC Press, 2010.
Virat Agarwal, David Bader. 2010. “Designing Fast Fourier Transform for the IBM Cell Broadband Engine.” In Kurzak, Jakub; Bader, David A.; Dongarra, Jack (Eds.), pp. 151--170. Boca Raton, : CRC Press, 2010.
Virat Agarwal, Lin Duan, Lurng-Kuo Liu, Michael Perrone, Fabrizio Petrini, Davide Pasetto, David Bader. 2010. “The Case of the Fast Financial Feed.” In Gavrilovska, Ada (Eds.), pp. 305--328. New York, : Chapman \& Hall, 2010.
David Bader. 2008. “Engineering Algorithms for Computational Biology.” In Kao, Ming-Yang (Eds.), Boston, MA, : Springer, 2008.
David Bader. 2008. “High Performance Algorithm Engineering for Large-scale Problems.” In Kao, Ming-Yang (Eds.), pp. 914--918. Berlin, : Springer, 2008.
David Bader. 2008. “Sorting Signed Permutations by Reversal (Reversal Distance).” In Kao, Ming-Yang (Eds.), Boston, MA, : Springer, 2008.
David Bader, Kamesh Madduri, Guojing Cong, John Feo. 2007. “Design of Multithreaded Algorithms for Combinatorial Problems.” In Rajasekaran, Sanguthevar; Reif, John (Eds.), pp. 1--30. New York, : Chapman and Hall, 2007.
David Bader, Guojing Cong. 2007. “Efficient Parallel Graph Algorithms for Shared-memory Multiprocessors.” In Rajasekaran, Sanguthevar; Reif, John (Eds.), pp. 1--40. New York, : Chapman and Hall, 2007.
Kamesh Madduri, c, Jonathan W. Berry, Joseph R. Crobak. 2007. “Multithreaded Algorithms for Processing Massive Graphs.” In Bader, David A. (Eds.), pp. 1--26. New York, : Chapman \& Hall, 2007.
Srinivas Aluru, Nancy Amato, David Bader, Suchindra Bhandarkar, Laxmikant Kale, Dan C. Marinescu. 2006. “Parallel Computational Biology.” In Heroux, Michael A.; Raghavan, Padma; Simon, Horst D. (Eds.), pp. 357--378. Philadelphia, PA, : SIAM, 2006.
David Bader, Mi Yan. 2005. “High-Performance Algorithms for Phylogeny Reconstruction with Maximum Parsimony.” In Aluru, Srinivas (Eds.), pp. 1--19. New York, : Chapman \& Hall, 2005.
Tiffani L. Williams, David Bader, Bernard M. E. Moret, Mi Yan. 2005. “High-Performance Phylogeny Reconstruction Under Maximum Parsimony.” In Zomaya, Albert Y. (Eds.), pp. 369--394. Hoboken, NJ, : John Wiley \& Sons, 2005.
David Bader, William E. Hart, Cynthia A. Phillips. 2005. “Parallel Algorithm Design for Branch and Bound.” In Greenberg, H. J. (Eds.), pp. 1--44. New York, : Springer, 2005.
David Bader, Bernard M. E. Moret, Peter Sanders. 2002. “Algorithm Engineering for Parallel Computation.” In Fleischer, Rudolf; Moret, Bernard; Schmidt, Erik Meineche (Eds.), pp. 1--23. Berlin, : Springer, 2002.
David Bader, Henning Meyerhenke, Peter Sanders, Christian Schulz, Andrea Kappes, Dorothea Wagner. 2014. “Benchmarking for Graph Clustering and Partitioning.” In Alhajj, Reda; Rokne, Jon (Eds.), pp. 73--82. New York, : Springer, 2014.
Seunghwa Kang, Nitin Arora, Aashay Shringarpure, Richard W. Vuduc, David Bader. 2013. “Evaluating Multicore Processors and Accelerators for Dense Numerical Computations.” In Rajasekaran, Sanguthevar; Fiondella, Lance; Ahmed, Mohamed; Ammar, Reda A. (Eds.), pp. 241--280. New York, : Chapman \& Hall, 2013.
E. Jason Riedy, Henning Meyerhenke, David Ediger, David Bader. 2013. “Parallel Community Detection for Massive Graphs.” In Bader, David A.; Meyerhenke, Henning; Sanders, Peter; Wagner, Dorothea (Eds.), pp. 207--222. Providence, RI, : American Mathematical Society, 2013.
E. Jason Riedy, Henning Meyerhenke, David Ediger, David Bader. 2013. “Parallel community detection for massive graphs.” In Bader, David A.; Meyerhenke, Henning; Sanders, Peter; Wagner, Dorothea (Eds.), pp. 207--222. Providence, RI, : AMC, 2013.
David Bader, Kamesh Madduri. 2012. “Computational Challenges in Emerging Combinatorial Scientific Computing Applications.” In Naumann, Uwe; Schenk, Olaf (Eds.), pp. 471--494. New York, : Chapman \& Hall, 2012.
Jeremy Kepner, David Bader, Robert Bond, Nadya Bliss, Christos Faloutsos, Bruce Hendrickson, John Gilbert, Eric Robinson. 2011. “Fundamental Questions in the Analysis of Large Graphs.” In Kepner, Jeremy; Gilbert, John R. (Eds.), pp. 353--357. Philadelphia, PA, : SIAM, 2011.
David Bader, Guojing Cong. 2011. “Graph Algorithms.” In Padua, David (Eds.), pp. 796--805. Boston, MA, : Springer, 2011.
Guojing Cong, David Bader. 2011. “Hybrid Programming With SIMPLE.” In Padua, David (Eds.), pp. 851--860. Boston, MA, : Springer, 2011.
David Bader, Christine Heitsch, Kamesh Madduri. 2011. “Large-Scale Network Analysis.” In Kepner, Jeremy; Gilbert, John R. (Eds.), pp. 253--285. Philadelphia, PA, : SIAM, 2011.
David Bader, Guojing Cong. 2011. “Spanning Tree, Minimum Weight.” In Padua, David (Eds.), pp. 1870--1877. Boston, MA, : Springer, 2011.
David Bader, Guojing Cong. 2011. “SWARM: A Parallel Programming Framework for Multicore Processors.” In Padua, David (Eds.), pp. 1966--1971. Boston, MA, : Springer, 2011.
David Bader, Virat Agarwal, Kamesh Madduri, Fabrizio Petrini. 2010. “Combinatorial Algorithm Design on the Cell/B.E. Processor.” In Kurzak, Jakub; Bader, David A.; Dongarra, Jack (Eds.), pp. 195--216. Boca Raton, : CRC Press, 2010.
Virat Agarwal, David Bader. 2010. “Designing Fast Fourier Transform for the IBM Cell Broadband Engine.” In Kurzak, Jakub; Bader, David A.; Dongarra, Jack (Eds.), pp. 151--170. Boca Raton, : CRC Press, 2010.
Virat Agarwal, Lin Duan, Lurng-Kuo Liu, Michael Perrone, Fabrizio Petrini, Davide Pasetto, David Bader. 2010. “The Case of the Fast Financial Feed.” In Gavrilovska, Ada (Eds.), pp. 305--328. New York, : Chapman \& Hall, 2010.
David Bader. 2008. “Engineering Algorithms for Computational Biology.” In Kao, Ming-Yang (Eds.), Boston, MA, : Springer, 2008.
David Bader. 2008. “High Performance Algorithm Engineering for Large-scale Problems.” In Kao, Ming-Yang (Eds.), pp. 914--918. Berlin, : Springer, 2008.
David Bader. 2008. “Sorting Signed Permutations by Reversal (Reversal Distance).” In Kao, Ming-Yang (Eds.), Boston, MA, : Springer, 2008.
David Bader, Kamesh Madduri, Guojing Cong, John Feo. 2007. “Design of Multithreaded Algorithms for Combinatorial Problems.” In Rajasekaran, Sanguthevar; Reif, John (Eds.), pp. 1--30. New York, : Chapman and Hall, 2007.
David Bader, Guojing Cong. 2007. “Efficient Parallel Graph Algorithms for Shared-memory Multiprocessors.” In Rajasekaran, Sanguthevar; Reif, John (Eds.), pp. 1--40. New York, : Chapman and Hall, 2007.
Kamesh Madduri, c, Jonathan W. Berry, Joseph R. Crobak. 2007. “Multithreaded Algorithms for Processing Massive Graphs.” In Bader, David A. (Eds.), pp. 1--26. New York, : Chapman \& Hall, 2007.
Srinivas Aluru, Nancy Amato, David Bader, Suchindra Bhandarkar, Laxmikant Kale, Dan C. Marinescu. 2006. “Parallel Computational Biology.” In Heroux, Michael A.; Raghavan, Padma; Simon, Horst D. (Eds.), pp. 357--378. Philadelphia, PA, : SIAM, 2006.
David Bader, Mi Yan. 2005. “High-Performance Algorithms for Phylogeny Reconstruction with Maximum Parsimony.” In Aluru, Srinivas (Eds.), pp. 1--19. New York, : Chapman \& Hall, 2005.
Tiffani L. Williams, David Bader, Bernard M. E. Moret, Mi Yan. 2005. “High-Performance Phylogeny Reconstruction Under Maximum Parsimony.” In Zomaya, Albert Y. (Eds.), pp. 369--394. Hoboken, NJ, : John Wiley \& Sons, 2005.
David Bader, William E. Hart, Cynthia A. Phillips. 2005. “Parallel Algorithm Design for Branch and Bound.” In Greenberg, H. J. (Eds.), pp. 1--44. New York, : Springer, 2005.
David Bader, Bernard M. E. Moret, Peter Sanders. 2002. “Algorithm Engineering for Parallel Computation.” In Fleischer, Rudolf; Moret, Bernard; Schmidt, Erik Meineche (Eds.), pp. 1--23. Berlin, : Springer, 2002.
COLLAPSE
Book
David Bader. 2022. “Massive Graph Analytics.” 616 pp. CRC Press / Chapman and Hall, 2022. ISBN 9780367464127.
Conference Proceeding
“Anti-Section Transitive Closure”
IEEE, December 2021.
“A GraphBLAS implementation of Triangle Centrality”
IEEE, September 2021.
“Enabling Exploratory Large Scale Graph Analytics through Arkouda”
IEEE, September 2021.
“K-Truss Implementation in Arkouda (Extended Abstract)”
IEEE, September 2021.
“Large Scale String Analytics In Arkouda”
IEEE, September 2021.
IEEE, December 2021.
“A GraphBLAS implementation of Triangle Centrality”
IEEE, September 2021.
“Enabling Exploratory Large Scale Graph Analytics through Arkouda”
IEEE, September 2021.
“K-Truss Implementation in Arkouda (Extended Abstract)”
IEEE, September 2021.
“Large Scale String Analytics In Arkouda”
IEEE, September 2021.
SHOW MORE
“Exploratory Large Scale Graph Analytics in Arkouda”
June 2021.
“LAGraph: Linear Algebra, Network Analysis Libraries, and the Study of Graph Algorithms”
IEEE Computer Society, May 2021.
“QoS-Aware and Fault-Tolerant Replica Placement”
Springer, October (4th Quarter/Autumn) 2020.
“A 2-Approximation Algorithm for QoS-Aware and Fault-Tolerant Replica Placement”
IEEE, September 2020.
“GPU Accelerated Anomaly Detection of Large Scale Light Curves”
IEEE, September 2020.
“Using RAPIDS AI to Accelerate Graph Data Science Workflows”
IEEE, September 2020.
“Accelerating and Expanding End-to-End Data Science Workflows with DL/ML Interoperability Using RAPIDS”
ACM, August 2020.
“Performance Impact of Memory Channels on Sparse and Irregular Algorithms”
IEEE/ACM, November 2019.
“Skip the Intersection: Quickly Counting Common Neighbors on Shared-Memory Systems”
IEEE, September 2019.
“A New Algorithm Model for Massive-Scale Streaming Graph Analysis”
Sociedad Española de Matemática Aplicada, July (3rd Quarter/Summer) 2019.
“Fast and Adaptive List Intersections on the GPU”
IEEE Computer Society, 2018.
“Hornet: An Efficient Data Structure for Dynamic Sparse Graphs and Matrices on GPUs”
IEEE Computer Society, 2018.
“Introduction to HiCOMB 2018”
IEEE Computer Society, 2018.
“Logarithmic Radix Binning and Vectorized Triangle Counting”
IEEE Computer Society, 2018.
“Massive-scale Streaming Analytics: Models, Parallelism, & Real-world Applications”
ACM, 2018.
“Ranking in Dynamic Graphs Using Exponential Centrality”
Springer, 2018.
“Scalable Katz Ranking Computation in Large Static and Dynamic Graphs”
Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik, 2018.
“A New Algorithmic Model for Graph Analysis of Streaming Data”
August 2018.
“A Dynamic Algorithm for Updating Katz Centrality in Graphs”
ACM, 2017.
“Approximating Personalized Katz Centrality in Dynamic Graphs”
Springer, 2017.
“Design and implementation of parallel PageRank on multicore platforms”
IEEE Computer Society, 2017.
“Exact and Parallel Triangle Counting in Dynamic Graphs”
IEEE Computer Society, 2017.
“Introduction to EMBRACE Workshop”
IEEE Computer Society, 2017.
“Proceedings of the Sixteenth IEEE International Workshop on High Performance Computational Biology (HiCOMB 2017), Orlando, FL, May 2017.”
IEEE Computer Society Press, 2017.
“Quickly finding a truss in a haystack”
IEEE Computer Society, 2017.
“Streaming Graph Sampling with Size Restrictions”
ACM, 2017.
“When Good Enough Is Better: Energy-Aware Scheduling for Multicore Servers”
IEEE Computer Society, 2017.
“A local measure of community change in dynamic graphs”
IEEE Computer Society, 2016.
“A Memory and Time Scalable Parallelization of the Reptile Error-Correction Code”
IEEE Computer Society, 2016.
“Aging data in dynamic graphs: A comparative study”
IEEE Computer Society, 2016.
“cuSTINGER: Supporting dynamic graph algorithms for GPUs”
IEEE Computer Society, 2016.
“GABB 2016 Keynote”
IEEE Computer Society, 2016.
“HiCOMB Introduction and Committees”
IEEE Computer Society, 2016.
“Mathematical foundations of the GraphBLAS”
IEEE Computer Society, 2016.
“New stopping criteria for spectral partitioning”
IEEE Computer Society, 2016.
“Semantic database applications at the Samtavro Cemetery, Georgia”
Archaeopress, 2016.
“A Dynamic Algorithm for Local Community Detection in Graphs”
ACM, 2015.
“A fast, energy-efficient abstraction for simultaneous breadth-first searches”
IEEE Computer Society, 2015.
“A Methodology for Co-Location Aware Application Performance Modeling in Multicore Computing”
IEEE Computer Society, 2015.
“Fast Execution of Simultaneous Breadth-First Searches on Sparse Graphs”
IEEE Computer Society, 2015.
“Fast Incremental Community Detection on Dynamic Graphs”
Springer, 2015.
“HiCOMB Introduction and Committees”
IEEE Computer Society, 2015.
“Parallel Methods for Verifying the Consistency of Weakly-Ordered Architectures”
IEEE Computer Society, 2015.
“ParLearning Keynotes”
IEEE Computer Society, 2015.
“A Lin-Kernighan Heuristic for the DCJ Median Problem of Genomes with Unequal Contents”
Springer, 2014.
“A performance evaluation of open source graph databases”
ACM, 2014.
“Designing a Heuristic Cross-Architecture Combination for Breadth-First Search”
IEEE Computer Society, 2014.
“GABB Introduction”
IEEE Computer Society, 2014.
“HiCOMB Introduction and Committees”
IEEE Computer Society, 2014.
“Load balanced clustering coefficients”
ACM, 2014.
“Optimizing energy consumption and parallel performance for static and dynamic betweenness centrality using GPUs”
IEEE Computer Society, 2014.
“Revisiting Edge and Node Parallelism for Dynamic GPU Graph Analytics”
ACM, 2014.
“Scalable and High Performance Betweenness Centrality on the GPU”
IEEE Computer Society, 2014.
“A new parallel algorithm for connected components in dynamic graphs”
IEEE Computer Society, 2013.
“A statistical framework for streaming graph analysis”
ACM, 2013.
“Designing Hybrid Architectures for Massive-Scale Graph Analysis”
IEEE Computer Society, 2013.
“Detecting insider threats in a real corporate database of computer usage activity”
ACM, 2013.
“Energy-Efficient Scheduling for Best-Effort Interactive Services to Achieve High Response Quality”
IEEE Computer Society, 2013.
“Faster Clustering Coefficient Using Vertex Covers”
IEEE Computer Society, 2013.
“HiCOMB Introduction”
IEEE Computer Society, 2013.
“Investigating Graph Algorithms in the BSP Model on the Cray XMT”
IEEE Computer Society, 2013.
“Measuring the Sensitivity of Graph Metrics to Missing Data”
Springer, 2013.
“Multithreaded Community Monitoring for Massive Streaming Graph Data”
IEEE Computer Society, 2013.
“Standards for graph algorithm primitives”
IEEE Computer Society, 2013.
“A Fast Algorithm for Streaming Betweenness Centrality”
IEEE Computer Society, 2012.
“Analysis of streaming social networks and graphs on multicore architectures”
IEEE Computer Society, 2012.
“Enhancing Cache Coherent Architectures with access patterns for embedded manycore systems”
IEEE Computer Society, 2012.
“GPU Merge Path: A GPU Merging Algorithm”
ACM, 2012.
“HCW 2012 Keynote Talk: Analyzing massive data using heterogeneous computing”
IEEE Computer Society, 2012.
“HiCOMB Introduction”
IEEE Computer Society, 2012.
“Proceedings of the 14th Meeting on Algorithm Engineering \& Experiments, ALENEX 2012, The Westin Miyako, Kyoto, Japan, January 16, 2012”
SIAM, 2012.
“Scalable Multi-threaded Community Detection in Social Networks”
IEEE Computer Society, 2012.
“STINGER: High performance data structure for streaming graphs”
IEEE Computer Society, 2012.
“Task-based parallel breadth-first search in heterogeneous environments”
IEEE Computer Society, 2012.
“A Waterfall Model to Achieve Energy Efficient Tasks Mapping for Large Scale GPU Clusters”
IEEE Computer Society, 2011.
“HiCOMB Introduction”
IEEE Computer Society, 2011.
“Parallel Community Detection for Massive Graphs”
Springer, 2011.
“Semantic Databases and Supercomputers”
2011.
“Tracking Structure of Streaming Social Networks”
IEEE Computer Society, 2011.
“Analyzing Massive Social Networks Using Multicore and Multithreaded Architectures”
Springer, 2010.
“Evaluating Cell/B.E software cache for ClustalW”
2010.
“GPUMemSort: A High Performance Graphic Co-processors Sorting Algorithm for Large Scale In-Memory Data”
2010.
“HiCOMB 2010: Message from the workshop chairs”
IEEE Computer Society, 2010.
“Large scale complex network analysis using the hybrid combination of a MapReduce cluster and a highly multithreaded system”
IEEE Computer Society, 2010.
“Massive Social Network Analysis: Mining Twitter for Social Good”
IEEE Computer Society, 2010.
“Massive streaming data analytics: A case study with clustering coefficients”
IEEE Computer Society, 2010.
“Message from general chair”
IEEE Computer Society, 2010.
“On accelerating iterative algorithms with CUDA: A case study on Conditional Random Fields training algorithm for biological sequence alignment”
IEEE Computer Society, 2010.
“Scalable Graph Exploration on Multicore Processors”
IEEE Computer Society, 2010.
“A faster parallel algorithm and efficient multithreaded implementations for evaluating betweenness centrality on massive datasets”
IEEE Computer Society, 2009.
“A Partition-Merge Based Cache-Conscious Parallel Sorting Algorithm for CMP with Shared Cache”
IEEE Computer Society, 2009.
“An efficient transactional memory algorithm for computing minimum spanning forest of sparse graphs”
ACM, 2009.
“Compact graph representations and parallel connectivity algorithms for massive dynamic network analysis”
IEEE Computer Society, 2009.
“Faster FAST: Multicore Acceleration of Streaming Financial Data”
2009.
“Generalizing k-Betweenness Centrality Using Short Paths and a Parallel Multithreaded Implementation”
IEEE Computer Society, 2009.
“GTfold: a scalable multicore code for RNA secondary structure prediction”
ACM, 2009.
“Proceedings of the Eighth IEEE International Workshop on High Performance Computational Biology (HiCOMB 2009), Rome, Italy, May 2009.”
IEEE Computer Society Press, 2009.
“Simulating Individual-Based Models of Epidemics in Hierarchical Networks”
Springer, 2009.
“Understanding the design trade-offs among current multicore systems for numerical computations”
IEEE Computer Society, 2009.
“A Prediction Based CMP Cache Migration Policy”
IEEE Computer Society, 2008.
“DOSA: design optimizer for scientific applications”
IEEE Computer Society, 2008.
“Financial modeling on the cell broadband engine”
IEEE Computer Society, 2008.
“High performance MPEG-2 software decoder on the cell broadband engine”
IEEE Computer Society, 2008.
“On the Design of Fast Pseudo-Random Number Generators for the Cell Broadband Engine and an Application to Risk Analysis”
IEEE Computer Society, 2008.
“Optimizing JPEG2000 Still Image Encoding on the Cell Broadband Engine”
IEEE Computer Society, 2008.
“Petascale Computing for Large-Scale Graph Problems”
Springer, 2008.
“Proceedings of the Seventh IEEE International Workshop on High Performance Computational Biology (HiCOMB 2008), Miami, FL, April 2008.”
IEEE Computer Society Press, 2008.
“SNAP, Small-world Network Analysis and Partitioning: An open-source parallel graph framework for the exploration of large-scale networks”
IEEE Computer Society, 2008.
“A Graph-Theoretic Analysis of the Human Protein-Interaction Network Using Multicore Parallel Algorithms”
IEEE Computer Society, 2007.
“Advanced Shortest Paths Algorithms on a Massively-Multithreaded Architecture”
IEEE Computer Society, 2007.
“An Experimental Study of A Parallel Shortest Path Algorithm for Solving Large-Scale Graph Instances”
SIAM, 2007.
“Approximating Betweenness Centrality”
Springer, 2007.
“DOSA: Design Optimizer for Scientific Applications”
IEEE Computer Society, 2007.
“FFTC: Fastest Fourier Transform for the IBM Cell Broadband Engine”
Springer, 2007.
“High-Performance Combinatorial Techniques for Analyzing Massive Dynamic Interaction Networks”
2007.
“On the Design and Analysis of Irregular Algorithms on the Cell Processor: A Case Study of List Ranking”
IEEE Computer Society, 2007.
“Petascale Computing for Large-Scale Graph Problems”
Springer, 2007.
“Petascale Computing for Large-Scale Graph Problems”
IEEE Computer Society, 2007.
“Proceedings of the Sixth IEEE International Workshop on High Performance Computational Biology (HiCOMB 2007), Long Beach, CA, April 2007.”
IEEE Computer Society Press, 2007.
“SWARM: A Parallel Programming Framework for Multicore Processors”
IEEE Computer Society, 2007.
“Symposium Evening Tutorial: High-performance Computing Methods for Computational Genomics”
IEEE Computer Society, 2007.
“Techniques for Designing Efficient Parallel Graph Algorithms for SMPs and Multicore Processors”
Springer, 2007.
“Lecture on Progress toward Petascale Applications in Bioinformatics and Computational Biology”
IEEE Computer Society, October (4th Quarter/Autumn) 2007.
“Designing Multithreaded Algorithms for Breadth-First Search and st-connectivity on the Cray MTA-2”
IEEE Computer Society, 2006.
“Efficient Implementation of Irregular Algorithms on Cell Multi-core Architecture. Poster Session.”
2006.
“ExactMP: An Efficient Parallel Exact Solver for Phylogenetic Tree Reconstruction Using Maximum Parsimony”
IEEE Computer Society, 2006.
“High-performance computing methods for computational genomics”
ACM, 2006.
“Parallel Algorithms for Evaluating Centrality Indices in Real-world Networks”
IEEE Computer Society, 2006.
“Parallel Shortest Path Algorithms for Solving Large-Scale Instances”
American Mathematical Society, 2006.
“Performance analysis of parallel programs via message-passing graph traversal”
IEEE Computer Society, 2006.
“Proceedings of the Fifth IEEE International Workshop on High Performance Computational Biology (HiCOMB 2006), Rhodes Island, Greece, April 2006.”
IEEE Computer Society Press, 2006.
“A Cache-Aware Parallel Implementation of the Push-Relabel Network Flow Algorithm and Experimental Evaluation of the Gap Relabeling Heuristic”
International Society for Computers and Their Applications, 2005.
“An Empirical Analysis of Parallel Random Permutation Algorithms on SMPs”
International Society for Computers and Their Applications, 2005.
“An Experimental Study of Parallel Biconnected Components Algorithms on Symmetric Multiprocessors (SMPs)”
IEEE Computer Society, 2005.
“BioPerf: a benchmark suite to evaluate high-performance computer architecture on bioinformatics applications”
IEEE Computer Society, 2005.
“BioSPLASH: A sample workload from bioinformatics and computational biology for optimizing next-generation high-performance computer systems. Poster Session.”
2005.
“Design and Implementation of the HPCS Graph Analysis Benchmark on Symmetric Multiprocessors”
Berlin, 2005.
“High Performance Computing - HiPC 2005, 12th International Conference, Goa, India, December 18-21, 2005, Proceedings”
Springer, 2005.
“High-Performance Algorithm Engineering for Large-Scale Graph Problems and Computational Biology”
Springer, 2005.
“Incorporating life sciences applications in the architectural optimizations of next-generation petaflop-system”
IEEE Computer Society, 2005.
“On the Architectural Requirements for Efficient Execution of Graph Algorithms”
IEEEE Computer Society, 2005.
“Proceedings of the Fourth IEEE International Workshop on High Performance Computational Biology (HiCOMB 2005), Denver, CO, April 2005.”
IEEE Computer Society Press, 2005.
“A Fast, Parallel Spanning Tree Algorithm for Symmetric Multiprocessors (SMPs)”
IEEE Computer Society, 2004.
“A Novel FDTD Application Featuring OpenMP-MPI Hybrid Parallelization”
IEEE Computer Society, 2004.
“A Parallel State Assignment Algorithm for Finite State Machines”
Springer, 2004.
“Fast Shared-Memory Algorithms for Computing the Minimum Spanning Forest of Sparse Graphs”
IEEE Computer Society, 2004.
“High Performance Bioinformatics”
Springer, 2004.
“Lock-Free Parallel Algorithms: An Experimental Study”
Springer, 2004.
“Proceedings of the ISCA 17th International Conference on Parallel and Distributed Computing Systems, September 15-17, 2004, The Canterbury Hotel, San Francisco, California, USA”
ISCA, 2004.
“Proceedings of the Third IEEE International Workshop on High Performance Computational Biology (HiCOMB 2004), Santa Fe, NM, April 2004.”
IEEE Computer Society Press, 2004.
“The Euler Tour Technique and Parallel Rooted Spanning Tree”
IEEE Computer Society, 2004.
“Proceedings of the ISCA 17th International Conference on Parallel and Distributed Computing Systems”
ISCA, September 2004.
“Proceedings of the Second IEEE International Workshop on High Performance Computational Biology (HiCOMB 2003), Nice, France, April 2003”
IEEE Computer Society Press, 2003.
“Broadcast on Clusters of SMPs with Optimal Concurrency”
CSREA Press, 2002.
“Evaluating Arithmetic Expressions Using Tree Contraction: A Fast and Scalable Parallel Implementation for Symmetric Multiprocessors (SMPs)”
Springer, 2002.
“HiCOMB 2002: Workshop Introduction”
IEEE Computer Society, 2002.
“A Linear-Time Algorithm for Computing Inversion Distance between Signed Permutations with an Experimental Study”
Springer, 2001.
“A New Implmentation and Detailed Study of Breakpoint Analysis”
WSPC, 2001.
“High-Performance Algorithm Engineering for Computational Phylogenetics”
Springer, 2001.
“Industrial applications of high-performance computing for phylogeny reconstruction”
Chapman and Hall, 2001.
“Using PRAM Algorithms on a Uniform-Memory-Access Shared-Memory Architecture”
Springer, 2001.
“Variation in vegetation growth rates: Implications for the evolution of semi-arid landscapes”
2001.
“An Improved Randomized Selection Algorithm With an Experimental Study”
2000.
“High-Performance Algorithms and Applications for SMP Clusters”
NASA, 2000.
“Tutorial A: Design and Analysis of High Performance Clusters”
IEEE Computer Society, 2000.
“A hierarchical data archiving and processing system to generate custom tailored products from AVHRR data”
IEEE Computer Society, 1999.
“Design and Analysis of the Alliance/University of New Mexico Roadrunner Linux SMP SuperCluster”
IEEE Computer Society, 1999.
“Parallel Algorithms for Image Enhancement and Segmentation by Region Growing with an Experimental Study”
IEEE Computer Society, 1996.
“Parallel Algorithms for Personalized Communication and Sorting with an Experimental Study (Extended Abstract)”
ACM, 1996.
“Practical Parallel Algorithms for Dynamic Data Redistribution, Median Finding, and Selection”
IEEE Computer Society, 1996.
“Parallel Algorithms for Image Histogramming and Connected Components with an Experimental Study”
ACM, 1995.
June 2021.
“LAGraph: Linear Algebra, Network Analysis Libraries, and the Study of Graph Algorithms”
IEEE Computer Society, May 2021.
“QoS-Aware and Fault-Tolerant Replica Placement”
Springer, October (4th Quarter/Autumn) 2020.
“A 2-Approximation Algorithm for QoS-Aware and Fault-Tolerant Replica Placement”
IEEE, September 2020.
“GPU Accelerated Anomaly Detection of Large Scale Light Curves”
IEEE, September 2020.
“Using RAPIDS AI to Accelerate Graph Data Science Workflows”
IEEE, September 2020.
“Accelerating and Expanding End-to-End Data Science Workflows with DL/ML Interoperability Using RAPIDS”
ACM, August 2020.
“Performance Impact of Memory Channels on Sparse and Irregular Algorithms”
IEEE/ACM, November 2019.
“Skip the Intersection: Quickly Counting Common Neighbors on Shared-Memory Systems”
IEEE, September 2019.
“A New Algorithm Model for Massive-Scale Streaming Graph Analysis”
Sociedad Española de Matemática Aplicada, July (3rd Quarter/Summer) 2019.
“Fast and Adaptive List Intersections on the GPU”
IEEE Computer Society, 2018.
“Hornet: An Efficient Data Structure for Dynamic Sparse Graphs and Matrices on GPUs”
IEEE Computer Society, 2018.
“Introduction to HiCOMB 2018”
IEEE Computer Society, 2018.
“Logarithmic Radix Binning and Vectorized Triangle Counting”
IEEE Computer Society, 2018.
“Massive-scale Streaming Analytics: Models, Parallelism, & Real-world Applications”
ACM, 2018.
“Ranking in Dynamic Graphs Using Exponential Centrality”
Springer, 2018.
“Scalable Katz Ranking Computation in Large Static and Dynamic Graphs”
Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik, 2018.
“A New Algorithmic Model for Graph Analysis of Streaming Data”
August 2018.
“A Dynamic Algorithm for Updating Katz Centrality in Graphs”
ACM, 2017.
“Approximating Personalized Katz Centrality in Dynamic Graphs”
Springer, 2017.
“Design and implementation of parallel PageRank on multicore platforms”
IEEE Computer Society, 2017.
“Exact and Parallel Triangle Counting in Dynamic Graphs”
IEEE Computer Society, 2017.
“Introduction to EMBRACE Workshop”
IEEE Computer Society, 2017.
“Proceedings of the Sixteenth IEEE International Workshop on High Performance Computational Biology (HiCOMB 2017), Orlando, FL, May 2017.”
IEEE Computer Society Press, 2017.
“Quickly finding a truss in a haystack”
IEEE Computer Society, 2017.
“Streaming Graph Sampling with Size Restrictions”
ACM, 2017.
“When Good Enough Is Better: Energy-Aware Scheduling for Multicore Servers”
IEEE Computer Society, 2017.
“A local measure of community change in dynamic graphs”
IEEE Computer Society, 2016.
“A Memory and Time Scalable Parallelization of the Reptile Error-Correction Code”
IEEE Computer Society, 2016.
“Aging data in dynamic graphs: A comparative study”
IEEE Computer Society, 2016.
“cuSTINGER: Supporting dynamic graph algorithms for GPUs”
IEEE Computer Society, 2016.
“GABB 2016 Keynote”
IEEE Computer Society, 2016.
“HiCOMB Introduction and Committees”
IEEE Computer Society, 2016.
“Mathematical foundations of the GraphBLAS”
IEEE Computer Society, 2016.
“New stopping criteria for spectral partitioning”
IEEE Computer Society, 2016.
“Semantic database applications at the Samtavro Cemetery, Georgia”
Archaeopress, 2016.
“A Dynamic Algorithm for Local Community Detection in Graphs”
ACM, 2015.
“A fast, energy-efficient abstraction for simultaneous breadth-first searches”
IEEE Computer Society, 2015.
“A Methodology for Co-Location Aware Application Performance Modeling in Multicore Computing”
IEEE Computer Society, 2015.
“Fast Execution of Simultaneous Breadth-First Searches on Sparse Graphs”
IEEE Computer Society, 2015.
“Fast Incremental Community Detection on Dynamic Graphs”
Springer, 2015.
“HiCOMB Introduction and Committees”
IEEE Computer Society, 2015.
“Parallel Methods for Verifying the Consistency of Weakly-Ordered Architectures”
IEEE Computer Society, 2015.
“ParLearning Keynotes”
IEEE Computer Society, 2015.
“A Lin-Kernighan Heuristic for the DCJ Median Problem of Genomes with Unequal Contents”
Springer, 2014.
“A performance evaluation of open source graph databases”
ACM, 2014.
“Designing a Heuristic Cross-Architecture Combination for Breadth-First Search”
IEEE Computer Society, 2014.
“GABB Introduction”
IEEE Computer Society, 2014.
“HiCOMB Introduction and Committees”
IEEE Computer Society, 2014.
“Load balanced clustering coefficients”
ACM, 2014.
“Optimizing energy consumption and parallel performance for static and dynamic betweenness centrality using GPUs”
IEEE Computer Society, 2014.
“Revisiting Edge and Node Parallelism for Dynamic GPU Graph Analytics”
ACM, 2014.
“Scalable and High Performance Betweenness Centrality on the GPU”
IEEE Computer Society, 2014.
“A new parallel algorithm for connected components in dynamic graphs”
IEEE Computer Society, 2013.
“A statistical framework for streaming graph analysis”
ACM, 2013.
“Designing Hybrid Architectures for Massive-Scale Graph Analysis”
IEEE Computer Society, 2013.
“Detecting insider threats in a real corporate database of computer usage activity”
ACM, 2013.
“Energy-Efficient Scheduling for Best-Effort Interactive Services to Achieve High Response Quality”
IEEE Computer Society, 2013.
“Faster Clustering Coefficient Using Vertex Covers”
IEEE Computer Society, 2013.
“HiCOMB Introduction”
IEEE Computer Society, 2013.
“Investigating Graph Algorithms in the BSP Model on the Cray XMT”
IEEE Computer Society, 2013.
“Measuring the Sensitivity of Graph Metrics to Missing Data”
Springer, 2013.
“Multithreaded Community Monitoring for Massive Streaming Graph Data”
IEEE Computer Society, 2013.
“Standards for graph algorithm primitives”
IEEE Computer Society, 2013.
“A Fast Algorithm for Streaming Betweenness Centrality”
IEEE Computer Society, 2012.
“Analysis of streaming social networks and graphs on multicore architectures”
IEEE Computer Society, 2012.
“Enhancing Cache Coherent Architectures with access patterns for embedded manycore systems”
IEEE Computer Society, 2012.
“GPU Merge Path: A GPU Merging Algorithm”
ACM, 2012.
“HCW 2012 Keynote Talk: Analyzing massive data using heterogeneous computing”
IEEE Computer Society, 2012.
“HiCOMB Introduction”
IEEE Computer Society, 2012.
“Proceedings of the 14th Meeting on Algorithm Engineering \& Experiments, ALENEX 2012, The Westin Miyako, Kyoto, Japan, January 16, 2012”
SIAM, 2012.
“Scalable Multi-threaded Community Detection in Social Networks”
IEEE Computer Society, 2012.
“STINGER: High performance data structure for streaming graphs”
IEEE Computer Society, 2012.
“Task-based parallel breadth-first search in heterogeneous environments”
IEEE Computer Society, 2012.
“A Waterfall Model to Achieve Energy Efficient Tasks Mapping for Large Scale GPU Clusters”
IEEE Computer Society, 2011.
“HiCOMB Introduction”
IEEE Computer Society, 2011.
“Parallel Community Detection for Massive Graphs”
Springer, 2011.
“Semantic Databases and Supercomputers”
2011.
“Tracking Structure of Streaming Social Networks”
IEEE Computer Society, 2011.
“Analyzing Massive Social Networks Using Multicore and Multithreaded Architectures”
Springer, 2010.
“Evaluating Cell/B.E software cache for ClustalW”
2010.
“GPUMemSort: A High Performance Graphic Co-processors Sorting Algorithm for Large Scale In-Memory Data”
2010.
“HiCOMB 2010: Message from the workshop chairs”
IEEE Computer Society, 2010.
“Large scale complex network analysis using the hybrid combination of a MapReduce cluster and a highly multithreaded system”
IEEE Computer Society, 2010.
“Massive Social Network Analysis: Mining Twitter for Social Good”
IEEE Computer Society, 2010.
“Massive streaming data analytics: A case study with clustering coefficients”
IEEE Computer Society, 2010.
“Message from general chair”
IEEE Computer Society, 2010.
“On accelerating iterative algorithms with CUDA: A case study on Conditional Random Fields training algorithm for biological sequence alignment”
IEEE Computer Society, 2010.
“Scalable Graph Exploration on Multicore Processors”
IEEE Computer Society, 2010.
“A faster parallel algorithm and efficient multithreaded implementations for evaluating betweenness centrality on massive datasets”
IEEE Computer Society, 2009.
“A Partition-Merge Based Cache-Conscious Parallel Sorting Algorithm for CMP with Shared Cache”
IEEE Computer Society, 2009.
“An efficient transactional memory algorithm for computing minimum spanning forest of sparse graphs”
ACM, 2009.
“Compact graph representations and parallel connectivity algorithms for massive dynamic network analysis”
IEEE Computer Society, 2009.
“Faster FAST: Multicore Acceleration of Streaming Financial Data”
2009.
“Generalizing k-Betweenness Centrality Using Short Paths and a Parallel Multithreaded Implementation”
IEEE Computer Society, 2009.
“GTfold: a scalable multicore code for RNA secondary structure prediction”
ACM, 2009.
“Proceedings of the Eighth IEEE International Workshop on High Performance Computational Biology (HiCOMB 2009), Rome, Italy, May 2009.”
IEEE Computer Society Press, 2009.
“Simulating Individual-Based Models of Epidemics in Hierarchical Networks”
Springer, 2009.
“Understanding the design trade-offs among current multicore systems for numerical computations”
IEEE Computer Society, 2009.
“A Prediction Based CMP Cache Migration Policy”
IEEE Computer Society, 2008.
“DOSA: design optimizer for scientific applications”
IEEE Computer Society, 2008.
“Financial modeling on the cell broadband engine”
IEEE Computer Society, 2008.
“High performance MPEG-2 software decoder on the cell broadband engine”
IEEE Computer Society, 2008.
“On the Design of Fast Pseudo-Random Number Generators for the Cell Broadband Engine and an Application to Risk Analysis”
IEEE Computer Society, 2008.
“Optimizing JPEG2000 Still Image Encoding on the Cell Broadband Engine”
IEEE Computer Society, 2008.
“Petascale Computing for Large-Scale Graph Problems”
Springer, 2008.
“Proceedings of the Seventh IEEE International Workshop on High Performance Computational Biology (HiCOMB 2008), Miami, FL, April 2008.”
IEEE Computer Society Press, 2008.
“SNAP, Small-world Network Analysis and Partitioning: An open-source parallel graph framework for the exploration of large-scale networks”
IEEE Computer Society, 2008.
“A Graph-Theoretic Analysis of the Human Protein-Interaction Network Using Multicore Parallel Algorithms”
IEEE Computer Society, 2007.
“Advanced Shortest Paths Algorithms on a Massively-Multithreaded Architecture”
IEEE Computer Society, 2007.
“An Experimental Study of A Parallel Shortest Path Algorithm for Solving Large-Scale Graph Instances”
SIAM, 2007.
“Approximating Betweenness Centrality”
Springer, 2007.
“DOSA: Design Optimizer for Scientific Applications”
IEEE Computer Society, 2007.
“FFTC: Fastest Fourier Transform for the IBM Cell Broadband Engine”
Springer, 2007.
“High-Performance Combinatorial Techniques for Analyzing Massive Dynamic Interaction Networks”
2007.
“On the Design and Analysis of Irregular Algorithms on the Cell Processor: A Case Study of List Ranking”
IEEE Computer Society, 2007.
“Petascale Computing for Large-Scale Graph Problems”
Springer, 2007.
“Petascale Computing for Large-Scale Graph Problems”
IEEE Computer Society, 2007.
“Proceedings of the Sixth IEEE International Workshop on High Performance Computational Biology (HiCOMB 2007), Long Beach, CA, April 2007.”
IEEE Computer Society Press, 2007.
“SWARM: A Parallel Programming Framework for Multicore Processors”
IEEE Computer Society, 2007.
“Symposium Evening Tutorial: High-performance Computing Methods for Computational Genomics”
IEEE Computer Society, 2007.
“Techniques for Designing Efficient Parallel Graph Algorithms for SMPs and Multicore Processors”
Springer, 2007.
“Lecture on Progress toward Petascale Applications in Bioinformatics and Computational Biology”
IEEE Computer Society, October (4th Quarter/Autumn) 2007.
“Designing Multithreaded Algorithms for Breadth-First Search and st-connectivity on the Cray MTA-2”
IEEE Computer Society, 2006.
“Efficient Implementation of Irregular Algorithms on Cell Multi-core Architecture. Poster Session.”
2006.
“ExactMP: An Efficient Parallel Exact Solver for Phylogenetic Tree Reconstruction Using Maximum Parsimony”
IEEE Computer Society, 2006.
“High-performance computing methods for computational genomics”
ACM, 2006.
“Parallel Algorithms for Evaluating Centrality Indices in Real-world Networks”
IEEE Computer Society, 2006.
“Parallel Shortest Path Algorithms for Solving Large-Scale Instances”
American Mathematical Society, 2006.
“Performance analysis of parallel programs via message-passing graph traversal”
IEEE Computer Society, 2006.
“Proceedings of the Fifth IEEE International Workshop on High Performance Computational Biology (HiCOMB 2006), Rhodes Island, Greece, April 2006.”
IEEE Computer Society Press, 2006.
“A Cache-Aware Parallel Implementation of the Push-Relabel Network Flow Algorithm and Experimental Evaluation of the Gap Relabeling Heuristic”
International Society for Computers and Their Applications, 2005.
“An Empirical Analysis of Parallel Random Permutation Algorithms on SMPs”
International Society for Computers and Their Applications, 2005.
“An Experimental Study of Parallel Biconnected Components Algorithms on Symmetric Multiprocessors (SMPs)”
IEEE Computer Society, 2005.
“BioPerf: a benchmark suite to evaluate high-performance computer architecture on bioinformatics applications”
IEEE Computer Society, 2005.
“BioSPLASH: A sample workload from bioinformatics and computational biology for optimizing next-generation high-performance computer systems. Poster Session.”
2005.
“Design and Implementation of the HPCS Graph Analysis Benchmark on Symmetric Multiprocessors”
Berlin, 2005.
“High Performance Computing - HiPC 2005, 12th International Conference, Goa, India, December 18-21, 2005, Proceedings”
Springer, 2005.
“High-Performance Algorithm Engineering for Large-Scale Graph Problems and Computational Biology”
Springer, 2005.
“Incorporating life sciences applications in the architectural optimizations of next-generation petaflop-system”
IEEE Computer Society, 2005.
“On the Architectural Requirements for Efficient Execution of Graph Algorithms”
IEEEE Computer Society, 2005.
“Proceedings of the Fourth IEEE International Workshop on High Performance Computational Biology (HiCOMB 2005), Denver, CO, April 2005.”
IEEE Computer Society Press, 2005.
“A Fast, Parallel Spanning Tree Algorithm for Symmetric Multiprocessors (SMPs)”
IEEE Computer Society, 2004.
“A Novel FDTD Application Featuring OpenMP-MPI Hybrid Parallelization”
IEEE Computer Society, 2004.
“A Parallel State Assignment Algorithm for Finite State Machines”
Springer, 2004.
“Fast Shared-Memory Algorithms for Computing the Minimum Spanning Forest of Sparse Graphs”
IEEE Computer Society, 2004.
“High Performance Bioinformatics”
Springer, 2004.
“Lock-Free Parallel Algorithms: An Experimental Study”
Springer, 2004.
“Proceedings of the ISCA 17th International Conference on Parallel and Distributed Computing Systems, September 15-17, 2004, The Canterbury Hotel, San Francisco, California, USA”
ISCA, 2004.
“Proceedings of the Third IEEE International Workshop on High Performance Computational Biology (HiCOMB 2004), Santa Fe, NM, April 2004.”
IEEE Computer Society Press, 2004.
“The Euler Tour Technique and Parallel Rooted Spanning Tree”
IEEE Computer Society, 2004.
“Proceedings of the ISCA 17th International Conference on Parallel and Distributed Computing Systems”
ISCA, September 2004.
“Proceedings of the Second IEEE International Workshop on High Performance Computational Biology (HiCOMB 2003), Nice, France, April 2003”
IEEE Computer Society Press, 2003.
“Broadcast on Clusters of SMPs with Optimal Concurrency”
CSREA Press, 2002.
“Evaluating Arithmetic Expressions Using Tree Contraction: A Fast and Scalable Parallel Implementation for Symmetric Multiprocessors (SMPs)”
Springer, 2002.
“HiCOMB 2002: Workshop Introduction”
IEEE Computer Society, 2002.
“A Linear-Time Algorithm for Computing Inversion Distance between Signed Permutations with an Experimental Study”
Springer, 2001.
“A New Implmentation and Detailed Study of Breakpoint Analysis”
WSPC, 2001.
“High-Performance Algorithm Engineering for Computational Phylogenetics”
Springer, 2001.
“Industrial applications of high-performance computing for phylogeny reconstruction”
Chapman and Hall, 2001.
“Using PRAM Algorithms on a Uniform-Memory-Access Shared-Memory Architecture”
Springer, 2001.
“Variation in vegetation growth rates: Implications for the evolution of semi-arid landscapes”
2001.
“An Improved Randomized Selection Algorithm With an Experimental Study”
2000.
“High-Performance Algorithms and Applications for SMP Clusters”
NASA, 2000.
“Tutorial A: Design and Analysis of High Performance Clusters”
IEEE Computer Society, 2000.
“A hierarchical data archiving and processing system to generate custom tailored products from AVHRR data”
IEEE Computer Society, 1999.
“Design and Analysis of the Alliance/University of New Mexico Roadrunner Linux SMP SuperCluster”
IEEE Computer Society, 1999.
“Parallel Algorithms for Image Enhancement and Segmentation by Region Growing with an Experimental Study”
IEEE Computer Society, 1996.
“Parallel Algorithms for Personalized Communication and Sorting with an Experimental Study (Extended Abstract)”
ACM, 1996.
“Practical Parallel Algorithms for Dynamic Data Redistribution, Median Finding, and Selection”
IEEE Computer Society, 1996.
“Parallel Algorithms for Image Histogramming and Connected Components with an Experimental Study”
ACM, 1995.
COLLAPSE
Other
“Proceedings of the 20th IEEE International Workshop on High Performance Computational Biology (HiCOMB 2021)”
IEEE Computer Society, May 2021.
“Proceedings of the 19th IEEE International Workshop on High Performance Computational Biology (HiCOMB 2020)”
IEEE Computer Society, May 2020.
“Graph Partitioning and Graph Clustering”
American Mathematical Society, 2013.
“Scientific Computing with Multi-core and Accelerators”
Chapman & Hall, 2010.
“Petascale Computing: Algorithms and Applications”
Chapman & Hall, 2007.
“On the Design and Analysis of Practical Parallel Algorithms for Combinatorial Problems with Applications to Image Processing”
The University of Maryland, 1996.
IEEE Computer Society, May 2021.
“Proceedings of the 19th IEEE International Workshop on High Performance Computational Biology (HiCOMB 2020)”
IEEE Computer Society, May 2020.
“Graph Partitioning and Graph Clustering”
American Mathematical Society, 2013.
“Scientific Computing with Multi-core and Accelerators”
Chapman & Hall, 2010.
“Petascale Computing: Algorithms and Applications”
Chapman & Hall, 2007.
“On the Design and Analysis of Practical Parallel Algorithms for Combinatorial Problems with Applications to Image Processing”
The University of Maryland, 1996.
Professional
Steering Committee, Workshop on Graphs, Architectures, Programming, and Learning (GrAPL)
Committee Member, 2020
Northeast Big Data Innovation Hub, Seed Fund Steering Committee
Committee Chair, 2020
ACM Transactions on Parallel Computing
Editor, Journal Editor, 2018
The International Heterogeneity in Computing Workshop (HCW) Steering Committee
Committee Member, 2018
IEEE Computer Society, Technical Consortium on High Performance Computing
Committee Member, 2016
Committee Member, 2020
Northeast Big Data Innovation Hub, Seed Fund Steering Committee
Committee Chair, 2020
ACM Transactions on Parallel Computing
Editor, Journal Editor, 2018
The International Heterogeneity in Computing Workshop (HCW) Steering Committee
Committee Member, 2018
IEEE Computer Society, Technical Consortium on High Performance Computing
Committee Member, 2016
SHOW MORE
SIAM Meeting on Algorithm Engineering and Experiments (ALENEX) Steering Committee
Committee Member, 2012
The International Supercomputing Conference (ISC), Steering Committee
Committee Member, 2012
The International Symposium on Experimental Algorithms (SEA) Steering Committee
Committee Member, 2005
ACM Journal of Experimental Algorithmics
Editor, Associate Editor, 2003
IEEE International Conference on High Performance Computing (HiPC) Steering Committee
Committee Member, 2002
IEEE International Parallel and Distributed Processing Symposium (IPDPS) Steering Committee
Committee Member, 2002
IEEE Computer Society, Fellows Evaluation Committee
Committee Member, 2021
2021 Data Science Leadership Summit
Committee Member, 2021
The 25th IEEE High Performance Extreme Computing Conference (HPEC)
Committee Member, 2021
IEEE International Parallel and Distributed Processing Symposium (IPDPS), General Co-Chair
Conference-Related, 2021
1st ACM International Conference on AI in Finance
Committee Member, 2020
Committee Member, 2012
The International Supercomputing Conference (ISC), Steering Committee
Committee Member, 2012
The International Symposium on Experimental Algorithms (SEA) Steering Committee
Committee Member, 2005
ACM Journal of Experimental Algorithmics
Editor, Associate Editor, 2003
IEEE International Conference on High Performance Computing (HiPC) Steering Committee
Committee Member, 2002
IEEE International Parallel and Distributed Processing Symposium (IPDPS) Steering Committee
Committee Member, 2002
IEEE Computer Society, Fellows Evaluation Committee
Committee Member, 2021
2021 Data Science Leadership Summit
Committee Member, 2021
The 25th IEEE High Performance Extreme Computing Conference (HPEC)
Committee Member, 2021
IEEE International Parallel and Distributed Processing Symposium (IPDPS), General Co-Chair
Conference-Related, 2021
1st ACM International Conference on AI in Finance
Committee Member, 2020
COLLAPSE