Personal information

Activities

Employment (3)

IUT Amiens: Amiens, FR

2024-01-09 to present | Assistant professor (Computer science)
Employment
Source: Self-asserted source
Jerry LACMOU ZEUTOUO

Centre Inria de Lyon: Villeurbanne, FR

2024-01-01 to 2024-08-31 | Postdoc researcher
Employment
Source: Self-asserted source
Jerry LACMOU ZEUTOUO

Inria Antenne Lyon la Doua: Villeurbanne, Auvergne-Rhône-Alpes, FR

2022-09-01 to 2023-12-31 | Research Engineer (LIP)
Employment
Source: Self-asserted source
Jerry LACMOU ZEUTOUO

Education and qualifications (4)

Université de Dschang: Dschang, Ouest, CM

2017-10-17 to 2021-12-21 | Doctorat/PhD in Computer Science, Option: Networks and Distributed Services, Specialty : Parallel Computing (Department of Mathematics and Computer Science )
Education
Source: Self-asserted source
Jerry LACMOU ZEUTOUO

Université de Dschang: Dschang, CM

2015-10 to 2017-09 | Master Of Science with Thesis in Fundamental Computer Science, Option: Networks and Distributed Services (Department of Mathematics and Computer Science)
Education
Source: Self-asserted source
Jerry LACMOU ZEUTOUO

Université de Dschang: Dschang, Ouest, CM

2011-10 to 2015-09 | Bachelor's Degree option Fundemantal Computer Science (Department of Mathematics and Computer Science)
Education
Source: Self-asserted source
Jerry LACMOU ZEUTOUO

Collège de l'éthique éducative (COLEEDUC): Bafoussam, Ouest, CM

2010-09 to 2011-08 | Baccalaureate (Mathematical and Physical Science series (C))
Education
Source: Self-asserted source
Jerry LACMOU ZEUTOUO

Works (10)

A Parallel Tiled and Sparsified Four-Russians Algorithm for Nussinov's RNA Folding

IEEE/ACM Transactions on Computational Biology and Bioinformatics
2023-05-01 | Journal article
Contributors: Vianney Kengne Tchendji; Franklin Ingrid Kamga Youmbi; Clémentin Tayou Djamegni; Jerry Lacmou Zeutouo
Source: check_circle
Crossref

Four-splitting based coarse-grained multicomputer parallel algorithm for the optimal binary search tree problem

International Journal of Parallel, Emergent and Distributed Systems
2022-11-02 | Journal article
Contributors: Jerry Lacmou Zeutouo; Vianney Kengne Tchendji; Jean Frédéric Myoupo
Source: check_circle
Crossref

Coarse-grained multicomputer parallel algorithm using the four-splitting technique for the minimum cost parenthesizing problem

CARI 2022 - Colloque Africain pour la Recherche en Informatique et Mathématiques Appliquées
2022-10-04 | Conference paper
Source: Self-asserted source
Jerry LACMOU ZEUTOUO
grade
Preferred source (of 2)‎

A coarse-grained multicomputer parallel algorithm for the sequential substring constrained longest common subsequence problem

Parallel Computing
2022-07 | Journal article
Contributors: Vianney Kengne Tchendji; Hermann Bogning Tepiele; Mathias Akong Onabid; Jean Frédéric Myoupo; Jerry Lacmou Zeutouo
Source: check_circle
Crossref

High-performance CGM-based parallel algorithms for minimum cost parenthesizing problem

The Journal of Supercomputing
2022-03 | Journal article
Contributors: Jerry Lacmou Zeutouo; Vianney Kengne Tchendji; Jean Frédéric Myoupo
Source: check_circle
Crossref

A fast sequential algorithm for the matrix chain ordering problem

Concurrency and Computation: Practice and Experience
2021-12-25 | Journal article
Contributors: Jerry Lacmou Zeutouo; Vianney Kengne Tchendji; Jean Frédéric Myoupo
Source: check_circle
Crossref

A CGM-Based Parallel Algorithm Using the Four-Russians Speedup for the 1-D Sequence Alignment Problem

CARI 2020 - Colloque Africain pour la Recherche en Informatique et Mathématiques Appliquées
2020-10 | Conference paper
URI:

https://hal.archives-ouvertes.fr/hal-02925791

Source: Self-asserted source
Jerry LACMOU ZEUTOUO

Efficient CGM-based parallel algorithms for the longest common subsequence problem with multiple substring-exclusion constraints

Parallel Computing
2020-03 | Journal article
Contributors: Vianney Kengne Tchendji; Armel Nkonjoh Ngomade; Jerry Lacmou Zeutouo; Jean Frédéric Myoupo
Source: check_circle
Crossref
grade
Preferred source (of 2)‎

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 Science and Engineering
2019-06-17 | Journal article
Source: Self-asserted source
Jerry LACMOU ZEUTOUO
grade
Preferred source (of 2)‎

Speeding up CGM-Based Parallel Algorithm for Minimum Cost Parenthesizing Problem

the 2018 International Conference on Parallel and Distributed Processing Techniques and Applications (PDPTA'18)
2018-08 | Conference paper
Part of ISBN: 1601324871
Source: Self-asserted source
Jerry LACMOU ZEUTOUO

Peer review (12 reviews for 3 publications/grants)

Review activity for PloS one. (2)
Review activity for The journal of supercomputing. (5)
Review activity for The journal of supercomputing. (5)