*SIAM Journal on Computing*, 11(2), 362–373. https://doi.org/10.1137/0211028

Hu, T. C., and Shing, M. T. (1984). Computation of Matrix Chain Products. Part II. *SIAM Journal on Computing*, 13(2), 228–251. https://doi.org/10.1137/0213017

Huang, S. H. S., Liu, H., and Viswanathan, V. (1994). Parallel Dynamic Programming. *IEEE Transactions on Parallel and Distributed Systems*, 5(3), 326–328. https://doi.org/10.1109/71.277784

Huffman, D. A. (1952). A Method for the Construction of Minimum-Redundancy Codes. *Proceedings of the IRE, 40*(9), 1098–1101. https://doi.org/10.1109/jrproc.1952.273898

Hwang, K. (2008). *Advanced Computer Architecture: Parallelism, Scalability, Programmability* (2nd ed.). McGraw-Hill Higher Education.

Ibarra, O. H., Pong, T. C., and Sohn, S. M. (1991). Parallel Recognition and Parsing on the Hypercube. *IEEE Transactions on Computers*, 40(6), 764–770. https://doi.org/10.1109/12.90253

Ito, Y., and Nakano, K. (2013). A GPU Implementation of Dynamic Programming For the Optimal Polygon Triangulation. *IEICE Transactions on Information and Systems, E96-D*(12), 2596–2603. https://doi.org/10.1587/transinf.e96.d.2596

JáJá, J. (1992). *An Introduction to Parallel Algorithms* (1st ed.). Addison Wesley.

Karpinski, M., Larmore, L., and Rytter, W. (1996). Sequential and Parallel Subquadratic Work Algorithms for Constructing Approximately Optimal Binary Search Trees. In *Proceedings of the Seventh Annual ACM-SIAM Symposium on Discrete Algorithms* (pp. 36–41). Philadelphia, Pennsylvania, USA. https://doi.org/10.5555/313852.313880

Karpinski, M., and Rytter, W. (1994). On a Sublinear Time Parallel Construction of Optimal Binary Search Trees. In *the 1994 International Symposium on Mathematical Foundations of Computer Science* (pp. 453–461). Košice, Slovakia. https://doi.org/10.1007/3-540-58338-6_92

Karypis, G., and Kumar, V. (1993). Efficient Parallel Mappings of a Dynamic Programming Algorithm: A Summary of Results. In *Proceedings of the Seventh International Parallel Processing Symposium* (pp. 563–568). Newport, California, USA. https://doi.org/10.1109/ipps.1993.262817

Kasami, T. (1965). *An Efficient Recognition and Syntax Analysis Algorithm*
*for Context-Free Languages* (Tech. Rep. No. AFCRL-65-758). Bedford, Massachusetts, USA: Air Force Cambridge Research Laboratory. https://www.ideals.illinois.edu/bitstream/handle/2142/74304/B4-257.pdf

Katagiri, T. (2019a). Basics of MPI Programming. In *The Art of High Performance Computing for Computational Science* (Vol. 1, pp. 27–44). Springer Singapore. https://doi.org/10.1007/978-981-13-6194-4_2

Katagiri, T. (2019b). Basics of OpenMP Programming. In *The Art of High Performance Computing for Computational Science* (Vol. 1, pp. 45–59). Springer Singapore. https://doi.org/10.1007/978-981-13-6194-4_3

Kechid, M., and Myoupo, J. F. (2008a). A Coarse Grain Multicomputer Algorithm Solving the Optimal Binary Search Tree Problem. In *the Fifth International Conference on Information Technology: New Generations* (pp. 1186–1189). Las Vegas, Nevada, USA. https://doi.org/10.1109/itng.2008.158

Kechid, M., and Myoupo, J. F. (2008b). An Efficient BSP/CGM Algorithm for the Matrix Chain Ordering Problem. In *the 2008 International Conference on Parallel and Distributed Processing Techniques and Applications* (pp. 327–332). Las Vegas, Nevada, USA. https://hal.archives-ouvertes.fr/hal-03267731

Kechid, M., and Myoupo, J. F. (2009). A Coarse-Grain Multicomputer Algorithm for the Minimum Cost Parenthesization Problem. In *the 2009 International Conference on Parallel and Distributed Processing Techniques and Applications* (pp. 480–486). Las Vegas, Nevada, USA. https://hal.archives-ouvertes.fr/hal-01007646

Kengne, T. V. (2014). *Solutions Parallèles Efficaces Sur Le Modèle CGM D'Une Classe de Problèmes Issus de la Programmation Dynamique* (Ph.D. Thesis). University of Picardie Jules Verne.

Kengne, T. V., Bogning, T. H., Akong, O. M., Myoupo, J. F., and Lacmou, Z. J. (2022). A Coarse-Grained Multicomputer Parallel Algorithm for the Sequential Substring Constrained Longest Common Subsequence Problem. *Parallel Computing*, 111(1), 102927. https://doi.org/10.1016/j.parco.2022.102927

Kengne, T. V., and Lacmou, Z. J. (2019). 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*, 4(2), 141–156. https://doi.org/10.1007/s41019-019-0093-9
Kengne, T. V., and Myoupo, J. F. (2012). An Efficient Coarse-Grain Multicomputer Algorithm for the Minimum Cost Parenthesizing Problem. *The Journal of Supercomputing, 61*(3), 463–480. https://doi.org/10.1007/s11227-011-0601-9

Kengne, T. V., Myoupo, J. F., and Dequen, G. (2016). High Performance CGM-based Parallel Algorithms for the Optimal Binary Search Tree Problem. *International Journal Grid High Performance Computing, 8*(4), 55–77. https://doi.org/10.4018/ijghpc.2016100104

Kengne, T. V., Nkonjoh, N. A., Lacmou, Z. J., and Myoupo, J. F. (2020). Efficient CGM-Based Parallel Algorithms for the Longest Common Subsequence Problem With Multiple Substring-Exclusion Constraints. *Parallel Computing, 91*(1), 102598. https://doi.org/10.1016/j.parco.2019.102598

Kessler, C., and Keller, J. (2007). Models for Parallel Computing: Review and Perspectives. *PARS-Mitteilunge, 24*(1), 13–29. http://www.ida.liu.se/~chrke55/papers/modelsurvey.pdf

Kielmann, T., and Gorlatch, S. (2011). Bandwidth-Latency Models (BSP, LogP). In *Encyclopedia of Parallel Computing* (Vol. 796, pp. 107–112). Springer Boston. https://doi.org/10.1007/978-0-387-09766-4_189

Knuth, D. E. (1971). Optimum Binary Search Trees. *Acta Informatica, 1*(1), 14–25. https://doi.org/10.1007/bf00264289

Knuth, D. E. (1997). *The Art of Computer Programming, Volume 1: Fundamental Algorithms* (3rd ed.). Addison-Wesley.

Knuth, D. E. (1998). *The Art of Computer Programming, Volume 3: Sorting and Searching* (2nd ed.). Addison-Wesley.

Kung, H. T. (1982). Why Systolic Architectures? *Computer, 15*(1), 37–46. https://doi.org/10.1109/mc.1982.1653825

Kung, H. T., and Leiserson, C. E. (1978). Algorithms for VLSI Processor Arrays. In *Proceedings of a Symposium on Sparse Matrices and Their Applications* (pp. 256–282). Knoxville, Tennessee, USA. https://www.eecs.harvard.edu/~htk/publication/1980-introduction-to-vlsi-systems-kung-leiserson.pdf

Lacmou, Z. J., and Kengne, T. V. (2018). Speeding up CGM-Based Parallel Algorithm for Minimum Cost Parenthesizing Problem. In the 2018 International Conference on Parallel and Distributed Processing Techniques and Applications (pp. 401–407). Las Vegas, Nevada, USA. https://hal.archives-ouvertes.fr/
Lacmou, Z. J., Kengne, T. V., and Myoupo, J. F. (2021). A Fast Sequential Algorithm for the Matrix Chain Ordering Problem. *Concurrency and Computation: Practice and Experience*, 33(24), e6445. https://doi.org/10.1002/cpe.6445

Lacmou, Z. J., Kengne, T. V., and Myoupo, J. F. (2022a). Coarse-Grained Multicomputer Parallel Algorithm Using the Four-Splitting Technique for the Minimum Cost Parenthesizing Problem. In *African Conference on Computer Science and Applied Mathematics* (pp. 1–12). Yaounde, Cameroon. https://hal.inria.fr/CARI2022/ hal-03712194

Lacmou, Z. J., Kengne, T. V., and Myoupo, J. F. (2022b). Four-Splitting Based Coarse-Grained Multicomputer Parallel Algorithm for the Optimal Binary Search Tree Problem. *International Journal of Parallel, Emergent and Distributed Systems*, 37(6), 659–679. https://doi.org/10.1080/17445760.2022.2102168

Lacmou, Z. J., Kengne, T. V., and Myoupo, J. F. (2022c). High-Performance CGM-Based Parallel Algorithms for Minimum Cost Parenthesizing Problem. *The Journal of Supercomputing*, 78(4), 5306–5332. https://doi.org/10.1007/s11227-021-04069-9

Lacmou, Z. J., Tessa, M. G. C., and Kamga, Y. F. I. (2020). A CGM-Based Parallel Algorithm Using the Four-Russians Speedup for the 1-D Sequence Alignment Problem. In *African Conference on Computer Science and Applied Mathematics* (pp. 1–11). Thies, Senegal. https://hal.inria.fr/CARI2020/hal-02925791

Land, A. H., and Doig, A. G. (1960). An Automatic Method of Solving Discrete Programming Problems. *Econometrica*, 28(3), 497–520. https://doi.org/10.2307/1910129

Lassous, I. G., Gustedt, J., and Morvan, M. (2000). Handling Graphs According to a Coarse Grained Approach: Experiments with PVM and MPI. In *Proceedings of the Seventh European PVM/MPI Users’ Group Meeting* (pp. 72–79). Balatonfüred, Veszprém, Hungary. https://doi.org/10.1007/3-540-45255-9_13

Lee, H., Kim, J., Hong, S. J., and Lee, S. (2003). Processor Allocation and Task Scheduling of Matrix Chain Products on Parallel Systems. *IEEE Transactions on Parallel and Distributed Systems*, 14(4), 394–407. https://doi.org/10.1109/tpds.2003.1195411

Leighton, F. T. (1992). *Introduction to Parallel Algorithms and Architectures*:
Arrays, Trees, Hypercubes (1st ed.). Morgan Kaufmann.

Levesque, J., and Wagenbreth, G. (2010). *High Performance Computing : Programming and Applications* (1st ed.). CRC Press.

Lew, A., and Mauch, H. (2007). *Dynamic Programming: A Computational Tool* (1st ed.). Springer Verlag.

Li, G., Zhao, Q., Song, M., Du, D., Yuan, J., Chen, X., and Liang, H. (2019). Predicting Global Computing Power of Blockchain Using Cryptocurrency Prices. In *the 2019 International Conference on Machine Learning and Cybernetics* (pp. 1–6). Kobe, Kansai, Japan. https://doi.org/10.1109/icmlc48188.2019.8949188

Lin, S. S. (1994). A Chained-Matrices Approach For Parallel Computation of Continued Fractions and Its Applications. *Journal of Scientific Computing*, 9(1), 65–80. https://doi.org/10.1007/bf01573178

Loshin, D. (2013). *Business Intelligence: The Savvy Managers Guide* (2nd ed.). Morgan Kaufmann.

Lovász, L. (2007). *Combinatorial Problems and Exercises* (2nd ed.). AMS Chelsea Publishing.

Mabrouk, B. B. (2016). *Application de la Programmation Dynamique Parallèle Pour la Résolution de Problèmes D'Optimisation Combinatoire* (Ph.D. Thesis). Université de Tunis El Manar.

Marvins, M. (1978). *Introduction to Modern Algebra* (1st ed.). Marcel Dekker.

McColl, W. F. (1995). Scalable Computing. In *Computer Science Today : Recent Trends and Developments* (Vol. 1000, pp. 46–61). Springer Verlag. https://doi.org/10.1007/bfb0015236

Midkiff, S. P. (2012). *Automatic Parallelization: An Overview of Fundamental Compiler Techniques* (1st ed.). Morgan Kaufmann.

Myoupo, J. F. (1992). Synthesizing Linear Systolic Arrays for Dynamic Programming Problems. *Parallel Processing Letters*, 2(1), 97–110. https://doi.org/10.1142/s0129626492000222

Myoupo, J. F. (1993). Mapping Dynamic Programming Onto Modular Linear Systolic Arrays. *Distributed Computing*, 6(3), 165–179. https://doi.org/10.1007/bf02242705
Myoupo, J. F., and Kengne, T. V. (2014a). An Efficient CGM-Based Parallel Algorithm Solving the Matrix Chain Ordering Problem. *International Journal of Grid and High Performance Computing, 6*(2), 74–100. https://doi.org/10.4018/ijghpc.2014040105

Myoupo, J. F., and Kengne, T. V. (2014b). Parallel Dynamic Programming for Solving the Optimal Search Binary Tree Problem on CGM. *International Journal of High Performance Computing and Networking, 7*(4), 269–280. https://doi.org/10.1504/ijhpcn.2014.062729

Nagaraj, S. (1997). Optimal Binary Search Trees. *Theoretical Computer Science, 188*(1-2), 1–44. https://doi.org/10.1016/s0304-3975(96)00320-9

Nielsen, F. (2016). *Introduction to HPC with MPI for Data Science* (1st ed.). Springer Switzerland.

Nishida, K., Ito, Y., and Nakano, K. (2011). Accelerating the Dynamic Programming for the Matrix Chain Product on the GPU. In *Proceedings of the Second International Conference on Networking and Computing* (pp. 320–326). Osaka, Kansai, Japan. https://doi.org/10.1109/icnc.2011.62

Nussinov, R., and Jacobson, A. B. (1980). Fast Algorithm for Predicting the Secondary Structure of Single-Stranded RNA. *Proceedings of the National Academy of Sciences of the United States of America, 77*(11), 6309–6313. https://doi.org/10.1073/pnas.77.11.6309

Olariu, S. (2008). Transistional Issues: Fine-Grain Multicomputers. In *Handbook of Parallel Computing: Models, Algorithms and Applications* (Vol. 1, pp. 235–256). CRC Press. https://doi.org/10.1201/9781420011296-16

Ozdamli, F., and Ozdal, H. (2015). Life-long Learning Competence Perceptions of the Teachers and Abilities in Using Information-Communication Technologies. *Procedia - Social and Behavioral Sciences, 182*(1), 718–725. https://doi.org/10.1016/j.sbspro.2015.04.819

Pacheco, P., and Malensek, M. (2021). *An Introduction to Parallel Programming* (2nd ed.). Morgan Kaufmann.

Palkowski, M., and Bielecki, W. (2017). Parallel Tiled Nussinov RNA Folding Loop Nest Generated Using Both Dependence Graph Transitive Closure and Loop Skewing. *BMC Bioinformatics, 18*(1), 290. https://doi.org/10.1186/s12859-017-1707-8
Prim, R. C. (1957). Shortest Connection Networks and Some Generalizations. *Bell System Technical Journal*, 36(6), 1389–1401. https://doi.org/10.1002/j.1538-7305.1957.tb01515.x

Quinn, M. J. (2003). *Parallel Programming in C with MPI and OpenMP* (1st ed.). McGraw-Hill.

Raina, S. (1992). *Virtual Shared Memory: A Survey of Techniques and Systems* (Tech. Rep. No. CSTR-92-36). Bristol, United Kingdom, England: Department of Computer Science, University of Bristol. https://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.60.5133&rep=rep1&type=pdf

Ramanan, P. (1996). An Efficient Parallel Algorithm for the Matrix-Chain-Product Problem. *SIAM Journal on Computing*, 25(4), 874–893. https://doi.org/10.1137/0225039

Rytter, W. (1988). On Efficient Parallel Computations for Some Dynamic Programming Problems. *Theoretical Computer Science*, 59(3), 297–307. https://doi.org/10.1016/0304-3975(88)90147-8

Schmidt, B., González-Domínguez, J., Hundt, C., and Schlarb, M. (2017). *Parallel programming: Concepts and practice* (1st ed.). Morgan Kaufmann.

Schreier, O., and Sperner, E. (2011). *Introduction to Modern Algebra and Matrix Theory* (2nd ed.). Dover Publications.

Shyamala, K., Kiran, K. R., and Rajeshwari, D. (2017). Design and Implementation of GPU-Based Matrix Chain Multiplication Using C++AMP. In *Proceedings of the 2017 Second IEEE International Conference on Electrical, Computer and Communication Technologies* (pp. 1–6). Coimbatore, Tamil Nadu, India: IEEE. https://doi.org/10.1109/icecct.2017.8117870

Sitaram, D., and Manjunath, G. (2012). *Moving To The Cloud: Developing Apps in the New World of Cloud Computing* (1st ed.). Syngress.

Stanley, R. P. (2015). *Catalan Numbers* (1st ed.). Cambridge University Press.

Steffen, M., Divincenzo, D. P., Chow, J. M., Theis, T. N., and Ketchen, M. B. (2011). Quantum computing: An IBM perspective. *IBM Journal of Research and Development*, 55(5), 1–13. https://doi.org/10.1147/jrd.2011.2165678

Sterling, T., Anderson, M., and Brodowicz, M. (2017). *High Performance Computing: Modern Systems and Practices* (1st ed.). Morgan Kaufmann.
Tan, G., Sun, N., and Gao, G. R. (2007). A Parallel Dynamic Programming Algorithm on a Multi-Core Architecture. In *Proceedings of the 19th Annual ACM Symposium on Parallel Algorithms and Architectures* (pp. 135–144). San Diego, California, USA. https://doi.org/10.1145/1248377.1248399

Tang, D., and Gupta, G. (1995). An Efficient Parallel Dynamic Programming Algorithm. *Computers Mathematics with Applications, 30*(8), 65–74. https://doi.org/10.1016/0898-1221(95)00138-o

Valiant, L. G. (1990). A Bridging Model for Parallel Computation. *Communications of the ACM*, **33**(8), 103–111. https://doi.org/10.1145/79173.79181

Valiant, L. G. (2011). A Bridging Model for Multi-Core Computing. *Journal of Computer and System Sciences*, *77*(1), 154–166. https://doi.org/10.1016/j.jcss.2010.06.012

Valiant, L. G., Skyum, S., Berkowitz, S., and Rackoff, C. (1983). Fast Parallel Computation of Polynomials Using Few Processors. *SIAM Journal on Computing*, *12*(4), 641–644. https://doi.org/10.1137/0212043

Vitorović, A., Tomašević, M. V., and Milutinović, V. M. (2014). Manual Parallelization Versus State-of-the-Art Parallelization Techniques: The SPEC CPU2006 as a Case Study. *Advances in Computers*, *92*(1), 203–251. https://doi.org/10.1016/b978-0-12-420232-0.00005-2

von Neumann, J. (1945). *First Draft of a Report on the EDVAC* (Tech. Rep. No. W-670-ORD-4926). Philadelphia, Pennsylvania, USA: Moore School of Electrical Engineering, University of Pennsylvania. http://web.mit.edu/sts.035/www/pdfs/edvac.pdf

Wagner, R. A., and Fischer, M. J. (1974). The String-to-String Correction Problem. *Journal of the ACM*, **21**(1), 168–173. https://doi.org/10.1145/321796.321811

Wah, B. W., and Li, G. J. (1988). Systolic Processing for Dynamic Programming Problems. *Circuits, Systems, and Signal Processing*, *7*(2), 119–149. https://doi.org/10.1007/bf01602094

Wani, M. A., and Ahmad, M. (2019). Statically Optimal Binary Search Tree Computation Using Non-Serial Polyadic Dynamic Programming on GPU’s. *International Journal of Grid and High Performance Computing*, **11**(1), 49–70. https://doi.org/10.4018/ijghpc.2019010104

Wu, C.-l., and Feng, T. (1984). *Tutorial: Interconnection Networks for Parallel*
*and Distributed Processing* (1st ed.). IEEE Press.

Yao, F. F. (1982). Speed-up in Dynamic Programming. *SIAM Journal on Algebraic Discrete Methods*, 3(4), 532–540. https://doi.org/10.1137/0603055

Yau, S.-T., and Lu, Y. Y. (1993). Reducing the Symmetric Matrix Eigenvalue Problem to Matrix Multiplications. *SIAM Journal on Scientific Computing*, 14(1), 121–136. https://doi.org/10.1137/0914008

Younger, D. H. (1967). Recognition and Parsing of Context-Free Languages in Time $n^3$. *Information and Control*, 10(2), 189–208. https://doi.org/10.1016/s0019-9958(67)80007-x

Yzelman, A. J. N., and Roosevelt, D. (2014). High-Level Strategies for Parallel Shared-Memory Sparse Matrix-Vector Multiplication. *IEEE Transactions on Parallel and Distributed Systems*, 25(1), 116–125. https://doi.org/10.1109/tpds.2013.31

Zhong, H.-S., Wang, H., Deng, Y.-H., Chen, M.-C., Peng, L.-C., Luo, Y.-H., ... Pan, J.-W. (2020). Quantum Computational Advantage Using Photons. *Science*, 370(6523), 1460–1463. https://doi.org/10.1126/science.abe8770
# List of Publications

## International journals

Kengne Tchendji Vianney and Lacmou Zeutouo Jerry (2019). 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, 4*(2), 141-156. https://doi.org/10.1007/s41019-019-0093-9

Lacmou Zeutouo Jerry, Kengne Tchendji Vianney, and Myoupo Jean Frédéric (2021). A Fast Sequential Algorithm for the Matrix Chain Ordering Problem. *Concurrency and Computation: Practice and Experience*, 33(24), e6445. https://doi.org/10.1002/cpe.6445

Lacmou Zeutouo Jerry, Kengne Tchendji Vianney, and Myoupo Jean Frédéric (2022). High-Performance CGM-Based Parallel Algorithms for Minimum Cost Parenthesizing Problem. *The Journal of Supercomputing*, 78(4), 5306-5332. https://doi.org/10.1007/s11227-021-04069-9

Lacmou Zeutouo Jerry, Kengne Tchendji Vianney, and Myoupo Jean Frédéric (2022). Four-Splitting Based Coarse-Grained Multicomputer Parallel Algorithm for the Optimal Binary Search Tree Problem. *International Journal of Parallel, Emergent and Distributed Systems*, 37(6), 659-679. https://doi.org/10.1080/17445760.2022.2102168

## International conference

Lacmou Zeutouo Jerry and Kengne Tchendji Vianney (2018). Speeding up CGM-Based Parallel Algorithm for Minimum Cost Parenthesizing Problem. In *the 2018 International Conference on Parallel and Distributed Processing Techniques and Applications* (pp. 401-407). Las Vegas, Nevada, USA. https://hal.archives-ouvertes.fr/hal-01900171
Lacmou Zeutouo Jerry, Kengne Tchendji Vianney, and Myoupo Jean Frédéric (2022). Coarse-Grained Multicomputer Parallel Algorithm Using the Four-Splitting Technique for the Minimum Cost Parenthesizing Problem. In *African Conference on Computer Science and Applied Mathematics* (pp. 1-12), Yaounde, Cameroon.
https://hal.inria.fr/CARI2022/hal-03712194