World's Best Scientists 2026 revealed!

D-Index & Metrics

Computer Science

D-Index
45
Citations
8028
World Ranking
7217
National Ranking
3151

Overview

Aydin Buluc is affiliated with the Lawrence Berkeley National Laboratory in the United States. Their research spans a range of interdisciplinary fields primarily within computer science and biochemistry, genetics, and molecular biology.

The main fields of study for Aydin Buluc include:

  • Computer Science
  • Biochemistry, Genetics and Molecular Biology

Their work further extends into subfields such as:

  • Molecular Biology
  • Computer Networks and Communications
  • Artificial Intelligence
  • Computer Vision and Pattern Recognition
  • Plant Science

Aydin Buluc's research topics cover a range of focused areas, including:

  • Genomics and Phylogenetic Studies
  • Graph Theory and Algorithms
  • Advanced Graph Neural Networks
  • Stochastic Gradient Optimization Techniques
  • Algorithms and Data Compression
  • Caching and Content Delivery
  • Bioinformatics and Genomic Networks

The scientist has published frequently in the following venues:

  • arXiv (Cornell University)
  • bioRxiv (Cold Spring Harbor Laboratory)
  • 2022 IEEE International Parallel and Distributed Processing Symposium Workshops (IPDPSW)
  • ACM Transactions on Parallel Computing
  • INFORMS Journal on Computing

Recent papers authored or co-authored by Aydin Buluc include:

  • "Critical Assessment of Metagenome Interpretation: the second round of challenges" (2022, Nature Methods)
  • "GraphBLAST: A High-Performance Linear Algebra-based Graph Framework on the GPU" (2022, ACM Transactions on Mathematical Software)
  • "Terabase-scale metagenome coassembly with MetaHipMer" (2020, Scientific Reports)
  • "Critical Assessment of Metagenome Interpretation - the second round of challenges" (2021, bioRxiv (Cold Spring Harbor Laboratory))
  • "ADEPT: a domain independent sequence alignment strategy for gpu architectures" (2020, BMC Bioinformatics)

Frequent collaborators in Aydin Buluc's research include:

  • Oğuz Selvitopi
  • Ariful Azad
  • Leonid Oliker
  • Katherine Yelick
  • Steven Hofmeyr

Best Publications

  • Parallel sparse matrix-vector and matrix-transpose-vector multiplication using compressed sparse blocks

    Aydin Buluç;Jeremy T. Fineman;Matteo Frigo;John R. Gilbert

  • The Combinatorial BLAS: design, implementation, and applications

    Aydın Buluç;John R Gilbert

  • Recent Advances in Graph Partitioning

    Aydın Buluç;Henning Meyerhenke;Ilya Safro;Peter Sanders

  • Parallel breadth-first search on distributed memory systems

    Aydin Buluc;Kamesh Madduri

  • A whole-genome shotgun approach for assembling and anchoring the hexaploid bread wheat genome

    Jarrod A Chapman;Martin Mascher;Aydın Buluç;Kerrie Barry

  • On the representation and multiplication of hypersparse matrices

    A. Buluc;J.R. Gilbert

  • Mathematical foundations of the GraphBLAS

    Jeremy Kepner;Peter Aaltonen;David Bader;Aydin Buluc

  • Parallel Sparse Matrix-Matrix Multiplication and Indexing: Implementation and Experiments

    Aydin Buluç;John R. Gilbert

  • Mathematical Foundations of the GraphBLAS

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

  • Solving path problems on the GPU

    Aydın Buluç;John R. Gilbert;Ceren Budak

  • Parallel Triangle Counting and Enumeration Using Matrix Algebra

    Ariful Azad;Aydin Buluc;John Gilbert

  • HipMCL: a high-performance parallel implementation of the Markov clustering algorithm for large-scale networks.

    Ariful Azad;Georgios A Pavlopoulos;Christos A Ouzounis;Nikos C Kyrpides

  • Challenges and Advances in Parallel Sparse Matrix-Matrix Multiplication

    A. Buluc;J.R. Gilbert

  • Reduced-Bandwidth Multithreaded Algorithms for Sparse Matrix-Vector Multiplication

    Aydin Buluç;Samuel Williams;Leonid Oliker;James Demmel

  • Standards for graph algorithm primitives

    Tim Mattson;David Bader;Jon Berry;Aydin Buluc

  • Exploiting Multiple Levels of Parallelism in Sparse Matrix-Matrix Multiplication

    Ariful Azad;Grey Ballard;Aydin Buluç;James Demmel

  • Design Principles for Sparse Matrix Multiplication on the GPU

    Carl Yang;Aydın Buluç;John D. Owens

  • Optimizing Sparse Matrix-Multiple Vectors Multiplication for Nuclear Configuration Interaction Calculations

    Hasan Metin Aktulga;Aydin Buluç;Samuel Williams;Chao Yang

  • Communication optimal parallel multiplication of sparse random matrices

    Grey Ballard;Aydin Buluc;James Demmel;Laura Grigori

  • Parallel de bruijn graph construction and traversal for de novo genome assembly

    Evangelos Georganas;Aydin Buluc;Jarrod Chapman;Leonid Oliker

  • Distributed Memory Breadth-First Search Revisited: Enabling Bottom-Up Search

    Scott Beamer;Aydin Buluc;Krste Asanovic;David Patterson

  • Reducing Communication in Graph Neural Network Training

    Alok Tripathy;Katherine Yelick;Aydin Buluc

  • Parallel Sparse Matrix-Matrix Multiplication and Indexing: Implementation and Experiments

    Aydin Buluc;John Gilbert

Frequent Co-Authors

Katherine Yelick
Katherine Yelick University of California, Berkeley
John R. Gilbert
John R. Gilbert University of California, Santa Barbara
Leonid Oliker
Leonid Oliker Lawrence Berkeley National Laboratory
Daniel S. Rokhsar
Daniel S. Rokhsar University of California, Berkeley
John D. Owens
John D. Owens University of California, Davis
James Demmel
James Demmel University of California, Berkeley
José E. Moreira
José E. Moreira IBM (United States)
Samuel Williams
Samuel Williams Lawrence Berkeley National Laboratory
David A. Bader
David A. Bader New Jersey Institute of Technology

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

Aspiring computer science students have more options than ever to advance their education and career online. Many choose to supplement their studies with specializations such as artificial intelligence or business administration, opening doors to diverse, high-paying tech roles.

For those seeking affordability, consider an mba online cheap program to gain business leadership skills alongside technical expertise. If you’re looking for a fast track, explore 1 year online masters options for quick and intensive upskilling.

Not all high-earning roles require lengthy degrees. There are several easy degrees to get online that pay well, providing practical knowledge and in-demand credentials for agile learners. Additionally, specializing with an ai degree online can position you for lucrative roles in an ever-expanding tech industry.

By exploring these flexible online pathways, students can balance their education, gain specialized skills, and accelerate their career growth in computer science and related fields.

Best Scientists Citing Aydin Buluc

Trending Scientists

Recently Published Articles