Karp became the founding director of the Simons Institute for the Theory of Computing at the University of California, Berkeley
Text from Wikipedia, available under CC BY-SA 4.0.
- #wikipedia
- #event

Figure timeline
Richard Manning Karp 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.
Text from Wikipedia, available under CC BY-SA 4.0.
science · American mathematician · mathematician · computer scientist · university teacher · also Richard M. Karp, Richard Karp, Richard Manning Karp, Dick Karp, Dick Manning Karp, Dick M. Karp
Born 3 January 1935 · Q92612
20 published statements · 0 followers
See & hear
1 photos
Media from Wikimedia Commons, hotlinked at the source under its own licence — see each file for author and terms.
Live now
Pulling headlines from trusted outlets — this usually takes a few seconds
Checking the wires…
Feed scan
These are live links, not archived citations — they only join the timeline once a collect run verifies and archives them.
Live pulse
Most recent outstanding titles, awards, and quotes
Karp became the founding director of the Simons Institute for the Theory of Computing at the University of California, Berkeley
Text from Wikipedia, available under CC BY-SA 4.0.
Awarded Fellow of the Society for Industrial and Applied Mathematics (2009).
Text from Wikipedia, available under CC BY-SA 4.0.
Awarded Dickson Prize in Science (2009).
Text from Wikipedia, available under CC BY-SA 4.0.
Awarded Kyoto Prize in Advanced Technology (2008).
Text from Wikipedia, available under CC BY-SA 4.0.
Won Benjamin Franklin Medal (2004).
Text from Wikipedia, available under CC BY-SA 4.0.
Awarded EATCS award (2000).
Text from Wikipedia, available under CC BY-SA 4.0.
Awarded Harvey Prize (1998).
Text from Wikipedia, available under CC BY-SA 4.0.
Won National Medal of Science (1996).
Text from Wikipedia, available under CC BY-SA 4.0.
Awarded Charles Babbage Award (1995).
Text from Wikipedia, available under CC BY-SA 4.0.
Awarded ACM Fellow (1994).
Text from Wikipedia, available under CC BY-SA 4.0.
Was inducted as a Fellow of the Association for Computing Machinery
Text from Wikipedia, available under CC BY-SA 4.0.
Awarded John von Neumann Theory Prize (1990).
Text from Wikipedia, available under CC BY-SA 4.0.
Awarded Turing Award (1985).
Text from Wikipedia, available under CC BY-SA 4.0.
Awarded Fulkerson Prize (1979).
Text from Wikipedia, available under CC BY-SA 4.0.
Awarded Frederick W. Lanchester Prize (1977).
Text from Wikipedia, available under CC BY-SA 4.0.
And John Hopcroft published the Hopcroft–Karp algorithm, the fastest known method for finding maximum cardinality matchings in bipartite graphs
Text from Wikipedia, available under CC BY-SA 4.0.
Co-developed with Jack Edmonds the Edmonds–Karp algorithm for solving the maximum flow problem on networks, and in 1972 he published a landmark paper in complexity theory, "Reducibility Among Combinatorial Problems",
Text from Wikipedia, available under CC BY-SA 4.0.
Karp became professor of computer science, mathematics, and operations research at the University of California, Berkeley
Text from Wikipedia, available under CC BY-SA 4.0.
Co-developed with Michael Held the Held–Karp algorithm, an exact exponential-time algorithm for the travelling salesman problem
Text from Wikipedia, available under CC BY-SA 4.0.
Born 1935-01-03.
Text from Wikipedia, available under CC BY-SA 4.0.
Connections