• Pilato C and Soldavini S. (2025). Accelerator Design with High-Level Synthesis. Handbook of Computer Architecture. 10.1007/978-981-97-9314-3_19. (841-873).

    https://link.springer.com/10.1007/978-981-97-9314-3_19

  • Hussein E, Waschneck B and Mayr C. (2024). Automating application-driven customization of ASIPs: A survey. Journal of Systems Architecture. 10.1016/j.sysarc.2024.103080. 148. (103080). Online publication date: 1-Mar-2024.

    https://linkinghub.elsevier.com/retrieve/pii/S1383762124000171

  • Brumar I, Zacharopoulos G, Yao Y, Rama S, Brooks D and Wei G. (2023). Early DSE and Automatic Generation of Coarse-grained Merged Accelerators. ACM Transactions on Embedded Computing Systems. 22:2. (1-29). Online publication date: 31-Mar-2023.

    https://doi.org/10.1145/3546070

  • Pilato C and Soldavini S. (2022). Accelerator Design with High-Level Synthesis. Handbook of Computer Architecture. 10.1007/978-981-15-6401-7_19-1. (1-33).

    https://link.springer.com/10.1007/978-981-15-6401-7_19-1

  • Wongjak A. (2021). Text Compare and Grouping Program using Dynamic Programming Algorithm 2021 Research, Invention, and Innovation Congress: Innovation Electricals and Electronics (RI2C). 10.1109/RI2C51727.2021.9559779. 978-1-6654-0300-9. (303-306).

    https://ieeexplore.ieee.org/document/9559779/

  • Horn M and Raidl G. (2021). A$$^*$$-Based Compilation of Relaxed Decision Diagrams for the Longest Common Subsequence Problem. Integration of Constraint Programming, Artificial Intelligence, and Operations Research. 10.1007/978-3-030-78230-6_5. (72-88).

    https://link.springer.com/10.1007/978-3-030-78230-6_5

  • Blum C, Djukanovic M, Santini A, Jiang H, Li C, Manyà F and Raidl G. (2020). Solving Longest Common Subsequence Problems via a Transformation to the Maximum Clique Problem. Computers & Operations Research. 10.1016/j.cor.2020.105089. (105089). Online publication date: 1-Sep-2020.

    https://linkinghub.elsevier.com/retrieve/pii/S0305054820302069

  • Horn M, Djukanovic M, Blum C and Raidl G. (2020). On the Use of Decision Diagrams for Finding Repetition-Free Longest Common Subsequences. Optimization and Applications. 10.1007/978-3-030-62867-3_11. (134-149).

    http://link.springer.com/10.1007/978-3-030-62867-3_11

  • Islam M, Saifullah C, Asha Z and Ahamed R. (2019). Chemical reaction optimization for solving longest common subsequence problem for multiple string. Soft Computing - A Fusion of Foundations, Methodologies and Applications. 23:14. (5485-5509). Online publication date: 1-Jul-2019.

    https://doi.org/10.1007/s00500-018-3200-3

  • Djukanovic M, Raidl G and Blum C. (2019). A Beam Search for the Longest Common Subsequence Problem Guided by a Novel Approximate Expected Length Calculation. Machine Learning, Optimization, and Data Science. 10.1007/978-3-030-37599-7_14. (154-167).

    http://link.springer.com/10.1007/978-3-030-37599-7_14

  • Djukanovic M, Raidl G and Blum C. (2019). Exact and Heuristic Approaches for the Longest Common Palindromic Subsequence Problem. Learning and Intelligent Optimization. 10.1007/978-3-030-05348-2_18. (199-214).

    https://link.springer.com/10.1007/978-3-030-05348-2_18

  • Chen H and Chen S. (2018). Fast automatic generation of efficient custom instructions for application-aware computing 2018 Tenth International Conference on Advanced Computational Intelligence (ICACI ). 10.1109/ICACI.2018.8377621. 978-1-5386-4362-4. (283-288).

    https://ieeexplore.ieee.org/document/8377621/

  • Ng H, Liu S and Luk W. ADAM. Proceedings of the 2018 ACM/SIGDA International Symposium on Field-Programmable Gate Arrays. (189-198).

    https://doi.org/10.1145/3174243.3174247

  • Willsey M, Lee V, Cheung A, Bodik R and Ceze L. Iterative Search for Reconfigurable Accelerator Blocks with a Compiler in the Loop. IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems. 10.1109/TCAD.2018.2878194. (1-1).

    https://ieeexplore.ieee.org/document/8509181/

  • (2016). Bibliography. Metaheuristics for String Problems in Bio‐Informatics. 10.1002/9781119136798.biblio. (187-204). Online publication date: 30-Aug-2016.

    https://onlinelibrary.wiley.com/doi/10.1002/9781119136798.biblio

  • Dammak B, Baklouti M, Benmansour R, Niar S and Abid M. (2015). Hardware resource utilization optimization in FPGA-based Heterogeneous MPSoC architectures. Microprocessors & Microsystems. 39:8. (1108-1118). Online publication date: 1-Nov-2015.

    https://doi.org/10.1016/j.micpro.2015.05.006

  • Nery A, Nedjah N, França F, Jóźwiak L and Corporaal H. (2015). Automatic complex instruction identification for efficient application mapping onto application-specific instruction set processors. Analog Integrated Circuits and Signal Processing. 85:1. (139-158). Online publication date: 1-Oct-2015.

    https://doi.org/10.1007/s10470-015-0585-0

  • Perier J, Chouchene W and Dekeyser J. (2015). Circuit Merging Versus Dynamic Partial Reconfiguration - The HoMade Implementation. i-manager's Journal on Embedded Systems. 10.26634/jes.4.1.3691. 4:1. (14-23). Online publication date: 15-Apr-2015.

    http://www.imanagerpublications.com/article/3691

  • Mokhov A, Iliasov A, Sokolov D, Rykunov M, Yakovlev A and Romanovsky A. (2014). Synthesis of Processor Instruction Sets from High-Level ISA Specifications. IEEE Transactions on Computers. 63:6. (1552-1566). Online publication date: 1-Jun-2014.

    https://doi.org/10.1109/TC.2013.37

  • Yazdanbakhsh A, Salehi M and Fakhraie S. (2014). Customized pipeline and instruction set architecture for embedded processing engines. The Journal of Supercomputing. 68:2. (948-977). Online publication date: 1-May-2014.

    https://doi.org/10.1007/s11227-013-1075-8

  • Javaid H and Parameswaran S. (2014). Multi-mode Pipelined MPSoCs. Pipelined Multiprocessor System-on-Chip for Multimedia. 10.1007/978-3-319-01113-4_8. (147-162).

    https://link.springer.com/10.1007/978-3-319-01113-4_8

  • Yoon J, Lee J, Park S, Kim Y, Lee J, Paek Y and Cho D. (2013). Architecture customization of on-chip reconfigurable accelerators. ACM Transactions on Design Automation of Electronic Systems. 18:4. (1-22). Online publication date: 1-Oct-2013.

    https://doi.org/10.1145/2493384

  • Chen Y and Zhou H. Resource-constrained high-level datapath optimization in ASIP design. Proceedings of the Conference on Design, Automation and Test in Europe. (198-201).

    /doi/10.5555/2485288.2485339

  • Kamal M, Yazdanbakhsh A, Noori H, Afzali-Kusha A and Pedram M. (2013). A new merit function for custom instruction selection under an area budget constraint. Design Automation for Embedded Systems. 17:1. (1-25). Online publication date: 1-Mar-2013.

    https://doi.org/10.1007/s10617-013-9117-2

  • Cong J and Gururaj K. Architecture support for custom instructions with memory operations. Proceedings of the ACM/SIGDA international symposium on Field programmable gate arrays. (231-234).

    https://doi.org/10.1145/2435264.2435303

  • Lin H and Fei Y. (2012). Resource Sharing of Pipelined Custom Hardware Extension for Energy-Efficient Application-Specific Instruction Set Processor Design. ACM Transactions on Design Automation of Electronic Systems. 17:4. (1-20). Online publication date: 1-Oct-2012.

    https://doi.org/10.1145/2348839.2348843

  • Stojilović M, Novo D, Saranovac L, Brisk P and Ienne P. Selective flexibility. Proceedings of the Conference on Design, Automation and Test in Europe. (1543-1548).

    /doi/10.5555/2492708.2493086

  • Zuluaga M, Bonilla E and Topham N. Predicting best design trade-offs. Proceedings of the Conference on Design, Automation and Test in Europe. (1030-1035).

    /doi/10.5555/2492708.2492964

  • Salehi M, Fakhraie S and Yazdanbakhsh A. (2012). Instruction set architectural guidelines for embedded packet-processing engines. Journal of Systems Architecture: the EUROMICRO Journal. 58:3-4. (112-125). Online publication date: 1-Mar-2012.

    https://doi.org/10.1016/j.sysarc.2012.02.004

  • Mousavi S and Tabataba F. (2012). An improved algorithm for the longest common subsequence problem. Computers and Operations Research. 39:3. (512-520). Online publication date: 1-Mar-2012.

    https://doi.org/10.1016/j.cor.2011.02.026

  • Fazlali M, Zakerolhosseini A and Gaydadjiev G. (2012). Efficient datapath merging for the overhead reduction of run-time reconfigurable systems. The Journal of Supercomputing. 59:2. (636-657). Online publication date: 1-Feb-2012.

    https://doi.org/10.1007/s11227-010-0458-3

  • Wildermann S, Angermeier J, Sibirko E and Teich J. (2012). Placing multimode streaming applications on dynamically partially reconfigurable architectures. International Journal of Reconfigurable Computing. 2012. (9-9). Online publication date: 1-Jan-2012.

    https://doi.org/10.1155/2012/608312

  • (2011). References. Computer System Design. 10.1002/9781118009925.refs. (316-328). Online publication date: 18-Jul-2011.

    https://onlinelibrary.wiley.com/doi/10.1002/9781118009925.refs

  • Galuzzi C and Bertels K. (2011). The Instruction-Set Extension Problem. ACM Transactions on Reconfigurable Technology and Systems. 4:2. (1-28). Online publication date: 1-May-2011.

    https://doi.org/10.1145/1968502.1968509

  • Lozano M and Blum C. A hybrid metaheuristic for the longest common subsequence problem. Proceedings of the 7th international conference on Hybrid metaheuristics. (1-15).

    /doi/10.5555/1926965.1926966

  • Lin H and Fei Y. Exploring custom instruction synthesis for application-specific instruction set processors with multiple design objectives. Proceedings of the 16th ACM/IEEE international symposium on Low power electronics and design. (141-146).

    https://doi.org/10.1145/1840845.1840875

  • Pothineni N, Brisk P, Ienne P, Kumar A and Paul K. A high-level synthesis flow for custom instruction set extensions for application-specific processors. Proceedings of the 2010 Asia and South Pacific Design Automation Conference. (707-712).

    /doi/10.5555/1899721.1899885

  • Lozano M and Blum C. (2010). A Hybrid Metaheuristic for the Longest Common Subsequence Problem. Hybrid Metaheuristics. 10.1007/978-3-642-16054-7_1. (1-15).

    http://link.springer.com/10.1007/978-3-642-16054-7_1

  • Wolinski C, Kuchcinski K and Raffin E. (2009). Automatic design of application-specific reconfigurable processor extensions with UPaK synthesis kernel. ACM Transactions on Design Automation of Electronic Systems. 15:1. (1-36). Online publication date: 1-Dec-2009.

    https://doi.org/10.1145/1640457.1640458

  • Zuluaga M and Topham N. (2009). Design-space exploration of resource-sharing solutions for custom instruction set extensions. IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems. 28:12. (1788-1801). Online publication date: 1-Dec-2009.

    https://doi.org/10.1109/TCAD.2009.2026355

  • Fazlali M, Fallah M, Zolghadr M and Zakerolhosseini A. A New Datapath Merging Method for Reconfigurable System. Proceedings of the 5th International Workshop on Reconfigurable Computing: Architectures, Tools and Applications. (157-168).

    https://doi.org/10.1007/978-3-642-00641-8_17

  • Bauer L, Shafique M and Henkel J. (2008). Efficient resource utilization for an extensible processor through dynamic instruction set adaptation. IEEE Transactions on Very Large Scale Integration (VLSI) Systems. 16:10. (1295-1308). Online publication date: 1-Oct-2008.

    https://doi.org/10.1109/TVLSI.2008.2002430

  • Chong Y and Parameswaran S. Rapid application specific floating-point unit generation with bit-alignment. Proceedings of the 45th annual Design Automation Conference. (62-67).

    https://doi.org/10.1145/1391469.1391487

  • Easton T and Singireddy A. (2008). A large neighborhood search heuristic for the longest common subsequence problem. Journal of Heuristics. 14:3. (271-283). Online publication date: 1-Jun-2008.

    https://doi.org/10.1007/s10732-007-9038-y

  • Bauer L, Shafique M, Kramer S and Henkel J. RISPP. Proceedings of the 44th annual Design Automation Conference. (791-796).

    https://doi.org/10.1145/1278480.1278678

  • Chong Y and Parameswaran S. Automatic application specific floating-point unit generation. Proceedings of the conference on Design, automation and test in Europe. (461-466).

    /doi/10.5555/1266366.1266464

  • Henkel J, Parameswaran S and Cheung N. (2007). Application-Specific Embedded Processors. Designing Embedded Processors. 10.1007/978-1-4020-5869-1_1. (3-23).

    http://link.springer.com/10.1007/978-1-4020-5869-1_1

  • Cheema M and Hammami O. (2006). Application-specific SIMD synthesis for reconfigurable architectures. Microprocessors and Microsystems. 10.1016/j.micpro.2006.02.011. 30:6. (398-412). Online publication date: 1-Sep-2006.

    https://linkinghub.elsevier.com/retrieve/pii/S0141933106000342

  • Cheema M and Hammami O. Customized SIMD unit synthesis for system on programmable chip. Proceedings of the 2006 Asia and South Pacific Design Automation Conference. (54-60).

    https://doi.org/10.1145/1118299.1118313

  • Souza C, Lima A, Araujo G and Moreano N. (2005). The datapath merging problem in reconfigurable systems. ACM Journal of Experimental Algorithmics. 10. (2.2-es). Online publication date: 31-Dec-2005.

    https://doi.org/10.1145/1064546.1180613

  • Witte E, Chattopadhyay A, Schliebusch O and Kammler D. Applying Resource Sharing Algorithms to ADL-driven Automatic ASIP Implementation. Proceedings of the 2005 International Conference on Computer Design. (193-199).

    https://doi.org/10.1109/ICCD.2005.25

  • Cheung N, Parameswaran S and Henkel J. Battery-aware instruction generation for embedded processors. Proceedings of the 2005 Asia and South Pacific Design Automation Conference. (553-556).

    https://doi.org/10.1145/1120725.1120960