Assefaw Gebremedhin
Titel
Geciteerd door
Geciteerd door
Jaar
What color is your Jacobian? Graph coloring for computing derivatives
AH Gebremedhin, F Manne, A Pothen
SIAM review 47 (4), 629-705, 2005
3122005
Combinatorial scientific computing
U Naumann, O Schenk
CRC Press, 2012
892012
Scalable parallel graph coloring algorithms
AH Gebremedhin, F Manne
Concurrency: Practice and Experience 12 (12), 1131-1146, 2000
892000
Fast algorithms for the maximum clique problem on massive sparse graphs
B Pattabiraman, MMA Patwary, AH Gebremedhin, W Liao, A Choudhary
International Workshop on Algorithms and Models for the Web-Graph, 156-169, 2013
832013
Fast maximum clique algorithms for large graphs
RA Rossi, DF Gleich, AH Gebremedhin, MMA Patwary
Proceedings of the 23rd International Conference on World Wide Web, 365-366, 2014
792014
ColPack: Software for graph coloring and related problems in scientific computing
AH Gebremedhin, D Nguyen, MMA Patwary, A Pothen
ACM Transactions on Mathematical Software (TOMS) 40 (1), 1-31, 2013
762013
Efficient computation of sparse Hessians using coloring and automatic differentiation
AH Gebremedhin, A Tarafdar, A Pothen, A Walther
INFORMS Journal on Computing 21 (2), 209-223, 2009
762009
Graph coloring algorithms for multi-core and massively multithreaded architectures
ÜV Çatalyürek, J Feo, AH Gebremedhin, M Halappanavar, A Pothen
Parallel Computing 38 (10-11), 576-594, 2012
732012
New acyclic and star coloring algorithms with application to computing Hessians
AH Gebremedhin, A Tarafdar, F Manne, A Pothen
SIAM Journal on Scientific Computing 29 (3), 1042-1072, 2007
712007
A framework for scalable greedy coloring on distributed-memory parallel computers
D Bozdağ, AH Gebremedhin, F Manne, EG Boman, UV Catalyurek
Journal of Parallel and Distributed Computing 68 (4), 515-535, 2008
602008
Computing active subspaces with Monte Carlo
P Constantine, D Gleich
arXiv preprint arXiv:1408.0545, 2014
572014
A scalable parallel graph coloring algorithm for distributed memory computers
EG Boman, D Bozdağ, U Catalyurek, AH Gebremedhin, F Manne
European Conference on Parallel Processing, 241-251, 2005
542005
Parallel maximum clique algorithms with applications to network analysis
RA Rossi, DF Gleich, AH Gebremedhin
SIAM Journal on Scientific Computing 37 (5), C589-C616, 2015
482015
Parallel Distance-k Coloring Algorithms for Numerical Optimization
AH Gebremedhin, F Manne, A Pothen
European Conference on Parallel Processing, 912-921, 2002
342002
A fast parallel maximum clique algorithm for large sparse graphs and temporal strong components
RA Rossi, DF Gleich, AH Gebremedhin, MMA Patwary, M Ali
CoRR, abs/1302.6256, 2013
312013
A parallel distance-2 graph coloring algorithm for distributed memory computers
D Bozdağ, U Catalyurek, AH Gebremedhin, F Manne, EG Boman, ...
International Conference on High Performance Computing and Communications …, 2005
312005
Fast algorithms for the maximum clique problem on massive graphs with applications to overlapping community detection
B Pattabiraman, MMA Patwary, AH Gebremedhin, W Liao, A Choudhary
Internet Mathematics 11 (4-5), 421-448, 2015
302015
Distributed-memory parallel algorithms for matching and coloring
ÜV Çatalyürek, F Dobrian, A Gebremedhin, M Halappanavar, A Pothen
2011 IEEE International Symposium on Parallel and Distributed Processing …, 2011
282011
PRO: a model for parallel resource-optimal computation
AH Gebremedhin, J Gustedt, IG Lassous, JA Telle
282001
Exploiting sparsity in jacobian computation via coloring and automatic differentiation: a case study in a simulated moving bed process
AH Gebremedhin, A Pothen, A Walther
Advances in automatic differentiation, 327-338, 2008
252008
Het systeem kan de bewerking nu niet uitvoeren. Probeer het later opnieuw.
Artikelen 1–20