Jump to content

Albert R. Meyer: Difference between revisions

From Wikipedia, the free encyclopedia
Browse history interactively
← Previous editNext edit →
Content deleted Content added
VisualWikitext
m Correct citation errors (deprecated dead-url parameters), and genfixes
No edit summary
Line 35: Line 35:
==Academic life==
==Academic life==
[[File:Mathematics for Computer Science by Eric Lehman, F. Thomson Leighton, and Albert R. Meyer.pdf|thumb|''Mathematics for Computer Science'' (2017) by Eric Lehman, F. Thomson Leighton, and Albert R. Meyer]]
[[File:Mathematics for Computer Science by Eric Lehman, F. Thomson Leighton, and Albert R. Meyer.pdf|thumb|''Mathematics for Computer Science'' (2017) by Eric Lehman, F. Thomson Leighton, and Albert R. Meyer]]
Meyer's seminal works include {{harvtxt|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's seminal works include {{harvtxt|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]].


==Awards==
==Awards==
Line 57: Line 57:
|url-status=dead
|url-status=dead
|df =
|df =
}} "For fundamental advances in complexity theory and semantics of programming, and for outstanding service and education of graduate students."</ref> He is the editor-in-chief of the international computer science journal '''Information and Computation'''.<ref name="test">[http://www.journals.elsevier.com/information-and-computation/ Information and Computation]</ref>
}} "For fundamental advances in complexity theory and semantics of programming, and for outstanding service and education of graduate students."</ref> He is the editor-in-chief of the international computer science journal '''[[Information and Computation]]'''.<ref name="test">[http://www.journals.elsevier.com/information-and-computation/ Information and Computation]</ref>


==Personal life==
==Personal life==

Revision as of 14:57, 12 November 2019

Albert Ronald da Silva Meyer
Born (1941-11-05) November 5, 1941 (age 82)
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
Websitepeople.csail.mit.edu/meyer/

Albert Ronald da Silva Meyer (born 1941) is a professor of computer science at Massachusetts Institute of Technology (MIT).

Biography

Meyer received his PhD from Harvard University in 1972 in applied mathematics, under the supervision of Patrick C. Fischer.[1] He has been at MIT since 1969.

Academic life

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.

Awards

He has been a Fellow of the American Academy of Arts and Sciences (AAAS) since 1987,[2] and he was inducted as a Fellow of the Association for Computing Machinery (ACM) in 2000.[3] He is the editor-in-chief of the international computer science journal Information and Computation.[4]

Personal life

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

Publications

  • 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. {{cite book}}: Invalid |ref=harv (help).

References

  1. ^ Albert Ronald da Silva Meyer at the Mathematics Genealogy Project.
  2. ^ "M" (PDF). Members of the American Academy of Arts & Sciences: 1780–2005.
  3. ^ "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."
  4. ^ Information and Computation
  5. ^ 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.

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