Lee, T., & Lin, H. (2024). Near-Optimal Quantum Algorithm for Finding the Longest Common Substring between Run-Length Encoded Strings.
Chicago Style (17th ed.) CitationLee, Tzu-Ching, and Han-Hsuan Lin. Near-Optimal Quantum Algorithm for Finding the Longest Common Substring Between Run-Length Encoded Strings. 2024.
MLA (9th ed.) CitationLee, Tzu-Ching, and Han-Hsuan Lin. Near-Optimal Quantum Algorithm for Finding the Longest Common Substring Between Run-Length Encoded Strings. 2024.
Warning: These citations may not always be 100% accurate.