Test for Planarity of a Circuit Given by an Expression. - Shimon Even; Albert R. Meyer (IEEE Trans. Electron. Comput., 1966)

The complexity of loop programs. - Albert R. Meyer; Dennis M. Ritchie (ACM National Conference, 1967)

Real Time Counter Machines (Preliminary Version) - Patrick C. Fischer; Albert R. Meyer; Arnold L. Rosenberg (SWAT, 1967)

Turing Machines with Several Read-Write Heads (Preliminary Report) - Albert R. Meyer; Arnold L. Rosenberg; Patrick C. Fischer (SWAT, 1967)

On Computational Speed-Up - Albert R. Meyer; Patrick C. Fischer (SWAT, 1968)

Counter Machines and Counter Languages. - Patrick C. Fischer; Albert R. Meyer; Arnold L. Rosenberg (Math. Syst. Theory, 1968)

Classes of Computable Functions Defined by Bounds on Computation: Preliminary Report - Edward M. McCreight; Albert R. Meyer (STOC, 1969)

A Note on Star-Free Events. - Albert R. Meyer (J. ACM, 1969)

Remarks on Algebraic Decomposition of Automata. - Albert R. Meyer; C. Thompson (Math. Syst. Theory, 1969)

Sequential Boolean Equations. - Shimon Even; Albert R. Meyer (IEEE Trans. Computers, 1969)

Time-Restricted Sequence Generation. - Patrick C. Fischer; Albert R. Meyer; Arnold L. Rosenberg (J. Comput. Syst. Sci., 1970)

Boolean Matrix Multiplication and Transitive Closure - Michael J. Fischer; Albert R. Meyer (SWAT, 1971)

Economy of Description by Automata, Grammars, and Formal Systems - Albert R. Meyer; Michael J. Fischer (SWAT, 1971)

The Equivalence Problem for Regular Expressions with Squaring Requires Exponential Space - Albert R. Meyer; Larry J. Stockmeyer (SWAT, 1972)

Program Size and Economy of Descriptions: Preliminary Report - Albert R. Meyer; A. Bagchi (STOC, 1972)

Real-Time Simulation of Multihead Tape Units. - Patrick C. Fischer; Albert R. Meyer; Arnold L. Rosenberg (J. ACM, 1972)

Computational Speed-Up by Effective Operators. - Albert R. Meyer; Patrick C. Fischer (J. Symb. Log., 1972)

Program Size in Restricted Programming Languages - Albert R. Meyer (Inf. Control., 1972)

Refinements of the Nondeterministic Time and Space Hierarchies - Joel I. Seiferas; Michael J. Fischer; Albert R. Meyer (SWAT, 1973)

Sets that Don't Help - Nancy A. Lynch; Albert R. Meyer; Michael J. Fischer (STOC, 1973)

Word Problems Requiring Exponential Time: Preliminary Report - Larry J. Stockmeyer; Albert R. Meyer (STOC, 1973)

A note on disjunctive form tautologies. - M. Bauer; D. Brand; Michael J. Fischer; Albert R. Meyer; Mike Paterson (SIGACT News, 1973)

A characterization of log-space computable functions. - John Lind; Albert R. Meyer (SIGACT News, 1973)

Honest Bounds for Complexity Classes of Recursive Functions. - Robert Moll; Albert R. Meyer (J. Symb. Log., 1974)

Lower Bounds on the Size of Boolean Formulas: Preliminary Report - Michael J. Fischer; Albert R. Meyer; Mike Paterson (STOC, 1975)

A Note on the Average Time to Compute Transitive Closures. - Peter A. Bloniarz; Michael J. Fischer; Albert R. Meyer (ICALP, 1976)

Exponential Space Complete Problems for Petri Nets and Commutative Semigroups: Preliminary Report - E. Cardoza; Richard J. Lipton; Albert R. Meyer (STOC, 1976)

Computability and Completeness in Logics of Programs (Preliminary Report) - David Harel; Albert R. Meyer; Vaughan R. Pratt (STOC, 1977)

On Time-Space Classes and Their Relation to the Theory of Real Addition - Anni R. Bruss; Albert R. Meyer (STOC, 1978)

Coping with Errors in Binary Search Procedures (Preliminary Report) - Ronald L. Rivest; Albert R. Meyer; Daniel J. Kleitman; Karl Winklmann; Joel Spencer (STOC, 1978)

Separating Nondeterministic Time Complexity Classes. - Joel I. Seiferas; Michael J. Fischer; Albert R. Meyer (J. ACM, 1978)

Specifying Programming Language Semantics. - Irene Greif; Albert R. Meyer (POPL, 1979)

On the Expressive Power of Dynamic Logic (Preliminary Report) - Albert R. Meyer; Karl Winklmann (STOC, 1979)

Can Partial Correctness Assertions Specify Programming Language Semantics?. - Albert R. Meyer; Irene Greif (Theoretical Computer Science, 1979)

Coping with Errors in Binary Search Procedures. - Ronald L. Rivest; Albert R. Meyer; Daniel J. Kleitman; Karl Winklmann; Joel Spencer (J. Comput. Syst. Sci., 1980)

On Time-Space Classes and their Relation to the Theory of Real Addition. - Anna R. Bruss; Albert R. Meyer (Theor. Comput. Sci., 1980)

The Deducibility Problem in Propositional Dynamic Logic. - Albert R. Meyer; Robert S. Streett; Grazyna Mirkowska (ICALP, 1981)

A Note On Equivalences Among Logics of Programs. - Albert R. Meyer; Jerzy Tiuryn (Logic of Programs, 1981)

Axiomatic Definitions of Programming Languages, II. - Joseph Y. Halpern; Albert R. Meyer (POPL, 1981)

The Complexity of the Finite Containment Problem for Petri Nets. - Ernst W. Mayr; Albert R. Meyer (J. ACM, 1981)

Definability in Dynamic Logic. - Albert R. Meyer; Rohit Parikh (J. Comput. Syst. Sci., 1981)

Specifying the Semantics of while Programs: A Tutorial and Critique of a Paper by Hoare and Lauer. - Irene Greif; Albert R. Meyer (ACM Trans. Program. Lang. Syst., 1981)

Axiomatic Definability and Completeness for Recursive Programs. - Albert R. Meyer; John C. Mitchell (POPL, 1982)

Axiomatic Definitions of Programming Languages: A Theoretical Assessment. - Albert R. Meyer; Joseph Y. Halpern (J. ACM, 1982)

Omega(n log n) Lower Bounds on Length of Boolean Formulas. - Michael J. Fischer; Albert R. Meyer; Mike Paterson (SIAM J. Comput., 1982)

Expressing Program Looping in Regular Dynamic Logic. - Albert R. Meyer; Karl Winklmann (Theor. Comput. Sci., 1982)

What is a Model of the Lambda Calculus? - Albert R. Meyer (Inf. Control., 1982)

Understanding ALGOL: The View of a Recent Convert to Denotational Semantics. - Albert R. Meyer (IFIP Congress, 1983)

From Denotational to Operational and Axiomatic Semantics for ALGOL-like Languages: an Overview. - Boris A. Trakhtenbrot; Joseph Y. Halpern; Albert R. Meyer (Logic of Programs, 1983)

Termination Assertions for Recursive Programs: Completeness and Axiomatic Definability - Albert R. Meyer; John C. Mitchell (Inf. Control., 1983)

The Semantics of Local Storage, or What Makes the Free-List Free? - Joseph Y. Halpern; Albert R. Meyer; Boris A. Trakhtenbrot (POPL, 1984)

The Semantics of Second Order Polymorphic Lambda Calculus. - Kim B. Bruce; Albert R. Meyer (Semantics of Data Types, 1984)

Can Message Buffers Be Axiomatized in Linear Temporal Logic? - A. Prasad Sistla; Edmund M. Clarke; Nissim Francez; Albert R. Meyer (Inf. Control., 1984)

Equivalences among Logics of Programs. - Albert R. Meyer; Jerzy Tiuryn (J. Comput. Syst. Sci., 1984)

Lambda Calculus with Constrained Types (Extended Abstract). - Val Breazu-Tannen; Albert R. Meyer (Logic of Programs, 1985)

Continuation Semantics in Typed Lambda-Calculi (Summary). - Albert R. Meyer; Mitchell Wand (Logic of Programs, 1985)

Second-Order Logical Relations (Extended Abstract). - John C. Mitchell; Albert R. Meyer (Logic of Programs, 1985)

Equations Between Regular Terms and an Application to Process Logic. - Rohit Parikh; Ashok K. Chandra; Joseph Y. Halpern; Albert R. Meyer (SIAM J. Comput., 1985)

Floyd-Hoare Logic Defines Semantics: Preliminary Version - Albert R. Meyer (LICS, 1986)

"Type" Is Not A Type. - Albert R. Meyer; Mark B. Reinhold (POPL, 1986)

On Time versus Space III. - Joseph Y. Halpern; Michael C. Loui; Albert R. Meyer; Daniel Weise (Math. Syst. Theory, 1986)

Polymorphism is conservative over simple types (Preliminary Report) - Val Tannen; Albert R. Meyer (LICS, 1987)

Empty Types in Polymorphic Lambda Calculus. - Albert R. Meyer; John C. Mitchell; Eugenio Moggi; Richard Statman (POPL, 1987)

Computable Values Can Be Classical. - Val Tannen; Albert R. Meyer (POPL, 1987)

Continuations May be Unreasonable. - Albert R. Meyer; Jon G. Riecke (LISP and Functional Programming, 1988)

Semantical Paradigms: Notes for an Invited Lecture, with Two Appendices by Stavros S. Cosmadakis - Albert R. Meyer (LICS, 1988)

Towards Fully Abstract Semantics for Local Variables. - Albert R. Meyer; Kurt Sieber (POPL, 1988)

A Remark on Bisimulation Between Probabilistic Processes. - Bard Bloom; Albert R. Meyer (Logic at Botik, 1989)

Completeness for typed lazy inequalities - Stavros S. Cosmadakis; Albert R. Meyer; Jon G. Riecke (LICS, 1990)

The Semantics of Second-Order Lambda Calculus - Kim B. Bruce; Albert R. Meyer; John C. Mitchell (Inf. Comput., 1990)

Testing Equivalence for Petri Nets with Action Refinement: Preliminary Report. - Lalita Jategaonkar; Albert R. Meyer (CONCUR, 1992)

Experimenting with Process Equivalence. - Bard Bloom; Albert R. Meyer (Theor. Comput. Sci., 1992)

Deciding True Concurrency Equivalences on Finite Sate Nets (Preliminary Report). - Lalita Jategaonkar; Albert R. Meyer (ICALP, 1993)

Self-Synchronization of Concurrent Processes (Preliminary Report) - Lalita Jategaonkar; Albert R. Meyer (LICS, 1993)

Conservativity of Equational Theories in Typed Lambda Calculi. - Val Tannen; Albert R. Meyer (Fundam. Informaticae, 1993)

Observing Truly Concurrent Processes. - Albert R. Meyer (TACS, 1994)

Concurrent Process Equivalences: Some Decision Problems (Abstract). - Albert R. Meyer (STACS, 1995)

Characterizations of Realizable Space Complexities. - Joel I. Seiferas; Albert R. Meyer (Ann. Pure Appl. Log., 1995)

Bisimulation Can't be Traced. - Bard Bloom; Sorin Istrail; Albert R. Meyer (J. ACM, 1995)

A solution of an interleaving decision problem by a partial order technique. - Albert R. Meyer; Alexander Moshe Rabinovich (Partial Order Methods in Verification, 1996)

Full Abstraction and the Context Lemma. - Trevor Jim; Albert R. Meyer (SIAM J. Comput., 1996)

Deciding True Concurrency Equivalences on Safe, Finite Nets. - Lalita Jategaonkar; Albert R. Meyer (Theor. Comput. Sci., 1996)

Cosmological lower bound on the circuit complexity of a small problem in logic. - Larry J. Stockmeyer; Albert R. Meyer (J. ACM, 2002)

Valid Identity Problem for Shuffle Regular Expressions. - Albert R. Meyer; Alexander Rabinovich (J. Autom. Lang. Comb., 2002)

Reminiscences. - Albert R. Meyer (Pillars of Computer Science, 2008)