World's Best Scientists 2026 revealed!

D-Index & Metrics

Computer Science

D-Index
59
Citations
13139
World Ranking
3441
National Ranking
1662

Research.com Recognitions

  • 2019 - SIAM Fellow For contributions in high-performance algorithms and streaming analytics, and for leadership in the field of computational science.
  • 2011 - Fellow of the American Association for the Advancement of Science (AAAS)

Overview

David A. Bader is affiliated with the New Jersey Institute of Technology in the United States. Their research primarily falls within the field of Computer Science, with a focus on several subfields including Artificial Intelligence, Computer Networks and Communications, Computer Vision and Pattern Recognition, Hardware and Architecture, and Statistical and Nonlinear Physics.

The scientist's work spans multiple main topics, notably Advanced Graph Neural Networks, Graph Theory and Algorithms, Complex Network Analysis Techniques, Algorithms and Data Compression, Network Packet Processing and Optimization, Parallel Computing and Optimization Techniques, and Quantum Computing Algorithms and Architecture.

Frequent collaboration is evident through coauthors such as Zhihui Du, Oliver Alvarado Rodriguez, Fuhuan Li, Palina Pauliuchenka, and Mohammad Dindoost. Publication venues where their work appears regularly include arXiv (Cornell University), Algorithms, Proceedings of the VLDB Endowment, PRX Quantum, and ACM Journal of Experimental Algorithmics.

Selected recent papers authored or coauthored by David A. Bader include:

  • Traversing large graphs on GPUs with unified memory, 2020, Proceedings of the VLDB Endowment
  • Interactive Graph Stream Analytics in Arkouda, 2021, Algorithms
  • End-To-End Resource Analysis for Quantum Interior-Point Methods and Portfolio Optimization, 2023, PRX Quantum
  • Scalable Katz Ranking Computation in Large Static and Dynamic Graphs, 2022, ACM Journal of Experimental Algorithmics
  • Anomaly Detection in Catalog Streams, 2022, IEEE Transactions on Big Data

David A. Bader has been recognized with awards including being named a SIAM Fellow in 2019 for contributions in high-performance algorithms and streaming analytics, and leadership in computational science. In 2011, they were honored as a Fellow of the American Association for the Advancement of Science (AAAS).

Best Publications

  • Applications

    Unknown

  • A linear-time algorithm for computing inversion distance between signed permutations with an experimental study.

    David A. Bader;Bernard M. E. Moret;Mi Yan

  • Approximating betweenness centrality

    David A. Bader;Shiva Kintali;Kamesh Madduri;Milena Mihail

  • Scalable Graph Exploration on Multicore Processors

    Virat Agarwal;Fabrizio Petrini;Davide Pasetto;David A. Bader

  • Designing Multithreaded Algorithms for Breadth-First Search and st-connectivity on the Cray MTA-2

    D.A. Bader;K. Madduri

  • Parallel Algorithms for Evaluating Centrality Indices in Real-world Networks

    D.A. Bader;K. Madduri

  • STINGER: High performance data structure for streaming graphs

    David Ediger;Rob McColl;Jason Riedy;David A. Bader

  • Graph Partitioning and Graph Clustering

    David Bader;Henning Meyerhenke;Peter Sanders;Dorothea Wagner

  • A faster parallel algorithm and efficient multithreaded implementations for evaluating betweenness centrality on massive datasets

    Kamesh Madduri;David Ediger;Karl Jiang;David A. Bader

  • Mathematical foundations of the GraphBLAS

    Jeremy Kepner;Peter Aaltonen;David Bader;Aydin Buluc

  • Massive Social Network Analysis: Mining Twitter for Social Good

    David Ediger;Karl Jiang;Jason Riedy;David A. Bader

  • A new implementation and detailed study of breakpoint analysis.

    Bernard M. E. Moret;Stacia K. Wyman;David A. Bader;Tandy J. Warnow

  • Design and implementation of the HPCS graph analysis benchmark on symmetric multiprocessors

    David A. Bader;Kamesh Madduri

  • A fast, parallel spanning tree algorithm for symmetric multiprocessors (SMPs)

    David A. Bader;Guojing Cong

  • SNAP, Small-world Network Analysis and Partitioning: An open-source parallel graph framework for the exploration of large-scale networks

    D.A. Bader;K. Madduri

  • Fast shared-memory algorithms for computing the minimum spanning forest of sparse graphs

    David A. Bader;Guojing Cong

  • Mathematical Foundations of the GraphBLAS

    Jeremy Kepner;Peter Aaltonen;David Bader;Aydın Buluc

  • Detecting insider threats in a real corporate database of computer usage activity

    Ted E. Senator;Henry G. Goldberg;Alex Memory;William T. Young

  • Dynamic Load Balancing in Distributed Systems in the Presence of Delays: A Regeneration-Theory Approach

    Sagar Dhakal;Majeed M. Hayat;Jorge E. Pezoa;Cundong Yang

  • GPU merge path: a GPU merging algorithm

    Oded Green;Robert McColl;David A. Bader

  • Benchmarking for Graph Clustering and Partitioning

    David A. Bader;Henning Meyerhenke;Peter Sanders;Christian Schulz

Frequent Co-Authors

Joseph JaJa
Joseph JaJa University of Maryland, College Park
Bernard M. E. Moret
Bernard M. E. Moret École Polytechnique Fédérale de Lausanne
Srinivas Aluru
Srinivas Aluru Georgia Institute of Technology
Viktor K. Prasanna
Viktor K. Prasanna University of Southern California
Jijun Tang
Jijun Tang University of South Carolina
Aydin Buluc
Aydin Buluc Lawrence Berkeley National Laboratory
Manish Parashar
Manish Parashar University of Utah
John R. Gilbert
John R. Gilbert University of California, Santa Barbara
Tandy Warnow
Tandy Warnow University of Illinois at Urbana-Champaign

If you think any of the details on this page are incorrect, let us know.

Report an issue

We appreciate your kind effort to assist us to improve this page, it would be helpful providing us with as much detail as possible in the text box below:

Related Online Degrees & Career Pathways

Exploring Computer Science in the USA opens doors to a variety of related fields and flexible online programs. Many students consider blending their CS studies with disciplines such as engineering, physics, or data science to broaden their career options.

For those interested in sustainability and technology, an online environmental engineering degree offers a path into sectors addressing environmental challenges through innovation. If you're looking for strong technical foundations in design and mechanics, the cheapest online mechanical engineering degree programs combine affordability and career potential in manufacturing, robotics, and beyond.

Students curious about the theoretical underpinnings of computation and technology might consider online physics degrees, which develop problem-solving skills applicable to diverse tech roles. Meanwhile, those wanting to work with big data, analytics, or AI can pursue a data science degree to meet the demands of this rapidly growing industry.

Comparing these related options can help you choose a degree that matches your interests and enhances your job opportunities after graduation.

Best Scientists Citing David A. Bader

Trending Scientists