%0 Journal Article %1 journals/ipl/MooreS94 %A Moore, Dennis W. G. %A Smyth, William F. %D 1994 %J Inf. Process. Lett. %K dblp %N 5 %P 239-246 %T An Optimal Algorithm to Compute all the Covers of a String. %U http://dblp.uni-trier.de/db/journals/ipl/ipl50.html#MooreS94 %V 50

@article{journals/ipl/MooreS94, added-at = {2017-12-18T00:00:00.000+0100}, author = {Moore, Dennis W. G. and Smyth, William F.}, biburl = {https://www.bibsonomy.org/bibtex/2d71e8e98079c53ddb670185f22f2a9ec/dblp}, ee = {https://doi.org/10.1016/0020-0190(94)00045-X}, interhash = {f6e1daf8d734acc5000f63f86116f64f}, intrahash = {d71e8e98079c53ddb670185f22f2a9ec}, journal = {Inf. Process. Lett.}, keywords = {dblp}, number = 5, pages = {239-246}, timestamp = {2017-12-19T11:34:31.000+0100}, title = {An Optimal Algorithm to Compute all the Covers of a String.}, url = {http://dblp.uni-trier.de/db/journals/ipl/ipl50.html#MooreS94}, volume = 50, year = 1994 }