Albert R. Meyer

Q: What Schools Are Affiliated With Albert R. Meyer

Albert R. Meyer is affiliated with the following schools: University of Luxembourg, Massachusetts Institute of Technology, Brooklyn College, Harvard University

Albert R. Meyer's AcademicInfluence.com Rankings

Albert R. Meyer

Computer Science

#617

World Rank

#637

Historical Rank

#335

USA Rank

computer-science Degrees

Albert R. Meyer

Mathematics

#1469

World Rank

#2403

Historical Rank

#601

USA Rank

Measure Theory

#1475

World Rank

#1846

Historical Rank

#500

USA Rank

mathematics Degrees

Download Badge

Computer Science
Mathematics

Albert R. Meyer's Degrees

Bachelors Mathematics Brooklyn College

Similar Degrees You Can Earn

Best Online Bachelor's in Math Ranked

Why Is Albert R. Meyer Influential?

(Suggest an Edit or Addition)

According to Wikipedia, Albert Ronald da Silva Meyer is Hitachi America Professor emeritus of computer science at Massachusetts Institute of Technology . Biography Meyer received his PhD from Harvard University in 1972 in applied mathematics, under the supervision of Patrick C. Fischer. He joined the Department of Electrical Engineering and Computer Science faculty at MIT in 1969. Meyer became the Hitachi America Professor of Computer Science and Engineering in 1991. He retired from MIT in 2016.

(See a Problem?)

Albert R. Meyer's Published Works

Number of citations in a given year to any of this author's works

Total number of citations to an author for the works they published in a given year. This highlights publication of the most important work(s) by the author

Published Works

Word problems requiring exponential time(Preliminary Report) (1973) (840)
The Equivalence Problem for Regular Expressions with Squaring Requires Exponential Space (1972) (692)
Introduction to Number Theory (2005) (691)
The complexity of the word problems for commutative semigroups and polynomial ideals (1982) (585)
Bisimulation can't be traced (1988) (413)
Economy of Description by Automata, Grammars, and Formal Systems (1971) (330)
WEAK MONADIC SECOND ORDER THEORY OF SUCCESSOR IS NOT ELEMENTARY-RECURSIVE (1973) (232)
Boolean Matrix Multiplication and Transitive Closure (1971) (202)
What is a Model of the Lambda Calculus? (1982) (194)
Coping with Errors in Binary Search Procedures (1980) (193)
The complexity of loop programs (1967) (193)
Separating Nondeterministic Time Complexity Classes (1978) (174)
Exponential space complete problems for Petri nets and commutative semigroups (Preliminary Report) (1976) (140)
Review: Walter J. Savitch, Relationships between Nondeterministic and Deterministic Tape Complexities (1974) (137)
Continuation Semantics in Typed Lambda-Calculi (Summary) (1985) (119)
Counter machines and counter languages (1968) (117)
Bisimulation can't be traced. Preliminary report (1987) (113)
Bisimulation can't be traced (1995) (106)
The Complexity of the Finite Containment Problem for Petri Nets (1981) (104)
Towards fully abstract semantics for local variables (1988) (93)
Classes of computable functions defined by bounds on computation: Preliminary Report (1969) (93)
The Semantics of Second-Order Lambda Calculus (1990) (87)
Handbook of Theoretical Computer Science: Algorithms and Complexity (1990) (86)
Computability and completeness in logics of programs (Preliminary Report) (1977) (84)
Towards a fully abstract semantics for local variables: Preliminary report (1988) (82)
Real-Time Simulation of Multihead Tape Units (1972) (75)
"Type" is not a type (1986) (68)
The semantics of local storage, or what makes the free-list free?(Preliminary Report) (1984) (61)
Program Size in Restricted Programming Languages (1972) (58)
Computational speed-up by effective operators (1972) (58)
Deciding True Concurrency Equivalences on Safe, Finite Nets (1996) (53)
Second-Order Logical Relations (Extended Abstract) (1985) (52)
Semantical paradigms: notes for an invited lecture (1988) (50)
A Note on Star-Free Events (1969) (50)
The Semantics of Second Order Polymorphic Lambda Calculus (1984) (49)
Definability in Dynamic Logic (1980) (45)
A Classification of the Recursive Functions (1972) (41)
AN IMPROVED OVERLAP ARGUMENT FOR ON-LINE MULTIPLICATION (1974) (40)
Equations between regular terms and an application to process logic (1981) (40)
From Denotational to Operational and Axiomatic Semantics for ALGOL-like Languages: an Overview (1983) (39)
On time-space classes and their relation to the theory of real addition (1978) (39)
Mathematics for Computer Science (2017) (37)
Axiomatic Definitions of Programming Languages: A Theoretical Assessment (1982) (36)
Full Abstraction and the Context Lemma (1991) (36)
Empty types in polymorphic lambda calculus (1987) (36)
Cosmological lower bound on the circuit complexity of a small problem in logic (2002) (35)
Omega(n log n) Lower Bounds on Length of Boolean Formulas (1982) (33)
Refinements of the Nondeterministic Time and Space Hierarchies (1973) (33)
Can Message Buffers Be Axiomatized in Linear Temporal Logic? (1986) (31)
Logic at Botik '89 (1989) (31)
COMPUTATIONALLY COMPLEX AND PSEUDO-RANDOM ZERO-ONE VALUED FUNCTIONS††Portions of this work were carried out at Carngie-Mellon University, while the authors were in the Department of Computer Science. Portions of these results were reported in preliminary form in [1]. (1971) (30)
A Remark on Bisimulation Between Probabilistic Processes (1989) (29)
Semantical Paradigms: Notes for an Invited Lecture, with Two Appendices by Stavros S. Cosmadakis (1988) (26)
Computable values can be classical (1987) (24)
A Note on the Average Time to Compute Transitive Closures (1976) (23)
Experimenting with Process Equivalence (1992) (23)
Continuations may be unreasonable (1988) (22)
Specifying the Semantics of while Programs: A Tutorial and Critique of a Paper by Hoare and Lauer (1981) (21)
Lambda Calculus with Constrained Types (Extended Abstract) (1985) (20)
Testing Equivalence for Petri Nets with Action Refinement: Preliminary Report (1992) (20)
Expressing Program Looping in Regular Dynamic Logic (1982) (20)
The Deducibility Problem in Propositional Dynamic Logic (1981) (19)
Axiomatic definitions of programming languages: a theoretical assessment (preliminary report) (1980) (18)
Sequential Boolean Equations (1969) (16)
Research directions in computer science: an MIT perspective (1991) (16)
On Computational Speed-Up (1968) (15)
Time-Restricted Sequence Generation (1970) (14)
On the expressive power of Dynamic Logic (Preliminary Report) (1979) (14)
A Note On Equivalences Among Logics of Programs (1981) (13)
Specifying programming language semantics: a tutorial and critique of a paper by Hoare and Lauer (1979) (12)
Honest bounds for complexity classes of recursive functions (1972) (11)
Characterizations of Realizable Space Complexities (1995) (11)
Papers presented at the IEEE symposium on Logic in computer science (1994) (11)
Lower bounds on the size of Boolean formulas: Preliminary Report (1975) (11)
Equivalences among Logics of Programs (1984) (10)
Termination Assertions for Recursive Programs: Completeness and Axiomatic Definability (1983) (10)
Turing Machines with Several Read-Write Heads (Preliminary Report) (1967) (10)
On orders of translations and enumerations. (1973) (10)
Polymorphism is conservative over simple types (1990) (9)
Deciding True Concurrency Equivalences on Finite Sate Nets (Preliminary Report) (1993) (9)
Coping with errors in binary search procedures (Preliminary Report) (1978) (9)
Program size and economy of descriptions: Preliminary Report (1972) (8)
A characterization of log-space computable functions (1973) (8)
Proceedings of the International Conference on Theoretical Aspects of Computer Software (1991) (8)
Self-synchronization of concurrent processes (1993) (7)
Real Time Counter Machines (Preliminary Version) (1967) (6)
Completeness for typed lazy inequalities (1990) (6)
Axiomatic definability and completeness for recursive programs (1982) (6)
PROPERTIES OF BOUNDS ON COMPUTATION (1969) (5)
On time versus space III (1986) (5)
Specifying Programming Language Semantics. (1979) (5)
Axiomatic definitions of programming languages, II (1981) (4)
Floyd-Hoare Logic Defines Semantics: Preliminary Version (1986) (4)
Sets that don't help (1973) (4)
Time and Space (1977) (4)
A solution of an interleaving decision problem by a partial order technique (1997) (3)
Remarks on algebraic decomposition of automata (1969) (3)
Completeness for Typed Lazy Inequalities (Preliminary Report) (1990) (3)
Logic at Botik '89, Symposium on Logical Foundations of Computer Science, Pereslav-Zalessky, USSR, July 3-8, 1989, Proceedings (1989) (3)
Polymorphism is conservative over simple types (Preliminary Report) (1987) (3)
The International Conference on Theoretical Aspects of Computer Science, Sendai, 1991 (1993) (2)
Can Partial Correctness Assertions Specify Programming Language Semantics? (1979) (2)
Concurrent Process Equivalences: Some Decision Problems (Abstract) (1995) (2)
Valid Identity Problem for Shuffle Regular Expressions (2001) (2)
Observing Truly Concurrent Processes (1994) (1)
Self-Synchronization of Concurrent Processes (Preliminary Report) (1993) (1)
Theoretical aspects of computer software : International Conference TACS'91, Sendai, Japan, September 24-27, 1991 : proceedings (1991) (1)
NOTES FOR AN INVITED LECTURE (1988) (1)
Test for Planarity of a Circuit Given by an Expression (1966) (0)
Responsibilities to Undergraduate and Graduate Students (2006) (0)
Abrahamson, KA, Downey, RG and Fellows, MR (1995) (0)
Multi-axial load cell (1998) (0)
Should a Function Continue? Should a Function Continue? (1989) (0)
Ln MIT / LCS / TM-353 Cn 0 ) N 0 N SEMANTICAL PARADIGMS : NOTES FOR AN INVITED LECTURE (0)
State Machines : Invariants and Termination 1 State machines (2005) (0)
Modelling Ge- Netic Algorithms with Markov Chains. In (1994) (0)
Directed Graphs (2017) (0)
State Machines: Invariants and Termination 1 Modeling Processes (2003) (0)
MD/DC arrangements subject to legal issues. (2012) (0)
Pressure From Consulting (2006) (0)
A hand book for patent agents, inventors and manufacturers of the patent, trade-mark and design laws in Japan and Korea (0)
A Question of Mentoring Bias (2006) (0)
Proofs 1 What is a Proof ? (2005) (0)
Dedicated to our colleague and friend Michael Machtey (1981) (0)
6.042J / 18.062J Mathematics for Computer Science (SMA 5512), Fall 2002 (2002) (0)
Priority Arguments in Complexity Theory (1972) (0)
7 Conclusion and Open Problems (1994) (0)
Understanding ALGOL: The View of a Recent Convert to Denotational Semantics (1983) (0)
Full Abstraction and the Context Lemma 1 (1991) (0)
The Word Problem for Semigroups 1 Semigroup Equations (2003) (0)
Puzzles in Programming Logic ∗ DRAFT October , 1986 (2005) (0)
Proceedings of the Symposium on Logical Foundations of Computer Science: Logic at Botik '89 (1989) (0)
Consignment closets still a viable option. (2012) (0)
Expectation & Variance 1 Expectation 1.1 Average & Expected Value (2006) (0)
Savitch Walter J.. Relationships between nondeterministic and deterministic tape complexities. Journal of computer and system sciences, vol. 4 (1970), pp. 177–192. (1974) (0)
A change of name (1987) (0)
Random Variables , Distributions and Expectation 1 Random Variables (2005) (0)
Building on a Premature Claim: A Cautionary Tale (2006) (0)
A Note on Orders of Enumeration (1972) (0)
Adequate Models for Recursive Program Schemes Adequate Models for Recursive Program Schemes (1989) (0)
ON ORDERS OF ENUMERAT I ONS AND TRANSLAT I ONS (2018) (0)
Conservativity of Equational Theories in Typed Lambda Calculi (1993) (0)
6.042J / 18.062J Mathematics for Computer Science, Spring 2010 (2005) (0)
When May a Student Publish? Version for Theoretical Work (2006) (0)
Discovery of Error in One's Own Work (2009) (0)
Surprise Authorship, Credit and Responsibility (2006) (0)

This paper list is powered by the following services:

Other Resources About Albert R. Meyer

What Schools Are Affiliated With Albert R. Meyer?

Albert R. Meyer is affiliated with the following schools:

Albert R. Meyer's Academic­Influence.com Rankings

Albert R. Meyer's Degrees

Similar Degrees You Can Earn

Why Is Albert R. Meyer Influential?

Albert R. Meyer's Published Works

Published Works

Other Resources About Albert R. Meyer

What Schools Are Affiliated With Albert R. Meyer?

Albert R. Meyer's AcademicInfluence.com Rankings