Aydın Buluç

Computational Research Division
Computer and Data Sciences
Mailstop 50A-1148
Lawrence Berkeley National Laboratory
Contact:

I am a Research Scientist at the Lawrence Berkeley National Lab, working on high-performance graph analysis and libraries, parallel sparse matrix computations, communication-avoiding algorithms, with applications in computational genomics and neuroscience. Previously, I was an Alvarez Fellow.

I obtained my Ph.D. from UC Santa Barbara in Computer Science. My advisor was John R. Gilbert. My unusually shallow genealogy includes only three lineal ascendants. You can pronounce my first name like this. The "ı" in my first name is a lowercase dotless i ({\i} in LaTeX, ı in HTML and U+0131 in UTF-8).

Recent News

We are running the Graph Algorithms Building Blocks (GABB) workshop at IPDPS this year. Papers will be peer reviewed and published by IEEE CS Press. Deadline is Jan 29, 2015.

EDGAR: Energy-efficient Data and Graph Algorithms Research

The Graph BLAS Forum is an effort to define standard building blocks for graph algorithms in the language of linear algebra.

Check out the new ACM Transactions on Parallel Computing