Michael Garey

Michael Garey
Name	Michael Garey
Occupation	Computer scientist, author
Known for	Algorithms, computational complexity, theoretical computer science

Michael Garey is an American computer scientist and author notable for foundational contributions to computational complexity and algorithms. He is best known as co-author of a seminal textbook that shaped research on NP-completeness and combinatorial optimization, and for work that connected theoretical topics such as reducibility and approximation algorithms to practical problems in operations research and computer science education. His career spans research, teaching, and collaboration with leading figures and institutions in theoretical computer science.

Early life and education

Garey earned his undergraduate degree in Mathematics before pursuing graduate studies that bridged computer science and applied mathematics. He completed doctoral work under advisors active in the study of algorithms and graph theory, engaging with communities centered at institutions associated with scholars in discrete mathematics and theory of computation. During his formative years he interacted with peers who later became prominent at universities such as Princeton University, Massachusetts Institute of Technology, Stanford University, University of California, Berkeley, and Cornell University.

Academic career and positions

Garey held academic appointments at universities known for strong programs in computer science, moving through faculties alongside researchers from Bell Labs, AT&T, IBM Research, and national laboratories. He taught courses related to algorithms and complexity theory for graduate and undergraduate students, advising students who went on to positions at institutions including Carnegie Mellon University, University of Illinois Urbana–Champaign, University of Washington, Yale University, and Harvard University. He participated in conferences organized by societies such as the Association for Computing Machinery and the Society for Industrial and Applied Mathematics, contributing to workshop series hosted by organizations like SIAM and the IEEE Computer Society.

Research contributions and publications

Garey's most influential publication is a co-authored monograph that codified the theory of NP-completeness and supplied a catalog of reductions linking canonical problems from boolean satisfiability to a wide spectrum of combinatorial tasks. The book synthesized results from researchers at venues including the Conference on Foundations of Computer Science, the Symposium on Theory of Computing, and the International Colloquium on Automata, Languages and Programming. It presented techniques for proving NP-hardness and for constructing polynomial-time reductions drawing on problems such as 3-SAT, Hamiltonian cycle problem, vertex cover problem, graph coloring, and subset sum problem.

Beyond that work, Garey authored and co-authored papers on algorithm design paradigms including greedy algorithms, dynamic programming, and approximation algorithms. He examined structural properties of computational problems via reductions and completeness results, relating them to applied domains represented by institutions such as Bell Labs Research, RAND Corporation, and departments associated with operations research. His publications addressed instances of scheduling problems, network design, and combinatorial optimization, connecting canonical theoretical problems to applied models like the travelling salesman problem and the bin packing problem.

Garey's writing style made complex topics accessible, influencing textbooks and lecture notes used across courses at MIT, Stanford, UC Berkeley, Princeton, and Columbia University. His documented reductions became standard references for proofs in research papers published at proceedings such as STOC, FOCS, ICALP, and journals including the Journal of the ACM and SIAM Journal on Computing.

Awards and honors

Over his career, Garey received recognition from academic and professional bodies including awards and fellowships awarded by institutions such as the National Science Foundation, the Association for Computing Machinery, and the American Mathematical Society. He was invited to deliver plenary and keynote addresses at symposia organized by conferences like FOCS and STOC, and to serve on editorial boards for journals such as the Journal of the ACM and the SIAM Journal on Computing. Professional societies including the ACM and SIAM acknowledged his influence on computer science education and theoretical research.

Selected notable projects and collaborations

- Co-authorship of a canonical textbook with a collaborator from a leading research university; the work aggregated reductions between problems such as 3-SAT, CLIQUE, NODE COVER, TRAVELING SALESMAN PROBLEM, and PARTITION PROBLEM and established a standardized approach adopted by researchers at Bell Labs, IBM Research, and major university groups. - Collaborative research projects linking theory groups at Carnegie Mellon University, MIT, and Stanford University that investigated approximation schemes for NP-hard optimization problems, exploring algorithms related to approximation scheme techniques and connections to probabilistically checkable proofs. - Participation in workshops sponsored by organizations like the National Science Foundation and the Defense Advanced Research Projects Agency that convened experts from Princeton University, Harvard University, Caltech, and national laboratories to address computational complexity foundations and applications in scheduling and network design. - Mentorship of doctoral students who pursued careers at institutions including University of California, San Diego, Georgia Institute of Technology, University of Toronto, University of Oxford, and ETH Zurich; collaborative papers with co-authors who later held positions at Microsoft Research, Google Research, and Amazon.

Category:Computer scientists Category:Theoretical computer scientists