
Richard M. Karp
Richard M. Karp is an American theoretical computer scientist (b.1935). Born January 3, 1935, in Boston. Known for A simple algorithm for finding frequent elements in streams and bags. Educated at Harvard University and Harvard School of Engineering and Applied Sciences. Awards include Turing Award, John von Neumann Theory Prize and Harvard Centennial Medal.
Facts
38 facts · 1 confirmed by two sources · 11 cited · 26 from one source
Where this comes from
Papalocal keeps its own record. It started from these sources; what each one said is kept here as it was copied, so a change on their side never changes this page by itself. Tap one to read its version.
What Wikidata says · copied November 15, 2026 · revision 2568951775
- Described as
- American theoretical computer scientist (b.1935)
- Other names
- Richard Karp, Richard Manning Karp, Dick Karp, Dick Manning Karp, Dick M. Karp
- Born
- January 3, 1935 · 2 references
- Born in
- Boston · 1 reference
- Citizen of
- United States
- Occupation
- mathematician; computer scientist · 1 reference; university teacher
- Worked for
- University of California, Berkeley; University of Washington · 1 reference
- Education
- Harvard University · 1 reference; Harvard School of Engineering and Applied Sciences; University of California, Berkeley
- Member of
- French Academy of Sciences (2002–); National Academy of Sciences (1980–); American Philosophical Society; American Association for the Advancement of Science; American Academy of Arts and Sciences; National Academy of Engineering (1992–); Association for Computing Machinery (1994–) · 1 reference; Society for Industrial and Applied Mathematics (2009–) · 1 reference
- Known for
- A simple algorithm for finding frequent elements in streams and bags
- Awards
- Turing Award (1985) · 2 references; John von Neumann Theory Prize (1990); Harvard Centennial Medal; Harvey Prize (1998) · 1 reference; Fulkerson Prize (1979) · 1 reference; National Medal of Science (1996); EATCS award (2000); Benjamin Franklin Medal (2004); Kyoto Prize in Advanced Technology (2008) · 1 reference; Benjamin Franklin Medal (2004); Dickson Prize in Science (2009); honorary doctorate of Technion; honorary doctorate of the Weizmann Institute of Science; ACM Fellow (1994) · 1 reference; Fellow of the Society for Industrial and Applied Mathematics (2009) · 1 reference
- Field
- theory of computation; bioinformatics
- Website
- http://www.eecs.berkeley.edu/Faculty/Homepages/karp.html · 1 reference
- Wikipedias with a page
- 37
Wikidata item Q92612 (wikidata.org/wiki/Q92612), public domain (CC0). Copied November 15, 2026.
What Wikipedia says · copied November 15, 2026 · revision 1371989251
Richard Manning Karp (born January 3, 1935) is an American computer scientist and computational theorist at the University of California, Berkeley. He is most notable for his research in the theory of algorithms, for which he received the 1985 ACM Turing Award, The Benjamin Franklin Medal in Computer and Cognitive Science in 2004, and the Kyoto Prize in 2008.
Karp was elected a member of the National Academy of Engineering (1992) for major contributions to the theory and application of NP-completeness, constructing efficient combinatorial algorithms, and applying probabilistic methods in computer science.
- Born, in its opening lines
- January 3, 1935
From the Wikipedia article “Richard M. Karp” (en.wikipedia.org/wiki/Richard_M._Karp), by its contributors, under CC BY-SA 4.0 (creativecommons.org/licenses/by-sa/4.0/). Copied November 15, 2026; not changed.
Confirmed Two sources agree. Cited One source, and it names where it got it. One source One source, without a reference of its own. Sources disagree The sources disagree. We show the best-supported value and keep theirs below.