Assefaw Gebremedhin, Publications

Journal Papers
Conference Papers
Workshop Papers
Popular Articles
Books Edited
Theses

Sparse Derivative Computation
Parallel Graph Algorithms
Parallel Computation Models

• U. Catalyurek, J. Feo, A.H. Gebremedhin, M. Halappanavar and A. Pothen, Graph Coloring Algorithms for Multi-core and Massively Multithreaded Architectures, Parallel Computing 38 (2012), 576-594.
• A.H. Gebremedhin, D. Nguyen, M.M.A. Patwary and A. Pothen, ColPack: Software for Graph Coloring and Related Problems in Scientific Computing. ACM Transactions on Mathematical Software. Accepted, 2013.
• D. Bozdag, U. Catalyurek, A. Gebremedhin, F. Manne, E. Boman and F. Ozguner, Distributed-memory Parallel Algorithms for Distance-2 Coloring and Related Problems in Derivative Computation, SIAM Journal on Scientific Computing Vol 32, Issue 4, pp 2418--2446, 2010.
• A. Gebremedhin, A. Pothen, A. Tarafdar and A. Walther, Efficient Computation of Sparse Hessians Using Coloring and Automatic Differentiation, INFORMS Journal on Computing Vol 21, No 2, pp 209--223, 2009.
• D. Bozdag, A. Gebremedhin, F. Manne, E. Boman and U. Catalyurek, A framework for Scalable Greedy Coloring on Distributed Memory Parallel Computers, Journal of Parallel and Distributed Computing Vol 68, No 4, pp 515--535, 2008.
• A. Gebremedhin, A. Tarafdar, F. Manne and A. Pothen, New Acyclic and Star Coloring Algorithms with Applications to Hessian Computation, SIAM Journal on Scientific Computing, Vol 29, No 3, pp 1042--1072, 2007.
• A. Gebremedhin, M. Essaidi, I. Guerin-Lassous, J. Gustedt, J.A. Telle, PRO: A Model for the Design and Analysis of Efficient and Scalable Parallel Algorithms, Nordic Journal of Computing, Vol 13, pp 1--25, 2006.
• A. Gebremedhin, F. Manne and A. Pothen, What Color Is Your Jacobian? Graph Coloring for Computing Derivatives, SIAM Review, Vol 47, No 4, pp 629--705, 2005.
• A. Gebremedhin, I.Guerrin-Lassous, J. Gustedt and J.A. Telle, Graph Coloring on Coarse Grained Multicomputers, Discrete Applied Mathematics, Vol 131, No 1, pp 179--198, 2003.
• A. Gebremedhin and F. Manne, Scalable Parallel Graph Coloring Algorithms, Concurrency: Practice and Expereince Vol 12, pp 1131--1146, 2000.

• B. Letschert, K. Kulshreshtha, A. Walther, D. Nguyen, A.H. Gebremedhin and A. Pothen, Exploiting Sparsity in Automatic Differentiation on Multicore Architectures, In S. Forth et al. (Eds.), Recent Advances in Algorithmic Differentiation, Lecture Notes in Computational Science and Engineering 87, DOI 10.1007/978-3-642-30023-3_14, 2012, Springer.
• S.H.K Narayanan, B. Norris, P. Hovland and A.H. Gebremedhin. Implementation of Partial Separability in a Source to Source Transformation AD Tool, In S. Forth et al. (Eds.), Recent Advances in Algorithmic Differentiation, Lecture Notes in Computational Science and Engineering 87, DOI 10.1007/978-3-642-30023-3_31, 2012, Springer.
• M.M.A. Patwary, A.H. Gebremedhin and A. Pothen, New Multithreaded Ordering and Coloring Algorithms for Multicore Architectures, In E. Jeannot, R. Namyst and J. Roman, editors, Euro-Par 2011, Lecture Notes in Computer Science 6853, pages 250--262, Springer, 2011.
• S.H.K. Narayanan, B. Norris, P. Hovland, D. Nguyen and A.H. Gebremedhin, Sparse Jacobian Computation using ADIC2 and ColPack, Procedia Computer Science, 4:2115--2123, 2011. Proceedings of the International Conference on Computational Science, ICCS 2011.
• U. Catalyurek, F. Dobrian, A. Gebremedhin, M. Halappanavar and A. Pothen, Distributed-memory Parallel Algorithms for Matching and Coloring, Proceedings of IEEE International Parallel and Distributed Processing Symposium, Workshops and PhD Forums (IPDPSW), Workshop on Parallel Computing and Optimization (PCO'11), pages 1966--1975, 2011.
• A. Gebremedhin, A. Pothen and A.Walther, Exploiting Sparsity in Jacobian Computation via Coloring and Automatic Differentiation: a Case Study in a Simulated Moving Bed Process, In C. Bischof et al. (Eds): Proceedings of the Fifth International Conference on Automatic Differentiation (AD 2008), Lecture Notes in Computational Science and Engineering 64, pp 339--349, 2008, Springer. .
• E. Boman, D. Bozdag, U. Catalyurek, K. Devine, A. Gebremedhin, P. Hovland and A. Pothen Combinatorial Algorithms for Computational Science and Engineering, Journal of Physics: Conference Series 125 (2008) 5 pp; SciDAC 2008.
• E. Boman, D. Bozdag, U. Catalyurek, K. Devine, A. Gebremedhin, P. Hovland, A. Pothen and M.M. Strout, Enabling High Performance Computational Science through Combinatorial Algorithms, Journal of Physics: Conference Series 78 (2007) 012058 (10 pp); SciDAC 2007.
• S. Bhowmick, E. Boman, K. Devine, A. Gebremedhin, B. Hendrickson, P. Hovland, T. Munson and A. Pothen, Combinatorial Algorithms Enabling Computational Science: Tales from the Front, Journal of Physics: Conference Series 46 (2006), 453--457; SciDAC 2006.
• D. Bozdag, U. Catalyurek, A.H. Gebremedhin, F. Manne, E. G. Boman and F. Ozguner, A Parallel Distance-2 Graph Coloring Algorithm for Distributed Memory Computers, Lecture Notes in Computer Science, vol 3726, 2005, pages 796 - 806,Springer. Proceedings of HPCC 2005, Sept 21 - 25, 2005, Sorrento, Italy.
• E.G. Boman, D. Bozdag, U. Catalyurek, A.H. Gebremedhin and F. Manne, A Scalable Parallel Graph Coloring Algorithm for Distributed Memory Computers, Lecture Notes in Computer Science, vol 3648 , 2005, pages 241 - 251, Springer. Proceedings of EuroPar 2005, August 30--September 2, 2005, Lisboa, Portugal.
• A.H. Gebremedhin, F.Manne and T. Woods, Speeding up Parallel Graph Coloring, Lecture Notes in Computer Science, vol 3732, pp 1079-1088, 2005, Springer. Proceedings of Para 2004, June 20--23, 2004, Lyngby, Denmark.
• A.H. Gebremedhin, F. Manne and A. Pothen, Parallel Distance-k Coloring Algorithms for Numerical Optimization, In B. Monien and R. Feldmann (Eds.): EuroPar 2002, >Lecture Notes in Computer Science 2400, pp. 912-921, Springer-Verlag 2002.
• A.H. Gebremedhin, I. G. Lassous, J. Gustedt and J.A. Telle, PRO: a Model for Parallel Resource-Optimal Computation, In Proceedings of Symposium on High Performance Computing Systems and Applications (HPCS 2002), Moncton, NB, Canada, June 17--19, 2002, pages 106-113, IEEE Compter Society Press.
• A.H. Gebremedhin, I.G. Lassous, J. Gustedt and J.A. Telle, Graph Coloring on a Coarse Grained Multiprocessor, In Brandes, Ulrik, Wagner and Dorothea (Eds.): Workshop on Graph-Theoretic Concepts in Computer Science (WG 2000), Lecture Notes in Computer Science 1928, pp. 184-195, 2000, Springer-Verlag.
• A.H. Gebremedhin and F. Manne, Parallel Graph Coloring Algorithms using OpenMP, In Proceedings of the First European Workshop on OpenMP (EWOMP'99), Sept.30 - Oct. 1, 1999, Lund, Sweden.

• A.H. Gebremedhin, U. Catalyurek, J. Feo, M. Halappanavar and A. Pothen, Multithreaded Graph Coloring Algorithms, The Fifth SIAM Workshop on Combinatorial Scientific Computing (CSC11), Dramstadt, Germany, May 2011.
• A.H. Gebremedhin, D. Nguyen, A. Tarafdar and A. Pothen, Ordering for Coloring and More, The Fourth SIAM Workshop on Combinatorial Scientific Computing (CSC09), Monterey, CA, Oct 2009.
• A.H. Gebremedhin, The Enabling Power of Graph Coloring Algorithms in Automatic Differentiation and Parallel Processing, Dagstuhl Seminar on Combinatorial Scientific Computing, Germany, Feb 2009.
• A.H. Gebremedhin, A. Pothen, A. Tarafdar and A. Walther, Sparse Hessian Computation using Automatic Differentiation, The Third SIAM Workshop on Combinatorial Scientific Computing, Costa Mesa, CA, February 2007.

• Assefaw Gebremedhin, The Third SIAM Workshop on Combinatorial Scientific Cmputing, SIAM News Volume 40, Number 4, May 2007.
• A. Pothen, A.H. Gebremedhin, F. Dobrian; E.G. Boman, K.D. Devine, B.A. Hendrickson; P. Hovland, B. Norris, J. Utke; U. Catalyurek; M.M. Strout; Combinatorial Algorithms for Petascale Science, SciDAC Review, Issue 5, pp 26--35, Fall 2007.

• T. Sørevik, F. Manne, R. Moe, and A. H. Gebremedhin (eds.), Applied Parallel Computing. New Paradigms for HPC in Industry and Academia, Para2000, Bergen, Norway, June 18--20, 2000, Proceedings, Lecture Notes in Computer Science 1947, Springer 2001.

• A.H. Gebremedhin, Practical Parallel Algorithms for Graph Coloring Problems in Numerical Optimization, PhD Thesis, Dept of Informatics, University of Bergen, Norway, February 2003.
• A.H. Gebremedhin, Parallel Graph Coloring, MS Thesis, Dept of Informatics, University of Bergen, May 1999.