Sparse Derivative Computation
NSF and DOE Funded Project

Home | People | Papers | Presentations | Software | Automatic Differentiation

Talks and Posters


2011:

  • A. H. Gebremedhin, D. Nguyen, M.M.A, Patwary and A. Pothen,
    The ColPack Software Library for Graph Coloring to Enable Derivative Computations,
    7th International Congress on Industrial and Applied Mathematics (ICIAM 2011), Vancouver, BC, Canada, July 18--22, 2011.
  • A. H. Gebremedhin, M.M.A. Patwary and A. Pothen,
    Multithreaded Graph Coloring Algorithms for Scientific Computing,
    7th International Congress on Industrial and Applied Mathematics (ICIAM 2011), Vancouver, BC, Canada, July 18--22, 2011.
  • M. Halappanavar, U. Catalyurek, J. Feo, A.H. Gebremedhin and A. Pothen,
    Multithreaded Algorithms for Graph Coloring,
    SIAM Conference on Computational Science and Engineering (CSE11), March 2011, Reno, Nevada.
  • A. Gebremedhin,
    Graph Coloring Software for Sparse Derivative Computation and Beyond,
    SIAM Conference on Computational Science and Engineering (CSE11), March 2011, Reno, Nevada. (Poster)
  • A. Gebremedhin,
    Multithreaded Graph Coloring Algorithms for Scientific Computing on Manycore Architectures,
    Workshop on Manycore and Accelerator-based High Performance Scientific Computing, International Center for Computational Science (ICCS), January 2011, UC Berkeley/LBNL.

2010:

  • A. Pothen,
    Combinatorial Scientific Computing: Algorithms for Enabling Computational Science,
    Woudschoten Conference, October 6-8, 2010, Germany.
  • A. Pothen,
    Scientific Computing in the Many-core Era: Scaling the Memory Wall,
    Woudschoten Conference, October 6-8, 2010, Germany.
  • A. Gebremedhin,
    Algorithms and Software for Sparse Derivative Computation and Beyond,
    LANS Seminar Series, Argonne National Laboratory, Dec 1, 2010, Argonne, IL.
  • A. Gebremedhin,
    Accurate and Efficient Computation of Sparse Derivative Matrices,
    Computational Science and Engineering Seminar Series, Purdue University, nov 3, 2010.
  • A. Gebremedhin,
    Graph Coloring Software for Computational Science and Engineering,
    Computer Science Research Institute, Sandia National Laboratories, Oct 21, 2010, Albuquerque, NM.
  • M. Halappanavar, U. Catalyurek, F. Dobrian, A. Gebremedhin and A. Pothen,
    Parallel Graph Matching and Coloring for Petascale Scientific Computing,
    SIAM Conference on Parallel Processing for Scientific Computing (PP10), February 2010, Seattle.

2009:

  • D. Bozdag, U. Catalyurek, F. Dobrian, A. Gebremedhin, M. Halappanavar and A. Pothen,
    Combinatorial Algorithms Enabling Scientific Computing: Petascale Algorithms for Graph Coloring and Matching,
    SuperComputing 2009, Nov 2009, Portland, Oregon (Electronic Poster).
  • A. Gebremedhin, D. Nguyen and A. Pothen,
    Ordering for Coloring and More,
    The Fourth SIAM Workshop on Combinatorial Scientific Computing (CSC09), October 2009, Monterey, CA.
  • A. Gebremedhin,
    Efficient Computation of Jacobians and Hessians Using Automatic Differentiation,
    PRISM Seminar Series, Birck Nanotechnology Center, Purdue University, March 13, 2009.
  • A. Gebremedhin, A. Tarafdar, D. Nguyen and A. Pothen,
    ColPack: A Graph Coloring Packager for Sparse Derivative Computation,
    SIAM Conference on Computational Science and Engineering, March 2--6, 2009, Miami, FL..
    A talk presented at a minisymposium on automatic differentiation and CSE.
  • A. Gebremedhin,
    The Enabling Power of Graph Coloring Algorithms in Automatic Differentiation,
    Dagstuhl Seminar on Combinatorial Scientific Computing, Feb 1--6, 2009, Germany.

2008:

  • The CSCAPES team,
    Combinatorial Scientifc Computing and Petascale Simulations Institute (CSCAPES): Recent Progress
    SciDAC 2008 Conference, July 2008, Seattle, WA. (Poster)
  • A. Gebremedhin,
    Graph Coloring in Parallel Processing and Scientic Computing,
    CSCAPES Workshop 2008, June 10-13, 2008, Santa Fe, NM.
  • A. Gebremedhin,
    Novel Acyclic and Star Coloring Algorithms and Their Application to
    Efficient Sparse Hessian Computation via Automatic Differentiation
    ,
    SIAM Conference on Optimization, May 10-13, 2008, Boston, MA.
    Invited talk at a minisymposium on combinatorics in AD.

  • A. Gebremedhin,
    A Scalable Algorithmic Framework for Parallel Graph Coloring
    on Distributed Memory Computers

    SIAM Conference on Parallel Processing for Scientific Computing,
    March 12--14, 2008, Atlanta, GA. Invited talk at a minisymposium on parallel CSC.


2007:

  • P. Hovland and A. Gebremedhin,
    Computing Jacobians and Hessians for Nonlinear PDEs,
    SciDAC 2007 Conference, June 2007, Boston, MA. (Poster)
  • A.H. Gebremedhin and A. Pothen,
  • Graph Coloring for Automatic Differentiation:
    A project in the SciDAC Institute
    Combinatorial Scientific Computing and Petascale Simulations,

    Research Expo 2007, Norfolk, VA, April 2007. (Poster).
  • A.H. Gebremedhin, A. Pothen, A. Tarafdar, F. Manne and A. Walther,
  • Sparse Hessian Computation using Automatic Differentiation,
    Third SIAM Workshop on Combinatorial Scientific Computing,
    Costa Mesa, CA, Feb 2007.
  • A. Pothen and A. Gebremedhin,
  • Graph Coloring Problems for Computing Derivatives:
    Recent Developments and Future Plans,
    SIAM Conference on Computational Science and Engineering,
    Costa Mesa, CA, Feb 2007.

  • The CSCAPES team,
  • Combinatorial Scientific Computing and Petascale Simulations:
    A SciDAC Applied Math Institute,
    SIAM Conference on Computational Science and Engineering,
    Costa Mesa, CA, Feb 2007. (Poster)


2006:

  • S. Bhomwick, E.G. Boman, K. Devine, A.H. Gebremedhin,
    B. Hendrickson, P. Hovland, T. Munson and A. Pothen,
  • Combinatorial Algorithms Enabling Computational Science:
    Tales from the Front.
    SciDAC 2006 Conference, June 2006, Denver. (Poster)

2005:

  • A.H. Gebremedhin, F. Manne, A. Pothen and A. Tarafdar,
  • New Star and Acyclic Coloring Algorithms (poster).
    CSC05 - Second Workshop on Combinatorial Scientific Computing,  
    June 21 - 23, 2005, Toulouse, France.
  • A.H. Gebremedhin, F. Manne, A. Pothen, A. Tarafdar and R. Aksu,
  • Graph Coloring for Computing Derivatives: A Unifying Framework.
    SIAM Conference on Optimization, May 15 - 19, 2005, Stockholm, Sweden.
    Invited talk at a minisymposium on Automatic Differentiation.
  • A. Pothen, A.H. Gebremedhin and R. Aksu,
  • Ordering and Graph Coloring: An Experimental Study.
    SIAM Conference on Computational Science and Engineering,
    Feb 12 -- 15, 2005, Orlando, Florida.