Revision as of 20:38, 30 July 2005 edit Edemaine (talk \| contribs) 496 edits →Shifting substrings search and competing algorithms: use Theta instead of Omega ← Previous edit		Revision as of 01:08, 12 August 2005 edit undo Nethgirb (talk \| contribs) 2,103 edits m Added link Next edit →
Line 78: ==References== * Karp and Rabin's original paper: [[Richard Karp\|Karp, Richard M.]]; Rabin, Michael O. (March 1987). "[http://www.research.ibm.com/journal/rd/312/ibmrd3102P.pdf Efficient randomized pattern-matching algorithms]". ''IBM Journal of Research and Development'' '''31''' (2), 249-260. [[Category:Algorithms on strings]]

Rabin–Karp algorithm: Difference between revisions