No subject


Sat Dec 9 22:11:42 UTC 2006


International Computer Science Institute (ICSI) in Berkeley. From
1995 to 1999 he was a Professor of Computer Science and Adjunct
Professor of Molecular Biotechnology at the University of
Washington. In 1999 he returned to ICSI and Berkeley, where he is
a University Professor with appointments in Computer Science,
Mathematics and Bioengineering.

The unifying theme in Karp's work has been the study of
combinatorial algorithms. His 1972 paper ``Reducibility Among
Combinatorial Problems'' showed that many of the most commonly
studied combinatorial problems are NP-complete, and hence likely
to be intractable. Much of his subsequent work has concerned
parallel algorithms, the probabilistic analysis of combinatorial
optimization algorithms and he construction of randomized
algorithms for combinatorial problems. His current activities
center around algorithmic methods in genomics and computer
networking.

Karp has received the National Medal of Science, the Turing Award
(ACM) the Fulkerson Prize(AMS and Math. Programming Society), the
von Neumann Theory Prize(ORSA-TIMS), the Lanchester Prize (ORSA)
the von Neumann Lectureship (SIAM), the Harvey Prize (Technion),
the Centennial Medal (Harvard) and the Distinguished Teaching
Award (Berkeley). He is a member of the National Academy of
Sciences, the National Academy of Engineering and the American
Philosophical Society and a Fellow of the American Academy of
Arts and Sciences and the American Association for the
Advancement of Science. He has been awarded five honorary
degrees.

Contact information:

Richard Karp
ICSI Center for Internet Research and
University of California, Berkeley

karp at ICSI.Berkeley.EDU 

+----------------------------------------------------------------------------+
| This message was sent via the Stanford Computer Science Department         |
| colloquium mailing list.  To be added to this list send an arbitrary       |
| message to colloq-subscribe at cs.stanford.edu.  To be removed from this list,|
| send a message to colloq-unsubscribe at cs.stanford.edu. For more information,|
| send an arbitrary message to colloq-request at cs.stanford.edu. For directions|
| to Stanford, check out http://www-forum.stanford.edu                       |
+-------------------------------------------------------------------------xcl+




More information about the P2p-hackers mailing list