|Intro||American theoretical computer scientist|
|Is||Engineer Computer scientist|
|From||United States of America|
|Type||Engineering Technology Science|
Albert Ronald da Silva Meyer (born 1941) is a professor of computer science at Massachusetts Institute of Technology (MIT).
Meyer received his PhD from Harvard University in 1972 in applied mathematics, under the supervision of Patrick C. Fischer. He has been at MIT since 1969.
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.
He is married to the computer scientist, Irene Greif.
- 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.CS1 maint: ref=harv (link).