
	Where results make sense

Topic: Karp Rabin

Related Topics

Miller Rabin primality test

Michael O Rabin

Trevor Rabin

Rabin Karp string search algorithm

Itzhak Rabin

Yitzak Rabin

Rabin cryptosystem

Yitschak Rabin

Rabin automaton

Robert Rabin

Karp Rabin

In the News (Sat 22 Nov 08)

Lee Scott

Annika Sorenstam

Norm Coleman

Benji Madden

Freddie Mac

Puerto Rico

Vladimir Putin

Treasury Department

Mitt Romney

Giovanni Trapattoni

	Richard Karp - Wikipedia, the free encyclopedia
		Richard M. Karp (born 1935) is a computer scientist, notable for research in the theory of algorithms, for which he received a Turing Award in 1985.
		Karp was also the recipient of the 2004 Benjamin Franklin Medal in Computer and Cognitive Science for his insights into computational complexity.
		Karp introduced the now standard methodology for proving problems to be NP-complete which has led to the identification of many theoretical and practical problems as being computationally difficult.
	en.wikipedia.org /wiki/Richard_Karp (276 words)

	ipedia.com: Michael O. Rabin Article (Site not responding. Last check: 2007-11-02)
		Michael Rabin (born 1931) is a noted computer scientist and a recipient of the Turing Award, the most prestigious award in the field.
		Rabin was born in what was then known as Breslau, Germany (it became Wroclaw, and part of Poland, after the Second World War).
		In 1975, Rabin also invented a randomized algorithm that could determine very quickly, but with a tiny probability of error, whether a number was a prime number.
	www.ipedia.com /michael_o__rabin.html (297 words)

	[No title]
		DR. RABIN: Ron Rabin, senior staff fellow in the Laboratory of Immunobiochemistry in CBER.
		Ron Rabin will talk to you for about a half hour, giving you an overview of our research activities in the lab.
		Ron Rabin, whom you'll be hearing from a little bit later, has been with us for four years.
	www.fda.gov /ohrms/dockets/AC/05/transcripts/2005-4103t1.doc (22530 words)

	[No title] (Site not responding. Last check: 2007-11-02)
		/* File: rk.java Rabin Karp algorithm Its preprocessing phase has order O(m) where m is the length of the pattern.
		Its matching phase has order O((n - m + 1) m) where n is the length of the text.
		Note that a left shift by 1 corresponds to a multiplication by 2.
	www.cbu.edu /~yanushka/alg/j/rk.java (512 words)

	src/zlib/deflate.c Source File (Site not responding. Last check: 2007-11-02)
		So it 00019 * is preferable to spend more time in matches to allow very fast string 00020 * insertions and avoid deletions.
		The matching algorithm for small 00021 * strings is inspired from that of Rabin and Karp.
		00040 * Available in ftp://ds.internic.net/rfc/rfc1951.txt 00041 * 00042 * A description of the Rabin and Karp algorithm is given in the book 00043 * "Algorithms" by R. Sedgewick, Addison-Wesley, p252.
	bzflag.org /doxygen/deflate_8c-source.html (2979 words)

	[No title]
		So it * is preferable to spend more time in matches to allow very fast string * insertions and avoid deletions.
		The matching algorithm for small * strings is inspired from that of Rabin & Karp.
		* Available in ftp://ds.internic.net/rfc/rfc1951.txt * * A description of the Rabin and Karp algorithm is given in the book * "Algorithms" by R. Sedgewick, Addison-Wesley, p252.
	www.kernel.org /pub/scm/linux/kernel/bkcvs/linux-2.4/lib/zlib_deflate/deflate.c,v (3162 words)

Try your search on: Qwika (all wikis)