Jack Edmonds et Richard M. Karp, « Theoretical improvements in algorithmic efficiency for network flow problems », Journal of the ACM, Association for Computing Machinery (ACM), vol. 19, no 2, , p. 248–264 (DOI10.1145/321694.321699)
John Hopcroft et Richard Karp, « An n5/2 algorithm for maximum matchings in bipartite graphs », SIAM Journal on Computing, vol. 2, no 4, , p. 225-231 (DOI10.1137/0202019)
Richard M. Karp et Richard J. Lipton, « Some connections between nonuniform and uniform complexity classes », dans Symposium on Theory of Computing, (DOI10.1145/800141.804678), p. 302-309.
Richard M. nom2=Rabin Karp, « Efficient randomized pattern-matching algorithms », IBM Journal of Research and Development, vol. 31, no 2, , p. 249–260 (DOI10.1147/rd.312.0249, lire en ligne).
Richard M. nom2=Rabin Karp, « Efficient randomized pattern-matching algorithms », IBM Journal of Research and Development, vol. 31, no 2, , p. 249–260 (DOI10.1147/rd.312.0249, lire en ligne).