Content deleted Content added
No edit summary |
|||
Line 127:
| doi = 10.1016/0304-3975(94)00083-U
| pages = 163–173| url = https://docs.lib.purdue.edu/cgi/viewcontent.cgi?article=2068&context=cstech
}}.
*{{citation
| last1 = Charalampopoulos | first1 = Panagiotis
| last2 = Pissis | first2 = Solon P.
| last3 = Radoszewski | first3 = Jakub
| title = Longest Palindromic Substring in Sublinear Time
| journal = 33rd Annual Symposium on Combinatorial Pattern Matching, CPM 2022, June 27-29, 2022, Prague, Czech Republic
| volume = 223
| year = 2022
| doi = 10.4230/LIPIcs.CPM.2022.20
| pages = 20:1--20:9| url = https://doi.org/10.4230/LIPIcs.CPM.2022.20
}}.
*{{citation
|