Jump to content

Albert R. Meyer

From Wikipedia, the free encyclopedia
Albert Ronald da Silva Meyer
Born (1941-11-05) November 5, 1941 (age 83)
Alma materHarvard University
SpouseIrene Greif
AwardsACM Fellow (2000)
Scientific career
FieldsComputer science
InstitutionsMIT
Doctoral advisorPatrick C. Fischer
Doctoral studentsNancy Lynch, Leonid Levin, Jeanne Ferrante, Charles Rackoff, Larry Stockmeyer, David Harel, Joseph Halpern, John C. Mitchell, Edward McCreight
Websitepeople.csail.mit.edu/meyer/

Albert Ronald da Silva Meyer (born 1941) is Hitachi America Professor emeritus of computer science at Massachusetts Institute of Technology (MIT).

Biography

[edit]

Meyer received his PhD from Harvard University in 1972 in applied mathematics, under the supervision of Patrick C. Fischer.[1] He joined the Department of Electrical Engineering and Computer Science (EECS) faculty at MIT in 1969. Meyer became the Hitachi America Professor of Computer Science and Engineering in 1991. He retired from MIT in 2016.[2]

Academic life

[edit]
Mathematics for Computer Science (2017) by Eric Lehman, F. Thomson Leighton, and Albert R. Meyer

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 was the editor-in-chief of the international computer science journal Information and Computation from 1981 until 2020.[3]

Awards

[edit]

He has been a Fellow of the American Academy of Arts and Sciences (AAAS) since 1987,[4] and he was inducted as a Fellow of the Association for Computing Machinery (ACM) in 2000.[5]

Personal life

[edit]

He is married to the computer scientist Irene Greif.[6]

Publications

[edit]
  • 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..

References

[edit]
  1. ^ Albert Ronald da Silva Meyer at the Mathematics Genealogy Project.
  2. ^ "Collection: Albert Meyer papers | MIT ArchivesSpace". archivesspace.mit.edu. Retrieved 2020-07-22.
  3. ^ Information and Computation
  4. ^ "M" (PDF). Members of the American Academy of Arts & Sciences: 1780–2005.
  5. ^ "ACM Fellows". Archived from the original on 2009-01-01. "ACM: Fellows Award / Albert R Meyer". Archived from the original on 2007-12-14. Retrieved 2009-06-07. "For fundamental advances in complexity theory and semantics of programming, and for outstanding service and education of graduate students."
  6. ^ McCluskey, Eileen (20 October 2008). "Irene Greif '69, SM '72, PhD '75 Knitting together computers and people". MIT Technology Review. Retrieved 19 April 2014.
[edit]


P ≟ NP 

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

Retrieved from "https://en.wikipedia.org/w/index.php?title=Albert_R._Meyer&oldid=1245482611"