The following pages link to Assefaw Hadish Gebremedhin (Q1408824):
Displayed 19 items.
- (Q436750) (redirect page) (← links)
- A framework for scalable greedy coloring on distributed-memory parallel computers (Q436752) (← links)
- Graph coloring on coarse grained multicomputers (Q1408826) (← links)
- (Q1694293) (redirect page) (← links)
- Capitalizing on \textit{live} variables: new algorithms for efficient Hessian computation via automatic differentiation (Q1694294) (← links)
- (Q2766681) (← links)
- Efficient Computation of Sparse Hessians Using Coloring and Automatic Differentiation (Q2901061) (← links)
- Implementation of Partial Separability in a Source-to-Source Transformation AD Tool (Q2913152) (← links)
- Fast Algorithms for the Maximum Clique Problem on Massive Sparse Graphs (Q2938025) (← links)
- Distributed-Memory Parallel Algorithms for Distance-2 Coloring and Related Problems in Derivative Computation (Q2998040) (← links)
- Parallel Maximum Clique Algorithms with Applications to Network Analysis (Q3447472) (← links)
- New Acyclic and Star Coloring Algorithms with Application to Computing Hessians (Q3506547) (← links)
- (Q3528800) (← links)
- (Q4790880) (← links)
- (Q4813178) (← links)
- Fast Algorithms for the Maximum Clique Problem on Massive Graphs with Applications to Overlapping Community Detection (Q4985798) (← links)
- What Color Is Your Jacobian? Graph Coloring for Computing Derivatives (Q5713152) (← links)
- (Q5757085) (← links)
- Direction-optimizing Label Propagation Framework for Structure Detection in Graphs: Design, Implementation, and Experimental Analysis (Q6127821) (← links)