default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJerry Lacmou Zeutouo
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[j8]Jerry Lacmou Zeutouo, Vianney Kengne Tchendji, Jean Frédéric Myoupo
:
Coarse-grained multicomputer parallel algorithm using the four-splitting technique for the minimum cost parenthesizing problem. ARIMA J. 38 (2023)- [j7]Vianney Kengne Tchendji, Franklin Ingrid Kamga Youmbi, Clémentin Tayou Djamégni, Jerry Lacmou Zeutouo:
A Parallel Tiled and Sparsified Four-Russians Algorithm for Nussinov's RNA Folding. IEEE ACM Trans. Comput. Biol. Bioinform. 20(3): 1795-1806 (2023) - [c1]A. Yvan Guifo Fodjo, Jerry Lacmou Zeutouo, Samuel Bowong:
Separation of Concerns in an Edge-Based Compartmental Modeling Framework. BIOINFORMATICS 2023: 262-269 - 2022
- [j6]Jerry Lacmou Zeutouo, Vianney Kengne Tchendji, Jean Frédéric Myoupo:
Four-splitting based coarse-grained multicomputer parallel algorithm for the optimal binary search tree problem. Int. J. Parallel Emergent Distributed Syst. 37(6): 659-679 (2022) - [j5]Vianney Kengne Tchendji, Hermann Bogning Tepiele, Mathias Akong Onabid, Jean Frédéric Myoupo, Jerry Lacmou Zeutouo:
A coarse-grained multicomputer parallel algorithm for the sequential substring constrained longest common subsequence problem. Parallel Comput. 111: 102927 (2022) - [j4]Jerry Lacmou Zeutouo, Vianney Kengne Tchendji, Jean Frédéric Myoupo:
High-performance CGM-based parallel algorithms for minimum cost parenthesizing problem. J. Supercomput. 78(4): 5306-5332 (2022) - [i1]Jerry Lacmou Zeutouo, Vianney Kengne Tchendji, Jean Frédéric Myoupo:
Four-splitting based coarse-grained multicomputer parallel algorithm for the optimal binary search tree problem. CoRR abs/2207.06083 (2022) - 2021
- [j3]Jerry Lacmou Zeutouo, Vianney Kengne Tchendji, Jean Frédéric Myoupo:
A fast sequential algorithm for the matrix chain ordering problem. Concurr. Comput. Pract. Exp. 33(24) (2021) - 2020
- [j2]Vianney Kengne Tchendji, Armel Nkonjoh Ngomade, Jerry Lacmou Zeutouo, Jean Frédéric Myoupo:
Efficient CGM-based parallel algorithms for the longest common subsequence problem with multiple substring-exclusion constraints. Parallel Comput. 91 (2020)
2010 – 2019
- 2019
- [j1]Vianney Kengne Tchendji, Jerry Lacmou Zeutouo:
An Efficient CGM-Based Parallel Algorithm for Solving the Optimal Binary Search Tree Problem Through One-to-All Shortest Paths in a Dynamic Graph. Data Sci. Eng. 4(2): 141-156 (2019)
Coauthor Index
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.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 23:03 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 and maintained by:
the dblp computer science bibliography is funded and supported by:
