| 1995 | STACS | Concurrent Process Equivalences: Some Decision Problems (Abstract). | Albert R. Meyer |
| 1993 | ICALP | Deciding True Concurrency Equivalences on Finite Sate Nets (Preliminary Report). | Lalita Jategaonkar, Albert R. Meyer |
| 1993 | LICS | Self-Synchronization of Concurrent Processes (Preliminary Report) | Lalita Jategaonkar, Albert R. Meyer |
| 1992 | CONCUR | Testing Equivalence for Petri Nets with Action Refinement: Preliminary Report. | Lalita Jategaonkar, Albert R. Meyer |
| 1990 | LICS | Completeness for typed lazy inequalities | Stavros S. Cosmadakis, Albert R. Meyer, Jon G. Riecke |
| 1988 | LICS | Semantical Paradigms: Notes for an Invited Lecture, with Two Appendices by Stavros S. Cosmadakis | Albert R. Meyer |
| 1988 | POPL | Bisimulation Can't Be Traced. | Bard Bloom, Sorin Istrail, Albert R. Meyer |
| 1988 | POPL | Towards Fully Abstract Semantics for Local Variables. | Albert R. Meyer, Kurt Sieber |
| 1987 | LICS | Polymorphism is conservative over simple types (Preliminary Report) | Val Tannen, Albert R. Meyer |
| 1987 | POPL | Empty Types in Polymorphic Lambda Calculus. | Albert R. Meyer, John C. Mitchell, Eugenio Moggi, Richard Statman |
| 1987 | POPL | Computable Values Can Be Classical. | Val Tannen, Albert R. Meyer |
| 1986 | LICS | Floyd-Hoare Logic Defines Semantics: Preliminary Version | Albert R. Meyer |
| 1986 | POPL | "Type" Is Not A Type. | Albert R. Meyer, Mark B. Reinhold |
| 1984 | POPL | The Semantics of Local Storage, or What Makes the Free-List Free? | Joseph Y. Halpern, Albert R. Meyer, Boris A. Trakhtenbrot |
| 1982 | POPL | Axiomatic Definability and Completeness for Recursive Programs. | Albert R. Meyer, John C. Mitchell |
| 1981 | ICALP | The Deducibility Problem in Propositional Dynamic Logic. | Albert R. Meyer, Robert S. Streett, Grazyna Mirkowska |
| 1981 | POPL | Axiomatic Definitions of Programming Languages, II. | Joseph Y. Halpern, Albert R. Meyer |
| 1981 | STOC | Equations between Regular Terms and an Application to Process Logic | Ashok K. Chandra, Joseph Y. Halpern, Albert R. Meyer, Rohit Parikh |
| 1980 | POPL | Axiomatic Definitions of Programming Languages: A Theoretical Assessment. | Albert R. Meyer, Joseph Y. Halpern |
| 1980 | STOC | Definability in Dynamic Logic | Albert R. Meyer, Rohit Parikh |
| 1979 | POPL | Specifying Programming Language Semantics. | Irene Greif, Albert R. Meyer |
| 1979 | STOC | On the Expressive Power of Dynamic Logic (Preliminary Report) | Albert R. Meyer, Karl Winklmann |
| 1978 | STOC | On Time-Space Classes and Their Relation to the Theory of Real Addition | Anni R. Bruss, Albert R. Meyer |
| 1978 | STOC | Coping with Errors in Binary Search Procedures (Preliminary Report) | Ronald L. Rivest, Albert R. Meyer, Daniel J. Kleitman, Karl Winklmann, Joel Spencer |
| 1977 | STOC | Computability and Completeness in Logics of Programs (Preliminary Report) | David Harel, Albert R. Meyer, Vaughan R. Pratt |
| 1976 | ICALP | A Note on the Average Time to Compute Transitive Closures. | Peter A. Bloniarz, Michael J. Fischer, Albert R. Meyer |
| 1976 | STOC | Exponential Space Complete Problems for Petri Nets and Commutative Semigroups: Preliminary Report | E. Cardoza, Richard J. Lipton, Albert R. Meyer |
| 1975 | STOC | Lower Bounds on the Size of Boolean Formulas: Preliminary Report | Michael J. Fischer, Albert R. Meyer, Mike Paterson |
| 1973 | FOCS | Refinements of the Nondeterministic Time and Space Hierarchies | Joel I. Seiferas, Michael J. Fischer, Albert R. Meyer |
| 1973 | STOC | Sets that Don't Help | Nancy A. Lynch, Albert R. Meyer, Michael J. Fischer |
| 1973 | STOC | Word Problems Requiring Exponential Time: Preliminary Report | Larry J. Stockmeyer, Albert R. Meyer |
| 1972 | FOCS | Honest Bounds for Complexity Classes of Recursive Functions | Albert R. Meyer, Robert Moll |
| 1972 | FOCS | The Equivalence Problem for Regular Expressions with Squaring Requires Exponential Space | Albert R. Meyer, Larry J. Stockmeyer |
| 1972 | STOC | Program Size and Economy of Descriptions: Preliminary Report | Albert R. Meyer, A. Bagchi |
| 1971 | FOCS | Boolean Matrix Multiplication and Transitive Closure | Michael J. Fischer, Albert R. Meyer |
| 1971 | FOCS | Economy of Description by Automata, Grammars, and Formal Systems | Albert R. Meyer, Michael J. Fischer |
| 1969 | STOC | Classes of Computable Functions Defined by Bounds on Computation: Preliminary Report | Edward M. McCreight, Albert R. Meyer |
| 1968 | FOCS | On Computational Speed-Up | Albert R. Meyer, Patrick C. Fischer |
| 1967 | FOCS | Real Time Counter Machines (Preliminary Version) | Patrick C. Fischer, Albert R. Meyer, Arnold L. Rosenberg |
| 1967 | FOCS | Turing Machines with Several Read-Write Heads (Preliminary Report) | Albert R. Meyer, Arnold L. Rosenberg, Patrick C. Fischer |