Albert R. Meyer

Publication Activity (10 Years)

Years Active: 1966-2008
Publications (10 Years): 0

Publications

Albert R. Meyer
Reminiscences. Pillars of Computer Science (2008)
Larry J. Stockmeyer, Albert R. Meyer
Cosmological lower bound on the circuit complexity of a small problem in logic. J. ACM 49 (6) (2002)
Albert R. Meyer, Alexander Rabinovich
Valid Identity Problem for Shuffle Regular Expressions. J. Autom. Lang. Comb. 7 (1) (2002)
Trevor Jim, Albert R. Meyer
Full Abstraction and the Context Lemma. SIAM J. Comput. 25 (3) (1996)
Albert R. Meyer, Alexander Moshe Rabinovich
A solution of an interleaving decision problem by a partial order technique. Partial Order Methods in Verification (1996)
Lalita Jategaonkar, Albert R. Meyer
Deciding True Concurrency Equivalences on Safe, Finite Nets. Theor. Comput. Sci. 154 (1) (1996)
Albert R. Meyer
Concurrent Process Equivalences: Some Decision Problems (Abstract). STACS (1995)
Bard Bloom, Sorin Istrail, Albert R. Meyer
Bisimulation Can't be Traced. J. ACM 42 (1) (1995)
Joel I. Seiferas, Albert R. Meyer
Characterizations of Realizable Space Complexities. Ann. Pure Appl. Log. 73 (2) (1995)
Albert R. Meyer
Observing Truly Concurrent Processes. TACS (1994)
Lalita Jategaonkar, Albert R. Meyer
Deciding True Concurrency Equivalences on Finite Sate Nets (Preliminary Report). ICALP (1993)
Lalita Jategaonkar, Albert R. Meyer
Self-Synchronization of Concurrent Processes (Preliminary Report) LICS (1993)
Val Tannen, Albert R. Meyer
Conservativity of Equational Theories in Typed Lambda Calculi. Fundam. Informaticae 19 (1/2) (1993)
Bard Bloom, Albert R. Meyer
Experimenting with Process Equivalence. Theor. Comput. Sci. 101 (2) (1992)
Lalita Jategaonkar, Albert R. Meyer
Testing Equivalence for Petri Nets with Action Refinement: Preliminary Report. CONCUR (1992)
Trevor Jim, Albert R. Meyer
Full Abstraction and the Context Lemma. TACS (1991)
Kim B. Bruce, Albert R. Meyer, John C. Mitchell
The Semantics of Second-Order Lambda Calculus Inf. Comput. 85 (1) (1990)
Stavros S. Cosmadakis, Albert R. Meyer, Jon G. Riecke
Completeness for typed lazy inequalities LICS (1990)
Bard Bloom, Albert R. Meyer
A Remark on Bisimulation Between Probabilistic Processes. Logic at Botik (1989)
Bard Bloom, Sorin Istrail, Albert R. Meyer
Bisimulation Can't Be Traced. POPL (1988)
Albert R. Meyer
Semantical Paradigms: Notes for an Invited Lecture, with Two Appendices by Stavros S. Cosmadakis LICS (1988)
Albert R. Meyer, Kurt Sieber
Towards Fully Abstract Semantics for Local Variables. POPL (1988)
Albert R. Meyer, Jon G. Riecke
Continuations May be Unreasonable. LISP and Functional Programming (1988)
Val Tannen, Albert R. Meyer
Computable Values Can Be Classical. POPL (1987)
Albert R. Meyer, John C. Mitchell, Eugenio Moggi, Richard Statman
Empty Types in Polymorphic Lambda Calculus. POPL (1987)
Val Tannen, Albert R. Meyer
Polymorphism is conservative over simple types (Preliminary Report) LICS (1987)
Albert R. Meyer, Mark B. Reinhold
"Type" Is Not A Type. POPL (1986)
Joseph Y. Halpern, Michael C. Loui, Albert R. Meyer, Daniel Weise
On Time versus Space III. Math. Syst. Theory 19 (1) (1986)
Albert R. Meyer
Floyd-Hoare Logic Defines Semantics: Preliminary Version LICS (1986)
Rohit Parikh, Ashok K. Chandra, Joseph Y. Halpern, Albert R. Meyer
Equations Between Regular Terms and an Application to Process Logic. SIAM J. Comput. 14 (4) (1985)
Val Breazu-Tannen, Albert R. Meyer
Lambda Calculus with Constrained Types (Extended Abstract). Logic of Programs (1985)
John C. Mitchell, Albert R. Meyer
Second-Order Logical Relations (Extended Abstract). Logic of Programs (1985)
Albert R. Meyer, Mitchell Wand
Continuation Semantics in Typed Lambda-Calculi (Summary). Logic of Programs (1985)
A. Prasad Sistla, Edmund M. Clarke, Nissim Francez, Albert R. Meyer
Can Message Buffers Be Axiomatized in Linear Temporal Logic? Inf. Control. 63 (1/2) (1984)
Kim B. Bruce, Albert R. Meyer
The Semantics of Second Order Polymorphic Lambda Calculus. Semantics of Data Types (1984)
Albert R. Meyer, Jerzy Tiuryn
Equivalences among Logics of Programs. J. Comput. Syst. Sci. 29 (2) (1984)
Joseph Y. Halpern, Albert R. Meyer, Boris A. Trakhtenbrot
The Semantics of Local Storage, or What Makes the Free-List Free? POPL (1984)
Albert R. Meyer, John C. Mitchell
Termination Assertions for Recursive Programs: Completeness and Axiomatic Definability Inf. Control. 56 (1/2) (1983)
Albert R. Meyer
Understanding ALGOL: The View of a Recent Convert to Denotational Semantics. IFIP Congress (1983)
Boris A. Trakhtenbrot, Joseph Y. Halpern, Albert R. Meyer
From Denotational to Operational and Axiomatic Semantics for ALGOL-like Languages: an Overview. Logic of Programs (1983)
Michael J. Fischer, Albert R. Meyer, Mike Paterson
Omega(n log n) Lower Bounds on Length of Boolean Formulas. SIAM J. Comput. 11 (3) (1982)
Albert R. Meyer, Karl Winklmann
Expressing Program Looping in Regular Dynamic Logic. Theor. Comput. Sci. 18 (1982)
Albert R. Meyer
What is a Model of the Lambda Calculus? Inf. Control. 52 (1) (1982)
Albert R. Meyer, Joseph Y. Halpern
Axiomatic Definitions of Programming Languages: A Theoretical Assessment. J. ACM 29 (2) (1982)
Albert R. Meyer, John C. Mitchell
Axiomatic Definability and Completeness for Recursive Programs. POPL (1982)
Albert R. Meyer, Jerzy Tiuryn
A Note On Equivalences Among Logics of Programs. Logic of Programs (1981)
Joseph Y. Halpern, Albert R. Meyer
Axiomatic Definitions of Programming Languages, II. POPL (1981)
Ernst W. Mayr, Albert R. Meyer
The Complexity of the Finite Containment Problem for Petri Nets. J. ACM 28 (3) (1981)
Albert R. Meyer, Robert S. Streett, Grazyna Mirkowska
The Deducibility Problem in Propositional Dynamic Logic. ICALP (1981)
Albert R. Meyer, Rohit Parikh
Definability in Dynamic Logic. J. Comput. Syst. Sci. 23 (2) (1981)
Ashok K. Chandra, Joseph Y. Halpern, Albert R. Meyer, Rohit Parikh
Equations between Regular Terms and an Application to Process Logic STOC (1981)
Irene Greif, Albert R. Meyer
Specifying the Semantics of while Programs: A Tutorial and Critique of a Paper by Hoare and Lauer. ACM Trans. Program. Lang. Syst. 3 (4) (1981)
Ronald L. Rivest, Albert R. Meyer, Daniel J. Kleitman, Karl Winklmann, Joel Spencer
Coping with Errors in Binary Search Procedures. J. Comput. Syst. Sci. 20 (3) (1980)
Albert R. Meyer, Joseph Y. Halpern
Axiomatic Definitions of Programming Languages: A Theoretical Assessment. POPL (1980)
Albert R. Meyer, Rohit Parikh
Definability in Dynamic Logic STOC (1980)
Anna R. Bruss, Albert R. Meyer
On Time-Space Classes and their Relation to the Theory of Real Addition. Theor. Comput. Sci. 11 (1980)
Albert R. Meyer, Robert S. Streett, Grazyna Mirkowska
The Deducibility Problem in Propositional Dynamic Logic. Logic of Programs (1979)
Albert R. Meyer, Karl Winklmann
On the Expressive Power of Dynamic Logic (Preliminary Report) STOC (1979)
Irene Greif, Albert R. Meyer
Specifying Programming Language Semantics. POPL (1979)
Albert R. Meyer, Irene Greif
Can Partial Correctness Assertions Specify Programming Language Semantics?. Theoretical Computer Science (1979)
Ronald L. Rivest, Albert R. Meyer, Daniel J. Kleitman, Karl Winklmann, Joel Spencer
Coping with Errors in Binary Search Procedures (Preliminary Report) STOC (1978)
Joel I. Seiferas, Michael J. Fischer, Albert R. Meyer
Separating Nondeterministic Time Complexity Classes. J. ACM 25 (1) (1978)
Anni R. Bruss, Albert R. Meyer
On Time-Space Classes and Their Relation to the Theory of Real Addition STOC (1978)
David Harel, Albert R. Meyer, Vaughan R. Pratt
Computability and Completeness in Logics of Programs (Preliminary Report) STOC (1977)
E. Cardoza, Richard J. Lipton, Albert R. Meyer
Exponential Space Complete Problems for Petri Nets and Commutative Semigroups: Preliminary Report STOC (1976)
Peter A. Bloniarz, Michael J. Fischer, Albert R. Meyer
A Note on the Average Time to Compute Transitive Closures. ICALP (1976)
Michael J. Fischer, Albert R. Meyer, Mike Paterson
Lower Bounds on the Size of Boolean Formulas: Preliminary Report STOC (1975)
Robert Moll, Albert R. Meyer
Honest Bounds for Complexity Classes of Recursive Functions. J. Symb. Log. 39 (1) (1974)
Nancy A. Lynch, Albert R. Meyer, Michael J. Fischer
Sets that Don't Help STOC (1973)
John Lind, Albert R. Meyer
A characterization of log-space computable functions. SIGACT News 5 (3) (1973)
Joel I. Seiferas, Michael J. Fischer, Albert R. Meyer
Refinements of the Nondeterministic Time and Space Hierarchies SWAT (1973)
M. Bauer, D. Brand, Michael J. Fischer, Albert R. Meyer, Mike Paterson
A note on disjunctive form tautologies. SIGACT News 5 (2) (1973)
Larry J. Stockmeyer, Albert R. Meyer
Word Problems Requiring Exponential Time: Preliminary Report STOC (1973)
Albert R. Meyer, Patrick C. Fischer
Computational Speed-Up by Effective Operators. J. Symb. Log. 37 (1) (1972)
Albert R. Meyer
Program Size in Restricted Programming Languages Inf. Control. 21 (4) (1972)
Albert R. Meyer, A. Bagchi
Program Size and Economy of Descriptions: Preliminary Report STOC (1972)
Albert R. Meyer, Robert Moll
Honest Bounds for Complexity Classes of Recursive Functions SWAT (1972)
Patrick C. Fischer, Albert R. Meyer, Arnold L. Rosenberg
Real-Time Simulation of Multihead Tape Units. J. ACM 19 (4) (1972)
Albert R. Meyer, Larry J. Stockmeyer
The Equivalence Problem for Regular Expressions with Squaring Requires Exponential Space SWAT (1972)
Albert R. Meyer, Michael J. Fischer
Economy of Description by Automata, Grammars, and Formal Systems SWAT (1971)
Michael J. Fischer, Albert R. Meyer
Boolean Matrix Multiplication and Transitive Closure SWAT (1971)
Patrick C. Fischer, Albert R. Meyer, Arnold L. Rosenberg
Time-Restricted Sequence Generation. J. Comput. Syst. Sci. 4 (1) (1970)
Albert R. Meyer, C. Thompson
Remarks on Algebraic Decomposition of Automata. Math. Syst. Theory 3 (2) (1969)
Albert R. Meyer
A Note on Star-Free Events. J. ACM 16 (2) (1969)
Shimon Even, Albert R. Meyer
Sequential Boolean Equations. IEEE Trans. Computers 18 (3) (1969)
Edward M. McCreight, Albert R. Meyer
Classes of Computable Functions Defined by Bounds on Computation: Preliminary Report STOC (1969)
Patrick C. Fischer, Albert R. Meyer, Arnold L. Rosenberg
Counter Machines and Counter Languages. Math. Syst. Theory 2 (3) (1968)
Albert R. Meyer, Patrick C. Fischer
On Computational Speed-Up SWAT (1968)
Albert R. Meyer, Dennis M. Ritchie
The complexity of loop programs. ACM National Conference (1967)
Patrick C. Fischer, Albert R. Meyer, Arnold L. Rosenberg
Real Time Counter Machines (Preliminary Version) SWAT (1967)
Albert R. Meyer, Arnold L. Rosenberg, Patrick C. Fischer
Turing Machines with Several Read-Write Heads (Preliminary Report) SWAT (1967)
Shimon Even, Albert R. Meyer
Test for Planarity of a Circuit Given by an Expression. IEEE Trans. Electron. Comput. 15 (3) (1966)