25,161
edits
Changes
Created page with "'''Home * People * Richard Karp''' FILE:Karp mg 7725-b.cr2.jpg|border|right|thumb|240px| Richard Karp <ref>Richard Karp giving a talk at the [https://en.w..."
'''[[Main Page|Home]] * [[People]] * Richard Karp'''
[[FILE:Karp mg 7725-b.cr2.jpg|border|right|thumb|240px| Richard Karp <ref>Richard Karp giving a talk at the [https://en.wikipedia.org/wiki/EPFL EPFL] on 13th of July 2009, [https://commons.wikimedia.org/wiki/Category:Richard_Karp Category:Richard Karp - Wikimedia Commons]</ref> ]]
'''Richard M. Karp''',<br/>
an American mathematician, computer scientist and pioneer in [https://en.wikipedia.org/wiki/Theoretical_computer_science theoretical computer science] and [https://en.wikipedia.org/wiki/Computational_complexity_theory computational complexity] for which he received a [https://en.wikipedia.org/wiki/Turing_Award Turing Award] in 1985, the [https://en.wikipedia.org/wiki/Harvey_Prize Harvey Prize] in 1998, the [https://en.wikipedia.org/wiki/Benjamin_Franklin_Medal_%28Franklin_Institute%29 Benjamin Franklin Medal] in 2004, and the [https://en.wikipedia.org/wiki/Kyoto_Prize Kyoto Prize] in 2008 <ref>[https://en.wikipedia.org/wiki/Richard_M._Karp Richard M. Karp from Wikipedia]</ref> and several honorary degrees.
Richard Karp is professor emeritus at Department of Electrical Engineering and Computer Sciences with additional appointments in mathematics, [https://en.wikipedia.org/wiki/Biological_engineering bioengineering] and [https://en.wikipedia.org/wiki/Operations_research operations research], [[University of California, Berkeley]].
His research interests further include [https://en.wikipedia.org/wiki/Combinatorial_optimization combinatorial algorithms], [https://en.wikipedia.org/wiki/Probability_distribution#Discrete_probability_distribution discrete probability], [https://en.wikipedia.org/wiki/Computational_biology computational biology], and [https://en.wikipedia.org/wiki/Category:Internet_search_algorithms internet algorithms].
Karp introduced the now standard methodology for proving problems to be [https://en.wikipedia.org/wiki/NP-complete NP-complete]. He is known for [https://en.wikipedia.org/wiki/Karp%27s_21_NP-complete_problems Karp's 21 NP-complete problems], the [https://en.wikipedia.org/wiki/Edmonds%E2%80%93Karp_algorithm Edmonds–Karp algorithm], the [https://en.wikipedia.org/wiki/Hopcroft%E2%80%93Karp_algorithm Hopcroft–Karp algorithm], the [https://en.wikipedia.org/wiki/Karp%E2%80%93Lipton_theorem Karp–Lipton theorem], and the [https://en.wikipedia.org/wiki/Rabin%E2%80%93Karp_algorithm Rabin–Karp algorithm].
=StarTech=
According to primary [[StarTech]] author [[Bradley Kuszmaul]], [[Hans Berliner]], Richard Karp, [[David Slate]], and [[Lewis Stiller]] contributed to a mini-seminar on computer chess held at [https://en.wikipedia.org/wiki/Thinking_Machines_Corporation Thinking Machines Corporation] on August 12, 1991. In particular, Richard Karp suggested that StarTech should be based on Berliner’s serial program [[HiTech]] rather than [[GNU Chess]] <ref>[[Bradley Kuszmaul|Bradley C. Kuszmaul]] ('''1994'''). ''Synchronized MIMD Computing''. Ph. D. Thesis, Department of Electrical Engineering and Computer Science, [[Massachusetts Institute of Technology]], [http://supertech.csail.mit.edu/papers/thesis-kuszmaul.pdf pdf], pp. 146, Acknowledgments</ref> .
=Selected Publications=
<ref>[https://dblp.uni-trier.de/pers/hy/k/Karp:Richard_M=.html dblp: Richard M. Karp]</ref>
==1959==
* [[Richard Karp]] ('''1959'''). ''Some Applications of Logical Syntax to Digital Computer Programming''. Ph.D. thesis, [[Harvard University]]
==1960 ...==
* [[Richard Karp]] ('''1960'''). ''A Note on the Applicaton of Graph Theory to Digital Computer Programming''. [https://dblp.uni-trier.de/db/journals/iandc/iandc3.html Information and Control, Vol. 3], No. 2, [https://core.ac.uk/download/pdf/82251489.pdf pdf]
* [[Richard Karp]] ('''1964'''). ''[https://ieeexplore.ieee.org/document/4038244 Some Techniques of State Assignment for Synchronous Sequential Machines]''. [[IEEE#TOC|IEEE Transactions on Electronic Computers]], Vol. 13, No. 5
* [[Richard Karp]] ('''1967'''). ''[https://dl.acm.org/citation.cfm?id=321410 Some Bounds on the Storage Requirements of Sequential Machines and Turing Machines]''. [[ACM#Journal|Journal of the ACM]], Vol. 14, No. 3
* [[Richard Karp]], [https://dblp.uni-trier.de/pers/hd/m/Miller:Raymond_E= Raymond E. Miller] ('''1969'''). ''Parallel Program Schemata''. [https://en.wikipedia.org/wiki/Journal_of_Computer_and_System_Sciences Journal of Computer and System Sciences], Vol. 3, No. 2, [https://core.ac.uk/download/pdf/82202840.pdf pdf]
==1970 ...==
* [https://dblp.uni-trier.de/pers/hd/h/Held:Michael Michael Held], [[Richard Karp]] ('''1970'''). ''The Traveling-Salesman Problem and Minimum Spanning Trees''. [https://en.wikipedia.org/wiki/Operations_Research_(journal) Operations Research], Vol. 18, No. 6, [https://www.cse.wustl.edu/~ychen/7102/Karp-TSP.pdf pdf]
* [https://dblp.uni-trier.de/pers/hd/h/Held:Michael Michael Held], [[Richard Karp]] ('''1971'''). ''[https://link.springer.com/article/10.1007%2FBF01584070 The traveling-salesman problem and minimum spanning trees: Part II'']. [https://en.wikipedia.org/wiki/Mathematical_Programming Mathematical Programming], Vol. 1, No. 1
* [[Richard Karp]], [https://dblp.uni-trier.de/pers/hd/m/Miller:Raymond_E= Raymond E. Miller], [[Mathematician#ALRosenberg|Arnold L. Rosenberg]] ('''1972'''). ''[https://www.semanticscholar.org/paper/Rapid-Identification-of-Repeated-Patterns-in-Trees-Karp-Miller/b3387ef7e1466b91174604e097a6bd6fa57498d2 Rapid Identification of Repeated Patterns in Strings, Trees and Arrays]''. [https://dblp.uni-trier.de/db/conf/stoc/stoc72.html STOC 1972]
* [[Richard Karp]] ('''1972'''). ''Reducibility Among Combinatorial Problems''. [https://dblp.uni-trier.de/db/conf/coco/cocc1972.html Complexity of Computer Computations 1972], [https://people.eecs.berkeley.edu/~luca/cs172/karp.pdf pdf]
* [[Richard Karp]] ('''1977'''). ''[https://www.semanticscholar.org/paper/Probabilistic-Analysis-of-Partitioning-Algorithms-Karp/c911bd9f91a00e64f1f8e14619a35157a2084f86 Probabilistic Analysis of Partitioning Algorithms for the Traveling-Salesman Problem in the Plane]''. [https://en.wikipedia.org/wiki/Mathematics_of_Operations_Research Mathematics of Operations Research], Vol. 2, No. 3
==1980 ...==
* [[Mathematician#Blum|Manuel Blum]], [[Richard Karp]], [[Oliver Vornberger]], [[Mathematician#CHPapadimitriou|Christos H. Papadimitriou]], [[Mathematician#MYannakakis|Mihalis Yannakakis]] ('''1981'''). ''[https://www.sciencedirect.com/science/article/pii/0020019081900508 The Complexity of Testing Whether a Graph is a Superconcentrator]''. [https://en.wikipedia.org/wiki/Information_Processing_Letters Information Processing Letters], Vol. 13, Nos. 4/5
* [[Richard Karp]] ('''1986'''). ''[https://dl.acm.org/citation.cfm?id=5658 Combinatorics, complexity, and randomness]''. [[ACM#Communications|Communications of the ACM]], Vol. 29, No. 2
* [[Richard Karp]], [[Yanjun Zhang]] ('''1988'''). ''[https://dl.acm.org/citation.cfm?id=62212.62240 A randomized parallel branch-and-bound procedure]''. [http://www.informatik.uni-trier.de/%7Eley/db/conf/stoc/stoc88.html STOC '88]
* [[Richard Karp]], [[Yanjun Zhang]] ('''1989'''). ''[https://www.icsi.berkeley.edu/icsi/node/2253 On parallel evaluation of game trees]''. [http://www.informatik.uni-trier.de/%7Eley/db/conf/spaa/spaa89.html SPAA '89]
==1990 ...==
* [[Richard Karp]], [[Yanjun Zhang]] ('''1993'''). ''[https://dl.acm.org/citation.cfm?id=62212.62240 Randomized parallel algorithms for backtrack search and branch-and-bound computation]''. [[ACM#Journal|Journal of the ACM]], Vol. 40, No. 3
* [[Richard Karp]], [[Yanjun Zhang]] ('''1995'''). ''[https://dl.acm.org/citation.cfm?id=1943722 Bounded branching process and and/or tree evaluation]''. [http://onlinelibrary.wiley.com/doi/10.1002/rsa.v7:2/issuetoc Random Structures & Algorithms, Vol. 7, No. 2]
* [[Richard Karp]], [[Yanjun Zhang]] ('''1998'''). ''[https://dl.acm.org/citation.cfm?doid=293347.293353 On Parallel Evaluation of Game Trees]''. [[ACM#Journal|Journal of the ACM]], Vol. 45, No. 6
==2000 ...==
* [[Richard Karp]] ('''2000'''). ''The Genomics Revolution and Its Challenges for Algorithmic Research''. [https://dblp.uni-trier.de/db/conf/icalp/icalp2000.html ICALP 2000]
* [[Mathematician#AAkella|Aditya Akella]], [[Mathematician#SSeshan|Srinivasan Seshan]], [[Richard Karp]], [[Mathematician#SShenker|Scott Shenker]], [[Mathematician#CHPapadimitriou|Christos H. Papadimitriou]] ('''2002'''). ''[https://dl.acm.org/citation.cfm?id=633037 Selfish behavior and stability of the internet: a game-theoretic analysis of TCP]''. [https://dblp.uni-trier.de/db/conf/sigcomm/sigcomm2002.html SIGCOMM 2002]
* [[Richard Karp]], [[Mathematician#CKenyon|Claire Kenyon]] ('''2003'''). ''[https://link.springer.com/chapter/10.1007/978-3-540-45198-3_28 A Gambling Game Arising in the Analysis of Adaptive Randomized Rounding]''. [https://dblp.uni-trier.de/db/conf/random/random2003.html RANDOM-APPROX 2003]
* [[Richard Karp]] ('''2008'''). ''[https://ieeexplore.ieee.org/document/4595861 Computer Science as a Lens on the Sciences]''. [https://dblp.uni-trier.de/db/conf/icdcs/icdcs2008.html ICDCS 2008]
* [[Richard Karp]] ('''2008'''). ''[https://www.sciencedirect.com/science/article/pii/S1572528607000370 George Dantzig's impact on the theory of computation]''. [https://www.journals.elsevier.com/discrete-optimization Discrete Optimization], Vol 5, No. 2
* [[Mathematician#BGodfrey|Brighten Godfrey]], [[Richard Karp]] ('''2009'''). ''[https://link.springer.com/article/10.1007/s00224-008-9102-5 On the Price of Heterogeneity in Parallel Systems]''. [https://en.wikipedia.org/wiki/Theory_of_Computing_Systems Theory of Computing Systems], Vol. 45, No. 2
==2010 ...==
* [[Richard Karp]] ('''2010'''). ''Reducibility Among Combinatorial Problems''. [https://dblp.uni-trier.de/db/books/daglib/0023873.html 50 Years of Integer Programming]
=External Links=
* [http://www.cs.berkeley.edu/%7Ekarp/ Richard M. Karp's Home Page]
* [https://en.wikipedia.org/wiki/Richard_M._Karp Richard M. Karp from Wikipedia]
* [https://www2.eecs.berkeley.edu/Faculty/Homepages/karp.html Richard M. Karp | EECS at UC Berkeley]
* [https://genealogy.math.ndsu.nodak.edu/id.php?id=25275 The Mathematics Genealogy Project - Richard Karp]
* [https://opc.mfo.de/person_detail?id=5368 Details for Richard Karp - Oberwolfach Photo Collection]
* Message from Richard Manning Karp - The 2008 Kyoto Prize, [https://en.wikipedia.org/wiki/YouTube YouTube] Video
: {{#evu:https://www.youtube.com/watch?v=4Ee5VdLqQAI|alignment=left|valignment=top}}
=References=
<references />
'''[[People|Up one level]]'''
[[Category:Researcher|Karp]]
[[Category:Videos|Karp]]
[[FILE:Karp mg 7725-b.cr2.jpg|border|right|thumb|240px| Richard Karp <ref>Richard Karp giving a talk at the [https://en.wikipedia.org/wiki/EPFL EPFL] on 13th of July 2009, [https://commons.wikimedia.org/wiki/Category:Richard_Karp Category:Richard Karp - Wikimedia Commons]</ref> ]]
'''Richard M. Karp''',<br/>
an American mathematician, computer scientist and pioneer in [https://en.wikipedia.org/wiki/Theoretical_computer_science theoretical computer science] and [https://en.wikipedia.org/wiki/Computational_complexity_theory computational complexity] for which he received a [https://en.wikipedia.org/wiki/Turing_Award Turing Award] in 1985, the [https://en.wikipedia.org/wiki/Harvey_Prize Harvey Prize] in 1998, the [https://en.wikipedia.org/wiki/Benjamin_Franklin_Medal_%28Franklin_Institute%29 Benjamin Franklin Medal] in 2004, and the [https://en.wikipedia.org/wiki/Kyoto_Prize Kyoto Prize] in 2008 <ref>[https://en.wikipedia.org/wiki/Richard_M._Karp Richard M. Karp from Wikipedia]</ref> and several honorary degrees.
Richard Karp is professor emeritus at Department of Electrical Engineering and Computer Sciences with additional appointments in mathematics, [https://en.wikipedia.org/wiki/Biological_engineering bioengineering] and [https://en.wikipedia.org/wiki/Operations_research operations research], [[University of California, Berkeley]].
His research interests further include [https://en.wikipedia.org/wiki/Combinatorial_optimization combinatorial algorithms], [https://en.wikipedia.org/wiki/Probability_distribution#Discrete_probability_distribution discrete probability], [https://en.wikipedia.org/wiki/Computational_biology computational biology], and [https://en.wikipedia.org/wiki/Category:Internet_search_algorithms internet algorithms].
Karp introduced the now standard methodology for proving problems to be [https://en.wikipedia.org/wiki/NP-complete NP-complete]. He is known for [https://en.wikipedia.org/wiki/Karp%27s_21_NP-complete_problems Karp's 21 NP-complete problems], the [https://en.wikipedia.org/wiki/Edmonds%E2%80%93Karp_algorithm Edmonds–Karp algorithm], the [https://en.wikipedia.org/wiki/Hopcroft%E2%80%93Karp_algorithm Hopcroft–Karp algorithm], the [https://en.wikipedia.org/wiki/Karp%E2%80%93Lipton_theorem Karp–Lipton theorem], and the [https://en.wikipedia.org/wiki/Rabin%E2%80%93Karp_algorithm Rabin–Karp algorithm].
=StarTech=
According to primary [[StarTech]] author [[Bradley Kuszmaul]], [[Hans Berliner]], Richard Karp, [[David Slate]], and [[Lewis Stiller]] contributed to a mini-seminar on computer chess held at [https://en.wikipedia.org/wiki/Thinking_Machines_Corporation Thinking Machines Corporation] on August 12, 1991. In particular, Richard Karp suggested that StarTech should be based on Berliner’s serial program [[HiTech]] rather than [[GNU Chess]] <ref>[[Bradley Kuszmaul|Bradley C. Kuszmaul]] ('''1994'''). ''Synchronized MIMD Computing''. Ph. D. Thesis, Department of Electrical Engineering and Computer Science, [[Massachusetts Institute of Technology]], [http://supertech.csail.mit.edu/papers/thesis-kuszmaul.pdf pdf], pp. 146, Acknowledgments</ref> .
=Selected Publications=
<ref>[https://dblp.uni-trier.de/pers/hy/k/Karp:Richard_M=.html dblp: Richard M. Karp]</ref>
==1959==
* [[Richard Karp]] ('''1959'''). ''Some Applications of Logical Syntax to Digital Computer Programming''. Ph.D. thesis, [[Harvard University]]
==1960 ...==
* [[Richard Karp]] ('''1960'''). ''A Note on the Applicaton of Graph Theory to Digital Computer Programming''. [https://dblp.uni-trier.de/db/journals/iandc/iandc3.html Information and Control, Vol. 3], No. 2, [https://core.ac.uk/download/pdf/82251489.pdf pdf]
* [[Richard Karp]] ('''1964'''). ''[https://ieeexplore.ieee.org/document/4038244 Some Techniques of State Assignment for Synchronous Sequential Machines]''. [[IEEE#TOC|IEEE Transactions on Electronic Computers]], Vol. 13, No. 5
* [[Richard Karp]] ('''1967'''). ''[https://dl.acm.org/citation.cfm?id=321410 Some Bounds on the Storage Requirements of Sequential Machines and Turing Machines]''. [[ACM#Journal|Journal of the ACM]], Vol. 14, No. 3
* [[Richard Karp]], [https://dblp.uni-trier.de/pers/hd/m/Miller:Raymond_E= Raymond E. Miller] ('''1969'''). ''Parallel Program Schemata''. [https://en.wikipedia.org/wiki/Journal_of_Computer_and_System_Sciences Journal of Computer and System Sciences], Vol. 3, No. 2, [https://core.ac.uk/download/pdf/82202840.pdf pdf]
==1970 ...==
* [https://dblp.uni-trier.de/pers/hd/h/Held:Michael Michael Held], [[Richard Karp]] ('''1970'''). ''The Traveling-Salesman Problem and Minimum Spanning Trees''. [https://en.wikipedia.org/wiki/Operations_Research_(journal) Operations Research], Vol. 18, No. 6, [https://www.cse.wustl.edu/~ychen/7102/Karp-TSP.pdf pdf]
* [https://dblp.uni-trier.de/pers/hd/h/Held:Michael Michael Held], [[Richard Karp]] ('''1971'''). ''[https://link.springer.com/article/10.1007%2FBF01584070 The traveling-salesman problem and minimum spanning trees: Part II'']. [https://en.wikipedia.org/wiki/Mathematical_Programming Mathematical Programming], Vol. 1, No. 1
* [[Richard Karp]], [https://dblp.uni-trier.de/pers/hd/m/Miller:Raymond_E= Raymond E. Miller], [[Mathematician#ALRosenberg|Arnold L. Rosenberg]] ('''1972'''). ''[https://www.semanticscholar.org/paper/Rapid-Identification-of-Repeated-Patterns-in-Trees-Karp-Miller/b3387ef7e1466b91174604e097a6bd6fa57498d2 Rapid Identification of Repeated Patterns in Strings, Trees and Arrays]''. [https://dblp.uni-trier.de/db/conf/stoc/stoc72.html STOC 1972]
* [[Richard Karp]] ('''1972'''). ''Reducibility Among Combinatorial Problems''. [https://dblp.uni-trier.de/db/conf/coco/cocc1972.html Complexity of Computer Computations 1972], [https://people.eecs.berkeley.edu/~luca/cs172/karp.pdf pdf]
* [[Richard Karp]] ('''1977'''). ''[https://www.semanticscholar.org/paper/Probabilistic-Analysis-of-Partitioning-Algorithms-Karp/c911bd9f91a00e64f1f8e14619a35157a2084f86 Probabilistic Analysis of Partitioning Algorithms for the Traveling-Salesman Problem in the Plane]''. [https://en.wikipedia.org/wiki/Mathematics_of_Operations_Research Mathematics of Operations Research], Vol. 2, No. 3
==1980 ...==
* [[Mathematician#Blum|Manuel Blum]], [[Richard Karp]], [[Oliver Vornberger]], [[Mathematician#CHPapadimitriou|Christos H. Papadimitriou]], [[Mathematician#MYannakakis|Mihalis Yannakakis]] ('''1981'''). ''[https://www.sciencedirect.com/science/article/pii/0020019081900508 The Complexity of Testing Whether a Graph is a Superconcentrator]''. [https://en.wikipedia.org/wiki/Information_Processing_Letters Information Processing Letters], Vol. 13, Nos. 4/5
* [[Richard Karp]] ('''1986'''). ''[https://dl.acm.org/citation.cfm?id=5658 Combinatorics, complexity, and randomness]''. [[ACM#Communications|Communications of the ACM]], Vol. 29, No. 2
* [[Richard Karp]], [[Yanjun Zhang]] ('''1988'''). ''[https://dl.acm.org/citation.cfm?id=62212.62240 A randomized parallel branch-and-bound procedure]''. [http://www.informatik.uni-trier.de/%7Eley/db/conf/stoc/stoc88.html STOC '88]
* [[Richard Karp]], [[Yanjun Zhang]] ('''1989'''). ''[https://www.icsi.berkeley.edu/icsi/node/2253 On parallel evaluation of game trees]''. [http://www.informatik.uni-trier.de/%7Eley/db/conf/spaa/spaa89.html SPAA '89]
==1990 ...==
* [[Richard Karp]], [[Yanjun Zhang]] ('''1993'''). ''[https://dl.acm.org/citation.cfm?id=62212.62240 Randomized parallel algorithms for backtrack search and branch-and-bound computation]''. [[ACM#Journal|Journal of the ACM]], Vol. 40, No. 3
* [[Richard Karp]], [[Yanjun Zhang]] ('''1995'''). ''[https://dl.acm.org/citation.cfm?id=1943722 Bounded branching process and and/or tree evaluation]''. [http://onlinelibrary.wiley.com/doi/10.1002/rsa.v7:2/issuetoc Random Structures & Algorithms, Vol. 7, No. 2]
* [[Richard Karp]], [[Yanjun Zhang]] ('''1998'''). ''[https://dl.acm.org/citation.cfm?doid=293347.293353 On Parallel Evaluation of Game Trees]''. [[ACM#Journal|Journal of the ACM]], Vol. 45, No. 6
==2000 ...==
* [[Richard Karp]] ('''2000'''). ''The Genomics Revolution and Its Challenges for Algorithmic Research''. [https://dblp.uni-trier.de/db/conf/icalp/icalp2000.html ICALP 2000]
* [[Mathematician#AAkella|Aditya Akella]], [[Mathematician#SSeshan|Srinivasan Seshan]], [[Richard Karp]], [[Mathematician#SShenker|Scott Shenker]], [[Mathematician#CHPapadimitriou|Christos H. Papadimitriou]] ('''2002'''). ''[https://dl.acm.org/citation.cfm?id=633037 Selfish behavior and stability of the internet: a game-theoretic analysis of TCP]''. [https://dblp.uni-trier.de/db/conf/sigcomm/sigcomm2002.html SIGCOMM 2002]
* [[Richard Karp]], [[Mathematician#CKenyon|Claire Kenyon]] ('''2003'''). ''[https://link.springer.com/chapter/10.1007/978-3-540-45198-3_28 A Gambling Game Arising in the Analysis of Adaptive Randomized Rounding]''. [https://dblp.uni-trier.de/db/conf/random/random2003.html RANDOM-APPROX 2003]
* [[Richard Karp]] ('''2008'''). ''[https://ieeexplore.ieee.org/document/4595861 Computer Science as a Lens on the Sciences]''. [https://dblp.uni-trier.de/db/conf/icdcs/icdcs2008.html ICDCS 2008]
* [[Richard Karp]] ('''2008'''). ''[https://www.sciencedirect.com/science/article/pii/S1572528607000370 George Dantzig's impact on the theory of computation]''. [https://www.journals.elsevier.com/discrete-optimization Discrete Optimization], Vol 5, No. 2
* [[Mathematician#BGodfrey|Brighten Godfrey]], [[Richard Karp]] ('''2009'''). ''[https://link.springer.com/article/10.1007/s00224-008-9102-5 On the Price of Heterogeneity in Parallel Systems]''. [https://en.wikipedia.org/wiki/Theory_of_Computing_Systems Theory of Computing Systems], Vol. 45, No. 2
==2010 ...==
* [[Richard Karp]] ('''2010'''). ''Reducibility Among Combinatorial Problems''. [https://dblp.uni-trier.de/db/books/daglib/0023873.html 50 Years of Integer Programming]
=External Links=
* [http://www.cs.berkeley.edu/%7Ekarp/ Richard M. Karp's Home Page]
* [https://en.wikipedia.org/wiki/Richard_M._Karp Richard M. Karp from Wikipedia]
* [https://www2.eecs.berkeley.edu/Faculty/Homepages/karp.html Richard M. Karp | EECS at UC Berkeley]
* [https://genealogy.math.ndsu.nodak.edu/id.php?id=25275 The Mathematics Genealogy Project - Richard Karp]
* [https://opc.mfo.de/person_detail?id=5368 Details for Richard Karp - Oberwolfach Photo Collection]
* Message from Richard Manning Karp - The 2008 Kyoto Prize, [https://en.wikipedia.org/wiki/YouTube YouTube] Video
: {{#evu:https://www.youtube.com/watch?v=4Ee5VdLqQAI|alignment=left|valignment=top}}
=References=
<references />
'''[[People|Up one level]]'''
[[Category:Researcher|Karp]]
[[Category:Videos|Karp]]
