Albert Ronald da Silva Meyer (born 1941) is Hitachi America Professoremeritus ofcomputer science atMassachusetts Institute of Technology (MIT).
Albert Ronald da Silva Meyer | |
---|---|
Born | (1941-11-05)November 5, 1941 (age 83) |
Alma mater | Harvard University |
Spouse | Irene Greif |
Awards | ACM Fellow (2000) |
Scientific career | |
Fields | Computer science |
Institutions | MIT |
Doctoral advisor | Patrick C. Fischer |
Doctoral students | Nancy Lynch,Leonid Levin,Jeanne Ferrante,Charles Rackoff,Larry Stockmeyer,David Harel,Joseph Halpern,John C. Mitchell,Edward McCreight,Val Tannen |
Website | people |
Biography
editMeyer received his PhD fromHarvard University in 1972 in applied mathematics, under the supervision ofPatrick 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
editMeyer's seminal works includeMeyer & Stockmeyer (1972), which introduced thepolynomial hierarchy. He has supervised numerous PhD students who are now famous computer scientists; these includeNancy Lynch,Leonid Levin,Jeanne Ferrante,Charles Rackoff,Larry Stockmeyer,David Harel,Joseph Halpern,John C. Mitchell, andVal Tannen. He was the editor-in-chief of the international computer science journalInformation and Computation from 1981 until 2020.[3]
Awards
editHe has been a Fellow of theAmerican Academy of Arts and Sciences (AAAS) since 1987,[4] and he was inducted as a Fellow of theAssociation for Computing Machinery (ACM) in 2000.[5]
Personal life
editHe is married to the computer scientistIrene Greif.[6]
Publications
edit- 1991.Research Directions in Computer Science: An MIT Perspective. (Ed. withJohn 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- ^Albert Ronald da Silva Meyer at theMathematics Genealogy Project.
- ^"Collection: Albert Meyer papers | MIT ArchivesSpace".archivesspace.mit.edu. Retrieved2020-07-22.
- ^Information and Computation
- ^"M"(PDF).Members of the American Academy of Arts & Sciences: 1780–2005.
- ^"ACM Fellows". Archived fromthe original on 2009-01-01."ACM: Fellows Award / Albert R Meyer". Archived fromthe original on 2007-12-14. Retrieved2009-06-07. "For fundamental advances in complexity theory and semantics of programming, and for outstanding service and education of graduate students."
- ^McCluskey, Eileen (20 October 2008)."Irene Greif '69, SM '72, PhD '75 Knitting together computers and people".MIT Technology Review. Retrieved19 April 2014.
External links
edit- Official website
- Meyer, Albert R. atMathSciNet
- Albert R. Meyer atDBLP Bibliography Server
- Albert Meyer papers, MC-0377. Massachusetts Institute of Technology, Department of Distinctive Collections, Cambridge, Massachusetts.
P ≟ NP | This biographical article relating to acomputer scientist is astub. You can help Wikipedia byexpanding it. |