Efficient MFS Algorithms for Inhomogeneous Polyharmonic Problems

By Karageorghis A.  

Journal of Scientific Computing, Vol. 46, Iss. 3, 2011-03 ,pp. : 519-541

Springer Publishing Company

Access to resources Recommend Favorite

Efficient Algorithms for Variants of Weighted Matching and Assignment Problems

By Banerjee Satyajit  

Mathematics in Computer Science, Vol. 1, Iss. 4, 2008-06 ,pp. : 673-688

Springer Publishing Company

Access to resources Recommend Favorite

Efficient algorithms for chemical threshold testing problems

By Bonis A.D.   Gargano L.   Vaccaro U.  

Theoretical Computer Science, Vol. 259, Iss. 1, 2001-05 ,pp. : 493-511

Elsevier

Access to resources Recommend Favorite

Time-Efficient Parallel Algorithms for the Longest Common Subsequence and Related Problems

By Myoupo J-F.   Semé D.  

Journal of Parallel and Distributed Computing, Vol. 57, Iss. 2, 1999-05 ,pp. : 212-223

Academic Press

Access to resources Recommend Favorite

A Matrix Decomposition MFS Algorithm for Problems in Hollow Axisymmetric Domains

By Tsangaris Th.   Smyrlis Y.   Karageorghis A.  

Journal of Scientific Computing, Vol. 28, Iss. 1, 2006-07 ,pp. : 31-50

Springer Publishing Company

Access to resources Recommend Favorite