Aydın Buluç

Computational Research Division
Computer Science Department
Mailstop 59R4104
Lawrence Berkeley National Laboratory
Contact:

I am a staff scientist at the Lawrence Berkeley National Lab and adjunct assistant professor of EECS at UC Berkeley. I work on high-performance graph analysis and libraries, parallel sparse matrix computations, communication-avoiding algorithms, with applications in computational genomics and biology. Previously, I was an Alvarez Fellow.

I obtained my Ph.D. from UC Santa Barbara in Computer Science. 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).


Current Projects: EDGAR, ExaBiome, ExaGraph, BINOCULARS, and THOR.

Teaching: In Spring 2018, I am team teaching CS267: Applications of Parallel Computers with Jim Demmel and Kathy Yelick.

Jobs: Postdoctoral opportunity in our group: direct link.

-- Here is an accessible article about the GraphBLAS effort (accompanied with three unpleasant pictures). More info, including a reference implementation by Tim Davis and the C language API can be found in the GraphBLAS Forum website (standard building blocks for graph algorithms in the language of matrices).

-- HipMCL clusters protein similarity networks with 70 billion edges in a couple of hours. This highly-scalable implementation of the Markov Cluster algorithm is available open source.