Search results
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 a Turing Award in 1985, The Benjamin Franklin Medal in Computer and Cognitive Science in 2004 , and the Kyoto ...
May 1, 2024 · Richard Karp (born January 3, 1935, Boston, Massachusetts, U.S.) is an American mathematician and computer scientist and winner of the 1985 A.M. Turing Award, the highest honour in computer science, for “his continuing contributions to the theory of algorithms including the development of efficient algorithms for network flow and other ...
From 1988 to 1995 and 1999 to the present he has been a Research Scientist at the International Computer Science Institute in Berkeley. His current activities center on algorithmic methods in genomics and computer networking. He has supervised thirty-six Ph.D. dissertations.
Professor Emeritus. Research area: Applied Mathematics. Bio: Selected Publications: Daskalakis, Constantinos and Dimakis, Alexandros G. and Karp, Richard M. and Wainwright, Martin J. (2008). Probabilistic analysis of linear programming decoding. IEEE Trans. Inform. Theory 54 No.8, 3565-3578. [ MR. ] [ GS? Karp, Richard M. (2008).
Richard M. Karp. 50 Years of Integer Programming 1958-2008: From the Early Years to the State …. Proceedings of the 2001 conference on Applications, technologies …. D Culler, R Karp, D Patterson, A Sahay, KE Schauser, E Santos, ... Proceedings of the fourth ACM SIGPLAN symposium on Principles and practice ….
Apr 29, 2024 · The Richard M. Karp Distinguished Lectures were created in Fall 2019 to celebrate the role of Simons Institute Founding Director Dick Karp in establishing the field of theoretical computer science, formulating its central problems, and contributing stunning results in the areas of computational complexity and algorithms.
His 1977 paper on a probabilistic analysis of portioning algorithms for the travelling-salesman problem was recognized as “the first major application of probabilistic analysis to a combinatorial optimization problem” and was awarded the Frederick W. Lanchester Prize.
