Michael Garey

From Wikipedia, the free encyclopedia

Michael R. Garey is a computer science researcher, and co-author (with David S. Johnson) of Computers and Intractability: A Guide to the Theory of NP-completeness. In 1995 he was inducted as a Fellow of the Association for Computing Machinery.^[1]

[edit] References

^ Garey's personal web page

This biographical article relating to a computer scientist is a stub. You can help Wikipedia by expanding it.

Categories: American computer scientists | Fellows of the Association for Computing Machinery | Computer scientist stubs

Views

Interaction

Search

Powered by MediaWiki

Wikimedia Foundation

This page was last modified 02:31, 23 January 2008 by Wikipedia user Mikkalai. Based on work by Wikipedia user(s) Cydebot, BrownHairedGirl, Ntsimp, Pegship, RobotG, Janm67, MarkSweep, Jaxl, Sam Hocevar and Dominus.
All text is available under the terms of the GNU Free Documentation License. (See Copyrights for details.)
Wikipedia® is a registered trademark of the Wikimedia Foundation, Inc., a U.S. registered 501(c)(3) tax-deductible nonprofit charity.
About Wikipedia
Disclaimers