Assefaw Gebremedhin, Selected Presentations

• Exploiting Sparsity in Automatic Differentiation on Multicore Architectures, 6th International Conference on Automatic Differentiation (AD2012), Fort Collins, Colorado, July 23--27, 2012.
• Automatic Differentiation Algorithms for Hessian Computation, 6th International Conference on Automatic Differentiation (AD2012), Fort Collins, Colorado, July 23--27, 2012. (Poster; prepared with Mu Wang)
• Exploiting Sparsity in Derivative Computation, SIAM Annual Meeting, Minneapolis, Minnesota, July 9--13, 2012. Minisymposium on Automatic Differentiation and Nonlinear Optimization.

• 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. Minisymposium on Automatic Differentiation Software.
• Multithreaded Graph Coloring Algorithms for Scientific Computing , 7th International Congress on Industrial and Applied Mathematics (ICIAM 2011), Vancouver, BC, Canada, July 18--22, 2011. Minisymposium on Combinatorial Scientific Computing.
• Graph Coloring Software for Sparse Derivative Computation and Beyond, SIAM Conference on Computational Science and Engineering (CSE11), Reno, Nevada, March 2011. (Poster)
• 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), UC Berkeley/LBNL, January 2011.

• Sparse Derivative Computation using Automatic Differentiation on Multicore Architectures, Cyber Infrastructure (CI) Days at Purdue, Purdue University, December 8--9, 2010.(Poster)
• Algorithms and Software for Sparse Derivative Computation and Beyond, LANS Seminar Series, Argonne National Laboratory, December 1, 2010.
• Accurate and Efficient Computation of Sparse Derivative Matrices, Computational Science and Engineering Seminar Series, Purdue University, November 3, 2010.
• Graph Coloring Software for Computational Science and Engineering, Computer Science Research Institute, Sandia National Laboratories, October 21, 2010.
• Combinatorial Scientific Computing and Petascale Simulations Institute (CSCAPES): Recent Progress, SciDAC Conference 2010, July 2010, Chattanooga, TN. (Poster; prepared together with CSCAPES colleagues)

• Combinatorial Algorithms Enabling Scientific Computing: Petascale Algorithms for Graph Coloring and Matching, SuperComputing 2009, November 2009, Portland, Oregon. (E-Poster)
• Ordering for Coloring and More, The Fourth SIAM Workshop on Combinatorial Scientific Computing (CSC09), October 29--31, 2009, Monterey, CA.
• Graph Coloring for Scientific Computing and Parallel Processing, Department of Computer and Information science, Indiana Unviversity-Purdue University Indianapolis (IUPUI), October 9, 2009.
• Efficient Computation of Jacobians and Hessians using Automatic Differentiation, PRISM Seminar Series, Birck Nanotechnology Center, Purdue University, March 13, 2009.
• ColPack: A Graph Coloring Package for Sparse Derivative Computation, SIAM Conference on Computational Science and Engineering (CSE09), March 2--6, 2009, Miami, FL. Minisymposium on AD and CSE.
• The Enabling Power of Graph Coloring Algorithms in Automatic Differentiation, Dagstuhl Seminar on Combinatorial Scientific Computing, February 1--6, 2009, Germany.

• Combinatorial Scientific Computing and Petascale Simulations (CSCAPES): Recent Progress, SciDAC 2008 Conference, July 13--17, 2008. (Poster; prepared together with CSCAPES colleagues.)
• Graph Coloring in Parallel Processing and Scientific Computing, CSCAPES Workshop 2008, June 10--13, 2008, Santa Fe, NM.
• Efficient Computation of Sparse Hessians Using Coloring and Automatic Differentiation, SIAM Conference on Optimization (OP08), May 10--13, 2008, Boston, MA. Minisymposium on combinatorics in AD.
• 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. Minisymposium on parallel CSC.

• Computing Jacobians and Hessians for Nonlinear PDEs, SciDAC 2007 Conference, June 2007, Boston, MA. (Poster; prepared together with Paul Hovland.)
• Graph Coloring for Automatic Differentiation: A project in the SciDAC Institute Combinatorial Scientific Computing and Petascale Simulations, Research Expo 2007, a joint event organized by Eastern Virginia Medical school, Old Dominion University, and Norfolk State University, Norfolk, VA, April 2007.(Poster)
• Sparse Hessian Computation using Automatic Differentiation, The Third SIAM Workshop on Combinatorial Scientific Computing, Costa Mesa, CA, February 2007.
• Combinatorial Scientific Computing and Petascale Simulations: A SciDAC Applied Math Institute, SIAM Conference on Computational Science and Engineering, Costa Mesa, CA, February 2007. (Poster; prepared together with CSCAPES colleagues.)

• Combinatorial Algorithms Enabling Computational Sciences: Tales from the Front, SciDAC Conference 2006, Denver, June 2006. (Poster; prepared together with CSCAPES colleagues.)
• New Star and Acyclic Coloring Algorithms with Application to Hessian Computation, Research Expo 2006, a joint event organized by Eastern Virginia Medical School, Old Dominion University and Norfolk State University, Norfolk, VA, April 2006. (Poster)

• New Star and Acyclic Coloring Algorithms, The Second Workshop on Combinatorial Scientific Computing (CSC05), June 21 - 23, 2005, Toulouse, France. (Poster)
• Graph Coloring for Computing Derivatives: A Unifying Framework, SIAM Conference on Optimization, May 15 - 19, 2005, Stockholm, Sweden. Minisymposium on automatic differentiation.

• What Color is Your Jacobian? Graph Coloring for Computing Derivatives, 2004 SIAM Annual Meeting, July 12-16, 2004, Portland, Oregon. Minisymposium on CSC.
• Parallel Algorithms for Graph Coloring Problems in Numerical Optimization, SIAM Conference on Parallel Processing for Scientific Computing, Feb 25-27, 2004, San Francisco, CA. Minisymposium on CSC and Parallel Computing.

• Practical Parallel Algorithms for Graph Coloring Problems in Numerical Optimization, Presentation of own work, PhD thesis defence, Department of Informatics, University of Bergen, March 25, 2003.
• Hypergraph Coloring: Algorithms and Applications, Lecture on a given topic, PhD thesis defence, Department of Informatics, University of Bergen, March 25, 2003.

• Parallel Distance-k Coloring Algorithms for Numerical Optimization, Euro-par 2002, August 27-30, 2002, Paderborn, Germany.
• Parallel Graph Coloring Algorithms Using OpenMP, First European Workshop on OpenMP (EWOMP'99), Sept 30 - Oct 1, 1999, Lund, Sweden.