High Performance CGM-based Parallel Algorithms for the Optimal Binary Search Tree Problem

Publisher： IGI Global_journal

E-ISSN： 1938-0267|8|4|55-77

ISSN： 1938-0259

Source： International Journal of Grid and High Performance Computing (IJGHPC), Vol.8, Iss.4, 2016-10, pp. : 55-77

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

Related content

A Survey of Parallel and Distributed Algorithms for the Steiner Tree Problem

By Bezenšek Mitja   Robič Borut  

International Journal of Parallel Programming, Vol. 42, Iss. 2, 2014-04 ,pp. : 287-319

Springer Publishing Company

Access to resources Recommend Favorite

Adaptive memory programming: local search parallel algorithms for phylogenetic tree construction

By Blazewicz Jacek  

Annals of Operations Research, Vol. 183, Iss. 1, 2011-03 ,pp. : 75-94

Springer Publishing Company

Access to resources Recommend Favorite

Lock-Free Binary Search Tree Based on Leaf Search

By  

International Journal of Open Source Software and Processes (IJOSSP), Vol. 8, Iss. 2, 2017-04 ,pp. : 44-58

IGI Global_journal

Access to resources Recommend Favorite

Optimal binary search trees

By Nagaraj S.V.  

Theoretical Computer Science, Vol. 188, Iss. 1, 1997-11 ,pp. : 1-44

Elsevier

Access to resources Recommend Favorite

Implementation and performance analysis of efficient index structures for DNA search algorithms in parallel platforms

By  

CONCURRENCY AND COMPUTATION: PRACTICE & EXPERIENCE (ELECTRONIC), Vol. 27, Iss. 9, 2015-06 ,pp. : 2351-2368

John Wiley & Sons Inc

Access to resources Recommend Favorite