| 词条 | Albert R. Meyer |
| 释义 |
|name = Albert Ronald da Silva Meyer |image = |image_size = |caption = |birth_date = {{birth date and age|1941|11|05}} |birth_place = |residence = |citizenship = |nationality = |fields = Computer science |workplaces = MIT |alma_mater = Harvard University |doctoral_advisor = Patrick C. Fischer |academic_advisors = |doctoral_students = Nancy Lynch, Leonid Levin, Jeanne Ferrante, Charles Rackoff, Larry Stockmeyer, David Harel, Joseph Halpern, John C. Mitchell |notable_students = |known_for = |author_abbrev_bot = |author_abbrev_zoo = |influences = |influenced = |awards = ACM Fellow (2000) |signature = |website = {{URL|http://people.csail.mit.edu/meyer/}} |spouse = Irene Greif |footnotes = }} Albert Ronald da Silva Meyer (born 1941) is a professor of computer science at Massachusetts Institute of Technology (MIT). BiographyMeyer 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 lifeMeyer'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. AwardsHe 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 lifeHe is married to the computer scientist, Irene Greif.[5] Publications
| chapter=The equivalence problem for regular expressions with squaring requires exponential space | last1=Meyer | first1=Albert R. | last2=Stockmeyer | first2=Larry J. | authorlink2=Larry Stockmeyer | title=Proc. 13th Annual Symposium on Switching and Automata Theory | pages=125–129 | year=1972 | doi=10.1109/SWAT.1972.29 | ref=harv | title-link=Symposium on Switching and Automata Theory }}. References1. ^{{mathgenealogy|name=Albert Ronald da Silva Meyer|id=25184}}. 2. ^{{cite web | url=http://www.amacad.org/publications/BookofMembers/ChapterM.pdf | title=M | work=Members of the American Academy of Arts & Sciences: 1780–2005}} 3. ^{{cite web |url = http://fellows.acm.org/homepage.cfm?alpha=M&srt=alpha |title = ACM Fellows |deadurl = yes |archiveurl = https://web.archive.org/web/20090101062504/http://fellows.acm.org/homepage.cfm?alpha=M&srt=alpha |archivedate = 2009-01-01}}{{cite web |url = http://fellows.acm.org/fellow_citation.cfm?id=1215300&srt=all |title = ACM: Fellows Award / Albert R Meyer |access-date = 2009-06-07 |archive-url = https://web.archive.org/web/20071214190812/http://fellows.acm.org/fellow_citation.cfm?id=1215300&srt=all |archive-date = 2007-12-14 |dead-url = yes |df = }} "For fundamental advances in complexity theory and semantics of programming, and for outstanding service and education of graduate students." 4. ^Information and Computation 5. ^{{cite news|last=McCluskey|first=Eileen|title=Irene Greif '69, SM '72, PhD '75 Knitting together computers and people|url=http://www.technologyreview.com/article/410994/irene-greif-69-sm-72-phd-75/|accessdate=19 April 2014|newspaper=MIT Technology Review|date=20 October 2008}} External links{{sisterlinks|d=Q4711067|q=no|n=no|b=no|v=no|voy=no|m=no|mw=no|species=no|c=Category:Albert R. Meyer|wikt=no|s=Author:Albert Ronald da Silva Meyer}}
7 : 1941 births|Living people|Theoretical computer scientists|Fellows of the Association for Computing Machinery|Fellows of the American Academy of Arts and Sciences|Massachusetts Institute of Technology faculty|Harvard University alumni |
| 随便看 |
|
开放百科全书收录14589846条英语、德语、日语等多语种百科知识，基本涵盖了大多数领域的百科知识，是一部内容自由、开放的电子版国际百科全书。