Difference between revisions of "Richard Karp"

From Chessprogramming wiki
Jump to: navigation, search
(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...")
 
 
(4 intermediate revisions by the same user not shown)
Line 22: Line 22:
 
* [[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]
 
* [[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 ...==
 
==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]] ('''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] <ref>[https://en.wikipedia.org/wiki/Travelling_salesman_problem Travelling salesman problem from Wikipedia]</ref>
 
* [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
 
* [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]], [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]
Line 42: Line 42:
 
* [[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://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
 
* [[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
+
* [[Mathematician#PBGodfrey|P. 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 ...==
 
==2010 ...==
 
* [[Richard Karp]] ('''2010'''). ''Reducibility Among Combinatorial Problems''. [https://dblp.uni-trier.de/db/books/daglib/0023873.html 50 Years of Integer Programming]
 
* [[Richard Karp]] ('''2010'''). ''Reducibility Among Combinatorial Problems''. [https://dblp.uni-trier.de/db/books/daglib/0023873.html 50 Years of Integer Programming]
 +
* [[Mathematician#KChandrasekaran|Karthekeyan Chandrasekaran]], [[Richard Karp]] ('''2012'''). ''Finding a most biased coin with fewest flips''. [https://arxiv.org/abs/1202.3639 arXiv:1202.3639]
 +
* [[Mathematician#CHPapadimitriou|Christos H. Papadimitriou]], [[Mathematician#LAdleman|Leonard Adleman]], [[Richard Karp]], [[Donald Knuth]], [[Mathematician#RETarjan|Robert E. Tarjan]], [[Mathematician#LValiant|Leslie Valiant]] ('''2012'''). ''[https://dl.acm.org/citation.cfm?id=2322189 An Algorithmic View of the Universe]''. [[Algorithms#ACM-Turing|ACM-Turing 2012]]
 +
* [[Mathematician#IAdler|Ilan Adler]], [[Mathematician#YangCao|Yang Cao]], [[Richard Karp]], [[Mathematician#EAPekoz|Erol A. Peköz]], [[Mathematician#SMRoss|Sheldon M. Ross]] ('''2017'''). ''[https://pubsonline.informs.org/doi/10.1287/opre.2017.1657 Random Knockout Tournaments]''. [https://en.wikipedia.org/wiki/Operations_Research_(journal) Operations Research], Vol. 65, No. 6, [https://arxiv.org/abs/1612.04448 arXiv:1612.04448]
  
 
=External Links=  
 
=External Links=  

Latest revision as of 11:46, 21 November 2018

Home * People * Richard Karp

Richard Karp [1]

Richard M. Karp,
an American mathematician, computer scientist and pioneer in theoretical computer science and computational complexity for which he received a Turing Award in 1985, the Harvey Prize in 1998, the Benjamin Franklin Medal in 2004, and the Kyoto Prize in 2008 [2] and several honorary degrees. Richard Karp is professor emeritus at Department of Electrical Engineering and Computer Sciences with additional appointments in mathematics, bioengineering and operations research, University of California, Berkeley. His research interests further include combinatorial algorithms, discrete probability, computational biology, and internet algorithms. Karp introduced the now standard methodology for proving problems to be NP-complete. He is known for Karp's 21 NP-complete problems, the Edmonds–Karp algorithm, the Hopcroft–Karp algorithm, the Karp–Lipton theorem, and the 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 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 [3] .

Selected Publications

[4]

1959

1960 ...

1970 ...

1980 ...

1990 ...

2000 ...

2010 ...

External Links

References

  1. Richard Karp giving a talk at the EPFL on 13th of July 2009, Category:Richard Karp - Wikimedia Commons
  2. Richard M. Karp from Wikipedia
  3. Bradley C. Kuszmaul (1994). Synchronized MIMD Computing. Ph. D. Thesis, Department of Electrical Engineering and Computer Science, Massachusetts Institute of Technology, pdf, pp. 146, Acknowledgments
  4. dblp: Richard M. Karp
  5. Travelling salesman problem from Wikipedia

Up one level