( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
What Color Is Your Jacobian? Graph Coloring for Computing Derivatives

, , и . SIAM Review, 47 (4): 629--705 (2005)

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.

NULL Yitagessu Birhanu Gebremedhin

 

Другие публикации лиц с тем же именем

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