Rankings
Publications
Search Publications
Cited-by Search
Sources
Publishers
Scholars
Scholars
Top Cited Scholars
Organizations
About
Scilit
About Us
Advisory Board
Data Sources
Career
Support / Contact
User Guide
Publisher User
Search Function
Rankings Function
API Resource
Scilit Knowledge
Metrics
Scilit Recognitions
Publications Classification
Media
News
Blog
Login
Register
Home
Publications
A New Linear-Time ``On-Line'' Algorithm for Finding the Smallest Initial Palindrome of a String
Home
Publications
A New Linear-Time ``On-Line'' Algorithm for Finding the Smallest Initial Palindrome of a String
A New Linear-Time ``On-Line'' Algorithm for Finding the Smallest Initial Palindrome of a String
Author:
GM
Glenn Manacher
Glenn Manacher
Citation Alert
Add to Library
Cite
Download
Share
Download
Download PDF
Download
Open Access
Publisher website
Google Scholar
1 July 1975
journal article
Published by
Association for Computing Machinery (ACM)
in
Journal of the ACM
Vol. 22
(3)
,
346-351
DOI:
10.1145/321892.321896
Abstract
No abstract available
Cited
Cited by 176 articles
Scroll to top