Albert R. Meyer
Albert Ronald da Silva Meyer | |
|---|---|
| Born | 1941 |
| Alma mater | Harvard University |
| Scientific career | |
| 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 |
Albert Ronald da Silva Meyer (born 1941) is a professor of computer science at Massachusetts Institute of Technology (MIT). He has been a Fellow of the American Academy of Arts and Sciences (AAAS) since 1987,[1] and he was inducted as a Fellow of the Association for Computing Machinery (ACM) in 2000.[2]
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.
Meyer received his PhD from Harvard University in 1972 in applied mathematics, under the supervision of Patrick C. Fischer.[3] He has been at MIT since 1969.
Publications
- 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.
{{cite book}}: Invalid|ref=harv(help)CS1 maint: postscript (link).
Notes
- ^ "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."
- ^ Albert Ronald da Silva Meyer at the Mathematics Genealogy Project.
References
External links