Matches in DBpedia 2015-04 for { <http://dbpedia.org/resource/Knuth%E2%80%93Morris%E2%80%93Pratt_algorithm> ?p ?o }
Showing triples 1 to 31 of
31
with 100 triples per page.
- Knuth%E2%80%93Morris%E2%80%93Pratt_algorithm abstract "In computer science, the Knuth–Morris–Pratt string searching algorithm (or KMP algorithm) searches for occurrences of a "word" W within a main "text string" S by employing the observation that when a mismatch occurs, the word itself embodies sufficient information to determine where the next match could begin, thus bypassing re-examination of previously matched characters.The algorithm was conceived in 1974 by Donald Knuth and Vaughan Pratt, and independently by James H. Morris. The three published it jointly in 1977.".
- Knuth%E2%80%93Morris%E2%80%93Pratt_algorithm wikiPageExternalLink 0.
- Knuth%E2%80%93Morris%E2%80%93Pratt_algorithm wikiPageExternalLink KMPSearch.html.
- Knuth%E2%80%93Morris%E2%80%93Pratt_algorithm wikiPageExternalLink kmp.en.html.
- Knuth%E2%80%93Morris%E2%80%93Pratt_algorithm wikiPageExternalLink node8.html.
- Knuth%E2%80%93Morris%E2%80%93Pratt_algorithm wikiPageExternalLink String.html.
- Knuth%E2%80%93Morris%E2%80%93Pratt_algorithm wikiPageExternalLink 960227.html.
- Knuth%E2%80%93Morris%E2%80%93Pratt_algorithm wikiPageExternalLink kmp.
- Knuth%E2%80%93Morris%E2%80%93Pratt_algorithm wikiPageExternalLink kmpen.htm.
- Knuth%E2%80%93Morris%E2%80%93Pratt_algorithm wikiPageExternalLink watch?v=Zj_er99KMb8.
- Knuth%E2%80%93Morris%E2%80%93Pratt_algorithm wikiPageID "253227".
- Knuth%E2%80%93Morris%E2%80%93Pratt_algorithm wikiPageRevisionID "645726534".
- Knuth%E2%80%93Morris%E2%80%93Pratt_algorithm hasPhotoCollection Knuth–Morris–Pratt_algorithm.
- Knuth%E2%80%93Morris%E2%80%93Pratt_algorithm subject Category:Articles_with_example_pseudocode.
- Knuth%E2%80%93Morris%E2%80%93Pratt_algorithm subject Category:Donald_Knuth.
- Knuth%E2%80%93Morris%E2%80%93Pratt_algorithm subject Category:String_matching_algorithms.
- Knuth%E2%80%93Morris%E2%80%93Pratt_algorithm comment "In computer science, the Knuth–Morris–Pratt string searching algorithm (or KMP algorithm) searches for occurrences of a "word" W within a main "text string" S by employing the observation that when a mismatch occurs, the word itself embodies sufficient information to determine where the next match could begin, thus bypassing re-examination of previously matched characters.The algorithm was conceived in 1974 by Donald Knuth and Vaughan Pratt, and independently by James H. Morris.".
- Knuth%E2%80%93Morris%E2%80%93Pratt_algorithm label "Algorithme de Knuth-Morris-Pratt".
- Knuth%E2%80%93Morris%E2%80%93Pratt_algorithm label "Algoritma Knuth-Morris-Pratt".
- Knuth%E2%80%93Morris%E2%80%93Pratt_algorithm label "Algoritmo Knuth-Morris-Pratt".
- Knuth%E2%80%93Morris%E2%80%93Pratt_algorithm label "Algoritmo de Knuth-Morris-Pratt".
- Knuth%E2%80%93Morris%E2%80%93Pratt_algorithm label "Algoritmo di Knuth-Morris-Pratt".
- Knuth%E2%80%93Morris%E2%80%93Pratt_algorithm label "Algorytm Knutha-Morrisa-Pratta".
- Knuth%E2%80%93Morris%E2%80%93Pratt_algorithm label "Knuth-Morris-Pratt-Algorithmus".
- Knuth%E2%80%93Morris%E2%80%93Pratt_algorithm label "Knuth–Morris–Pratt algorithm".
- Knuth%E2%80%93Morris%E2%80%93Pratt_algorithm label "Алгоритм Кнута — Морриса — Пратта".
- Knuth%E2%80%93Morris%E2%80%93Pratt_algorithm label "クヌース-モリス-プラット法".
- Knuth%E2%80%93Morris%E2%80%93Pratt_algorithm label "커누스-모리스-프랫 알고리즘".
- Knuth%E2%80%93Morris%E2%80%93Pratt_algorithm sameAs m.01lksg.
- Knuth%E2%80%93Morris%E2%80%93Pratt_algorithm wasDerivedFrom Knuth–Morris–Pratt_algorithm?oldid=645726534.
- Knuth%E2%80%93Morris%E2%80%93Pratt_algorithm isPrimaryTopicOf Knuth–Morris–Pratt_algorithm.