default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID"High Performance CGM-based Parallel Algorithms for the Optimal Binary ..."
- Vianney Kengne Tchendji
, Jean Frédéric Myoupo, Gilles Dequen:
High Performance CGM-based Parallel Algorithms for the Optimal Binary Search Tree Problem. Int. J. Grid High Perform. Comput. 8(4): 55-77 (2016)
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2021-10-14 09:01 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated, funded, and maintained by:
Schloss Dagstuhl - Leibniz Center for Informatics is a member of the Leibniz Association and is funded by the federal government of Germany and the states of Germany, especially Saarland and Rhineland‑Palatinate.
