( en | de | ru )

 

Disambiguation of "Gebremedhin, Assefaw Hadish"

Author of the publication

copydeleteadd this publication to your clipboard
PRO: A Model for the Design and Analysis of Efficient and Scalable Parallel Algorithms.

, , , , and . Nord. J. Comput., 13 (4): 215-239 (2006)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

NULL Yitagessu Birhanu Gebremedhin

 

Other publications of authors with the same name

Fast maximum clique algorithms for large graphs., , , and . WWW (Companion Volume), page 365-366. ACM, (2014)The Enabling Power of Graph Coloring Algorithms in Automatic Differentiation and Parallel Processing.. Combinatorial Scientific Computing, volume 09061 of Dagstuhl Seminar Proceedings, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, Germany, (2009)What Color Is Your Jacobian? Graph Coloring for Computing Derivatives, , and . SIAM Review, 47 (4): 629--705 (2005)Capitalizing on live variables: new algorithms for efficient Hessian computation via automatic differentiation., , and . Math. Program. Comput., 8 (4): 393-433 (2016)Speeding up Parallel Graph Coloring., , and . PARA, volume 3732 of Lecture Notes in Computer Science, page 1079-1088. Springer, (2004)Fast Algorithms for the Maximum Clique Problem on Massive Sparse Graphs, , , , and . CoRR, (2012)A Fast Parallel Maximum Clique Algorithm for Large Sparse Graphs and Temporal Strong Components, , , and . CoRR, (2013)Parallel Maximum Clique Algorithms with Applications to Network Analysis., , and . SIAM J. Sci. Comput., (2015)Applying Generative Machine Learning to Intrusion Detection: A Systematic Mapping Study and Review., , , and . ACM Comput. Surv., 56 (10): 257 (October 2024)New Multithreaded Ordering and Coloring Algorithms for Multicore Architectures., , and . Euro-Par (2), volume 6853 of Lecture Notes in Computer Science, page 250-262. Springer, (2011)