For CS 595N, you will choose a topic and read approximately two papers
on it, then prepare and present a talk.
Your topic can come from any of the papers listed below
(I can help you find other related papers for any of them).
You may also browse the talks from the recent workshops listed
below and choose a topic from one of them.
Or, if you have another topic you'd like to present, come talk to
me about it.
Workshops
Papers
- Bader et al., papers on
SNAP
and STINGER.
- Gregor, Lumsdaine, et al., papers on the
Boost Graph Library
and PBGL.
- Vuduc et al., papers on autotuning kernel computations:
OSKI,
multicore matvec.
- Papers on graph algorithms on massively multithreaded architectures:
challenges,
graph queries,
MTGL.
- Nieplocha et al., papers on
Global Arrays.
- Graphs in the language of linear algebra:
High-performance graph algorithms
from parallel sparse matrices;
Fineman & Robinson, "Fundamental and complex graph algorithms" (see me for preprint).
- Papers on
Map/Reduce and
Pregel.