|
[1]
|
Adam Lugowski, David Alber, Aydin Buluç, John Gilbert, Steve Reinhardt,
Yun Teng, and Andrew Waranis.
A flexible open-source toolbox for scalable complex graph analysis.
In SIAM Conference on Data Mining (SDM), 2012.
[ bib |
.pdf |
Abstract ]
|
|
[2]
|
Aydin Buluç and John R. Gilbert.
Parallel sparse matrix-matrix multiplication and indexing:
Implementation and experiments.
SIAM Journal of Scientific Computing (SISC), To appear, 2012.
Preprint available at ArXiv.
[ bib ]
|
|
[3]
|
Aydin Buluç and Kamesh Madduri.
Parallel breadth-first search on distributed memory systems.
In Proc. Supercomputing, 2011.
[ bib |
DOI |
arXiv |
.pdf ]
|
|
[4]
|
Edgar Solomonik, Aydin Buluç, and James Demmel.
Minimizing communication in all-pairs shortest-paths.
Technical Report UCB/EECS-2012-19, EECS Department, University of
California, Berkeley, Feb 2012.
[ bib |
.html ]
|
|
[5]
|
Aydin Buluç and Kamesh Madduri.
Graph partitioning for scalable distributed graph computations.
In The 10th DIMACS Implementation Challenge Workshop, 2012.
[ bib |
.pdf ]
|
|
[6]
|
Adam Lugowski, Aydin Buluç, John R. Gilbert, and Steve Reinhardt.
Scalable complex graph analysis with the knowledge discovery toolbox.
In ICASSP, Special session on “Big Data”, 2012.
[ bib |
.pdf ]
|
|
[7]
|
Aydin Buluç, Samuel Williams, Leonid Oliker, and James Demmel.
Reduced-bandwidth multithreaded algorithms for sparse matrix-vector
multiplication.
In Proc. IPDPS, 2011.
[ bib |
.pdf ]
|
|
[8]
|
Aydin Buluç and John R. Gilbert.
The Combinatorial BLAS: Design, implementation, and applications.
The International Journal of High Performance Computing
Applications, 2011.
[ bib |
DOI |
.pdf |
|
|
[9]
|
Aydin Buluç, John R. Gilbert, and Viral B. Shah.
Implementing Sparse Matrices for Graph Algorithms.
In Jeremy Kepner and John R. Gilbert, editors, Graph Algorithms
in the Language of Linear Algebra. SIAM Press, 2011.
[ bib |
Order ]
|
|
[10]
|
Aydin Buluç and John R. Gilbert.
New Ideas in Sparse Matrix-Matrix Multiplication.
In Jeremy Kepner and John R. Gilbert, editors, Graph Algorithms
in the Language of Linear Algebra. SIAM Press, 2011.
[ bib |
Order ]
|
|
[11]
|
Aydin Buluç, John R. Gilbert, and Ceren Budak.
Solving path problems on the GPU.
Parallel Computing, 36(5-6):241 - 253, 2010.
[ bib |
DOI |
.pdf ]
|
|
[12]
|
Aydin Buluç and John R. Gilbert.
Highly parallel sparse matrix-matrix multiplication.
Technical Report UCSB-CS-2010-10, UCSB CS Department, June 2010.
[ bib |
arXiv |
.pdf ]
|
|
[13]
|
Aydin Buluç.
Linear Algebraic Primitives for Parallel Computing on Large
Graphs.
PhD thesis, University of California, Santa Barbara, CA, March 2010.
[ bib |
.pdf ]
|
|
[14]
|
Aydin Buluç, Jeremy T. Fineman, Matteo Frigo, John R. Gilbert, and
Charles E. Leiserson.
Parallel sparse matrix-vector and matrix-transpose-vector
multiplication using compressed sparse blocks.
In Proc. SPAA, Calgary, Canada, 2009.
[ bib |
.pdf ]
|
|
[15]
|
Aydin Buluç and John R. Gilbert.
Challenges and advances in parallel sparse matrix-matrix
multiplication.
In The 37th International Conference on Parallel Processing
(ICPP'08), pages 503-510, Portland, Oregon, USA, 2008.
[ bib |
DOI |
.pdf ]
|
|
[16]
|
Aydin Buluç and John R. Gilbert.
On the Representation and Multiplication of Hypersparse Matrices.
In Proc. IPDPS, 2008.
[ bib |
DOI |
.pdf ]
|
|
[17]
|
Aydin Buluç and Erik G. Boman.
Towards scalable parallel hypergraph partitioning.
In CSRI Summer Proceedings, Albuquerque, NM and Livermore, CA,
2008.
[ bib |
.pdf ]
|