Ermin Hodžić

In this paper, we will explore algorithms for identifying palindromes within strings. While the problem of finding palindromes is currently not known to be particularly significant, it nevertheless represents an opportunity to explore searching with constraints that ultimately allow clever performance improvements. We also get the opportunity to showcase a wide variety of approaches to solving the problem. Methods that range from brute-force solutions, to clever but still slow algorithms, to using specialized and advanced data structures, to optimal custom-tailored algorithms -- this problem has it all.

Please refer to the PDF LaTeX document for the description.