Skip to search formSkip to main contentSkip to account menu

Rabin–Karp algorithm

Known as: Karp–Rabin algorithm, Rabin-Karp, Karp-Rabin string matching 
In computer science, the Rabin–Karp algorithm or Karp–Rabin algorithm is a string searching algorithm created by Richard M. Karp and Michael O. Rabin… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2019
2019
Every year the xyz organization conducts written tests for participants who will be administrators of the xyz organization… 
2018
2018
Rabin Karp algorithm is a search algorithm that searches for a substring pattern in a text using hashing. It is beneficial for… 
2017
2017
Plagiarism is an act that is considered by the university as a fraud by taking someone ideas or writings without mentioning the… 
2017
2017
String matching refers to the search of each and every occurrence of a string in another string. Nowadays, this issue presents… 
2015
2015
In today word copying something from other sources and claiming it as an own contribution is a crime. We have also seen it is… 
2011
2011
Exact string matching refers to the search of each and any occurrences of a string in another string. Nowadays, this issue… 
Highly Cited
2009
Highly Cited
2009
Numerous approaches based on metrics, token sequence pattern-matching, abstract syntax tree (AST) or program dependency graph… 
2007
2007
Plagio em submissoes de alunos e um problema que vem aumentando ao longo do tempo e instituicoes de ensino tem trabalho… 
2003
2003
A system for aligning nucleotide or amino acid biosequences is described. The system, called Neweyes, employs a novel string… 
Highly Cited
2001
Highly Cited
2001
Optimal Asymmetric Encryption Padding (OAEP) is a technique for converting the RSA trapdoor permutation into a chosen cipher-text…