Albert R. Meyer
|Albert Ronald da Silva Meyer|
|Born||1941 (age 75–76)|
|Alma mater||Harvard University|
|Doctoral advisor||Patrick C. Fischer|
|Doctoral students||Nancy Lynch, Leonid Levin, Jeanne Ferrante, Charles Rackoff, Larry Stockmeyer, David Harel, Joseph Halpern, John C. Mitchell|
|Notable awards||ACM Fellow (2000)|
Meyer's seminal works include Meyer & Stockmeyer (1972) which introduced the polynomial hierarchy. He has supervised numerous PhD students who are now famous computer scientists; these include Nancy Lynch, Leonid Levin, Jeanne Ferrante, Charles Rackoff, Larry Stockmeyer, David Harel, Joseph Halpern, and John C. Mitchell.
He has been a Fellow of the American Academy of Arts and Sciences (AAAS) since 1987, and he was inducted as a Fellow of the Association for Computing Machinery (ACM) in 2000. He is the editor-in-chief of the international computer science journal Information and Computation.
- 1991. Research Directions in Computer Science: An MIT Perspective. (Ed. with John Guttag, Ronald Rivest, and Peter Szolovits) MIT Press.
- Meyer, Albert R.; Stockmeyer, Larry J. (1972). "The equivalence problem for regular expressions with squaring requires exponential space". Proc. 13th Annual Symposium on Switching and Automata Theory. pp. 125–129. doi:10.1109/SWAT.1972.29..
- Albert Ronald da Silva Meyer at the Mathematics Genealogy Project.
- "M" (PDF). Members of the American Academy of Arts & Sciences: 1780–2005.
- "ACM Fellows". "ACM: Fellows Award / Albert R Meyer". "For fundamental advances in complexity theory and semantics of programming, and for outstanding service and education of graduate students."
- Information and Computation
- McCluskey, Eileen (20 October 2008). "Irene Greif '69, SM '72, PhD '75 Knitting together computers and people". MIT Technology Review. Retrieved 19 April 2014.
|P ≟ NP||This biographical article relating to a computer scientist is a stub. You can help Wikipedia by expanding it.|