Albert R. Meyer
Curriculum Vitae, November 2000

Research Interests

Professional Positions

• Feb, 1991: Appointed Hitachi America Professor of Engineering
• 1969-: Professor of Computer Science, Department of EECS, MIT
• 1978-1979: Visiting Professor, Division of Applied Science, Harvard University
• 1967-1969: Assistant Professor of Computer Science, Computer Science Department, Carnegie-Mellon University

Professional Activities

• Published over sixty papers on most aspects of Theoretical Computer Science; lectured regularly at symposia and Computer Science departments since 1967.
• Received numerous NSF and/or DARPA grants in Theoretical Computer Science.
• Supervised twenty-six completed Ph.D.'s now serving on tenured faculties of over a dozen leading universities, also IBM and Bell Labs research labs.
• Editor-in-chief, Information and Computation (an International Journal of Theoretical Computer Science), and on editorial boards of MIT Press, numerous other journals, and two handbooks of theoretical Computer Science.
• Member or Chair of program committees and organizing committees for numerous symposia and workshops sponsored by ACM, IEEE, EATCS, AMS, ASL, NSF, SDC, IBM, INRIA, CSSR, USSR, Japan Info. Processing Soc.
• Previously served as: Chair, MIT Computer Science Graduate Program; Head, MIT Lab. for CS Theory group; Associate Director, MIT Lab. for CS.
• Appointed ACM Fellow November, 1999; elected to American Academy of Arts and Sciences, May, 1987; member of ACM, SIAM, MAA, ASL, IEEE.
• Consultant for GTE Internetworking, Hitachi America Ltd., GTE, Mitre Corp., NRC, IBM.

Education

Selected Publications

1. Jim, T. and A.R. Meyer, ``Full Abstraction and the Context Lemma,'' SIAM J. Computation 25, 3 (1996), 663-696.
2. Jategaonkar, L. and A.R. Meyer, ``Deciding True Concurrency Equivalences on Finite Safe Nets,'' Theoretical Computer Science, 154 (Jan. 1996), 107-143.
3. Seiferas, J.I. and A.R. Meyer, ``Characterization of Realizable Space Complexities,'' Ann. Pure and Applied Logic, 73 (1995), 171-190.
4. Bloom, B., S. Istrail, and A.R. Meyer, ``Bisimulation Can't Be Traced,'' J. ACM, 42, 1 (1995), 232-268.
5. Bruce, K.B., A.R. Meyer and J.C. Mitchell, ``The Semantics of Second-Order Lambda Calculus,'' Information and Computation, 85 (1990), 76-134. Reprinted in: Gerard Huet, editor. Logical Foundations of Functional Programming, chapter 10, pages 213-272. University of Texas at Austin Year of Programming Series. Addison-Wesley Publishing Company, 1990.
6. Meyer, A.R., ``What is a Model of the Lambda Calculus?'', Information and Control, 52,1 (1982), 87-122.
7. Mayr, E. and A.R. Meyer, ``The Complexity of the Word Problems for Commutative Semigroups and Polynomial Ideals,'' Advances in Mathematics, 46,3 (1982), 305-329.
8. Mayr, E. and A.R. Meyer, ``The Complexity of the Finite Containment Problem for Petri Nets,'' J. ACM 28, 3 (July, 1981), 561-576.
9. Stockmeyer, L. and A.R. Meyer, ``Word Problems Requiring Exponential Time,'' 5th ACM Symp. on Theory of Computing, (May, 1973), 1-10.
10. Meyer, A.R. and L. Stockmeyer, ``The Equivalence Problem for Regular Expressions with Squaring Requires Exponential Space,'' 13th IEEE Symp. on Switching and Automata Theory, (Oct., 1972), 125-129.
11. Meyer, A.R., ``Program Size in Restricted Programming Languages,'' Information and Control, 2l, 4 (1972), 382-394.
12. Meyer, A.R. and C. Thompson, ``Remarks on Algebraic Decomposition of Automata,'' Mathematical Systems Theory, 3, 2 (1969), 110--118.