Author:
Cantone Domenico,Faro Simone,Pavone Arianna,Viola Caterina
Publisher
Springer Nature Switzerland
Reference20 articles.
1. Balauca, S., Arusoaie, A.: Efficient constructions for simulating multi controlled quantum gates. In: Groen, D., de Mulatier, C., Paszynski, M., Krzhizhanovskaya, V.V., Dongarra, J.J., Sloot, P.M.A. (eds.) Computational Science, ICCS 2022. LNCS, vol. 13353, pp. 179–194. Springer, Cham (2022). https://doi.org/10.1007/978-3-031-08760-8_16
2. Barenco, A., et al.: Elementary gates for quantum computation. Phys. Rev. A 52(5), 3457–3467 (1995)
3. Bieganski, Riedl, Cartis, Retzel: Generalized suffix trees for biological sequence data: applications and implementation. In: 1994 Proceedings of the Twenty-Seventh Hawaii International Conference on System Sciences, vol. 5, pp. 35–44 (1994)
4. Cantone, D., Faro, S., Pavone, A.: Quantum string matching unfolded and extended. In: Kutrib, M., Meyer, U. (eds.) Reversible Computation, RC 2023. LNCS, vol. 13960, pp. 117–133. Springer, Cham (2023). https://doi.org/10.1007/978-3-031-38100-3_9
5. Cantone, D., Faro, S., Pavone, A., Viola, C.: Longest common substring and longest palindromic substring $$\tilde{\cal{O}}(\sqrt{n})$$ time (2023)