@misc{bascd2002-poster,
  added-at = {2007-10-09T07:04:05.000+0200},
  address = {Livermore, CA},
  author = {Riedy, E. Jason},
  biburl = {http://www.bibsonomy.org/bibtex/2b1452e5000ee8a814a808fa78b404371/ejr},
  howpublished = {Third Bay Area Scientific Computing Day},
  interhash = {a45282a797f668418e07d27dd42a1568},
  intrahash = {b1452e5000ee8a814a808fa78b404371},
  keywords = {bascd combinatorialoptimization parallelalgorithms sparsematrix},
  month = {March},
  role = {poster},
  timestamp = {2007-10-09T07:04:05.000+0200},
  title = {Parallel Bipartite Matching for Sparse Matrix Computation},
  year = 2002
}

@misc{siam-cse03,
  added-at = {2007-10-09T07:04:05.000+0200},
  author = {Riedy, E. Jason},
  biburl = {http://www.bibsonomy.org/bibtex/28fbb7d8fa23b56b25d78c3983212f0b2/ejr},
  howpublished = {SIAM Conference on Computational Science and Engineering},
  interhash = {1f3c7d01f76c96bfb4f50a58da2e087c},
  intrahash = {8fbb7d8fa23b56b25d78c3983212f0b2},
  keywords = {combinatorialoptimization parallelalgorithms siam sparsematrix},
  month = {February},
  role = {poster},
  timestamp = {2007-10-09T07:04:05.000+0200},
  title = {Parallel Bipartite Matching for Sparse Matrix Computations},
  url = {http://purl.oclc.org/NET/jason-riedy/resume/material/siam-cse03-poster.pdf},
  year = 2003
}

@misc{siam-am03,
  added-at = {2007-10-09T07:04:05.000+0200},
  author = {Riedy, E. Jason},
  biburl = {http://www.bibsonomy.org/bibtex/2085769b438cdc56580aefbb09822c749/ejr},
  howpublished = {SIAM Annual Meeting},
  interhash = {71571b92fbc636a28988aa51c1174ddb},
  intrahash = {085769b438cdc56580aefbb09822c749},
  keywords = {linearalgebra siam sparsematrix},
  month = {June},
  role = {presentation},
  timestamp = {2007-10-09T07:04:05.000+0200},
  title = {Practical Alternatives for Parallel Pivoting},
  url = {http://purl.oclc.org/NET/jason-riedy/resume/material/siam-am03.pdf},
  year = 2003
}

@misc{par-bipart-pp04,
  added-at = {2007-10-09T07:04:05.000+0200},
  author = {Riedy, E. Jason},
  biburl = {http://www.bibsonomy.org/bibtex/2d943d302329c5f64fa80a2be8b082baa/ejr},
  howpublished = {SIAM Parallel Processing for Scientific Computing},
  interhash = {40fce36d8a1fadb42f5f760e7d52b8de},
  intrahash = {d943d302329c5f64fa80a2be8b082baa},
  keywords = {combinatorialoptimization parallelalgorithms siam sparsematrix},
  month = feb,
  role = {minisymposium speaker},
  timestamp = {2007-10-09T07:04:05.000+0200},
  title = {Parallel Weighted Bipartite Matching and Applications},
  url = {http://purl.oclc.org/NET/jason-riedy/resume/material/pp04.pdf},
  year = 2004
}

@misc{sparse-ds-csc04,
  added-at = {2007-10-09T07:04:05.000+0200},
  author = {Riedy, E. Jason},
  biburl = {http://www.bibsonomy.org/bibtex/22ab7af790073ff597819d916da57c4c7/ejr},
  howpublished = {SIAM Workshop on Combinatorial Scientific Computing},
  interhash = {669b4eafc073440a48d3c203c637a8c1},
  intrahash = {2ab7af790073ff597819d916da57c4c7},
  keywords = {combinatorialoptimization siam sparsematrix},
  month = feb,
  role = {presentation},
  timestamp = {2007-10-09T07:04:05.000+0200},
  title = {Sparse Data Structures for Weighted Bipartite Matching},
  url = {http://purl.oclc.org/NET/jason-riedy/resume/material/csc04.pdf},
  year = 2004
}

@misc{comb-sparse-cse05,
  added-at = {2007-10-09T07:04:05.000+0200},
  author = {Riedy, E. Jason},
  biburl = {http://www.bibsonomy.org/bibtex/2415966aedca4cab21a2dcc731ca7f1a0/ejr},
  howpublished = {SIAM Conference on Computational Science and Engineering},
  interhash = {6d8f9f0e242a5a176942fc3fa628e478},
  intrahash = {415966aedca4cab21a2dcc731ca7f1a0},
  keywords = {combinatorialoptimization parallelalgorithms siam sparsematrix},
  month = feb,
  role = {minisymposium speaker},
  timestamp = {2007-10-09T07:04:05.000+0200},
  title = {Parallel Combinatorial Computing and Sparse Matrices},
  url = {http://purl.oclc.org/NET/jason-riedy/resume/material/cse05.pdf},
  year = 2005
}

@misc{bascd2006-poster,
  abstract = {For sparse LU factorization, dynamic pivoting
                  tightly couples symbolic and numerical
                  computation. Dynamic structural changes limit
                  parallel scalability.  Demmel and Li use static
                  pivoting in distributed SuperLU for performance, but
                  intentionally perturbing the input may lead silently
                  to erroneous results.  Are there experimentally
                  stable static pivoting heuristics that lead to a
                  dependable direct solver? The answer is currently a
                  qualified yes. Current heuristics fail on a few
                  systems, but all failures are detectable.  },
  added-at = {2007-10-09T07:04:05.000+0200},
  address = {Livermore, CA},
  author = {Riedy, E. Jason},
  biburl = {http://www.bibsonomy.org/bibtex/2078793fd13f8c4998daa31f5a7cb2344/ejr},
  howpublished = {Seventh Bay Area Scientific Computing Day},
  interhash = {badb869003645347152adf42bb627fb0},
  intrahash = {078793fd13f8c4998daa31f5a7cb2344},
  keywords = {bascd linearalgebra sparsematrix},
  month = {March},
  role = {poster},
  timestamp = {2007-10-09T07:04:05.000+0200},
  title = {Making Static Pivoting Dependable},
  url = {http://purl.oclc.org/NET/jason-riedy/resume/material/bascd2006-poster.pdf},
  year = 2006
}