Albert R. Meyer

According to our database, Albert R. Meyer authored at least 85 papers between 1966 and 2008.

Collaborative distances:

• Dijkstra number of two.
• Erdős number of two.

2008

Reminiscences.

Albert R. Meyer

Proceedings of the Pillars of Computer Science, 2008

2002

Valid Identity Problem for Shuffle Regular Expressions.

Albert R. Meyer, Alexander Rabinovich

J. Autom. Lang. Comb., 2002

Cosmological lower bound on the circuit complexity of a small problem in logic.

Larry J. Stockmeyer, Albert R. Meyer

J. ACM, 2002

1996

Deciding True Concurrency Equivalences on Safe, Finite Nets.

Lalita Jategaonkar, Albert R. Meyer

Theor. Comput. Sci., 1996

Full Abstraction and the Context Lemma.

Trevor Jim, Albert R. Meyer

SIAM J. Comput., 1996

A solution of an interleaving decision problem by a partial order technique.

Albert R. Meyer, Alexander Moshe Rabinovich

Proceedings of the Partial Order Methods in Verification, Proceedings of a DIMACS Workshop, 1996

1995

Bisimulation Can't be Traced.

Bard Bloom, Sorin Istrail, Albert R. Meyer

J. ACM, 1995

Characterizations of Realizable Space Complexities.

Joel I. Seiferas, Albert R. Meyer

Ann. Pure Appl. Log., 1995

Concurrent Process Equivalences: Some Decision Problems (Abstract).

Albert R. Meyer

Proceedings of the STACS 95, 1995

1994

Observing Truly Concurrent Processes.

Albert R. Meyer

Proceedings of the Theoretical Aspects of Computer Software, 1994

1993

Conservativity of Equational Theories in Typed Lambda Calculi.

Val Tannen, Albert R. Meyer

Fundam. Informaticae, 1993

Self-Synchronization of Concurrent Processes (Preliminary Report)

Lalita Jategaonkar, Albert R. Meyer

Proceedings of the Eighth Annual Symposium on Logic in Computer Science (LICS '93), 1993

Deciding True Concurrency Equivalences on Finite Sate Nets (Preliminary Report).

Lalita Jategaonkar, Albert R. Meyer

Proceedings of the Automata, Languages and Programming, 20nd International Colloquium, 1993

1992

Experimenting with Process Equivalence.

Bard Bloom, Albert R. Meyer

Theor. Comput. Sci., 1992

Testing Equivalence for Petri Nets with Action Refinement: Preliminary Report.

Lalita Jategaonkar, Albert R. Meyer

Proceedings of the CONCUR '92, 1992

1990

The Semantics of Second-Order Lambda Calculus

Kim B. Bruce, Albert R. Meyer, John C. Mitchell

Inf. Comput., March, 1990

Completeness for typed lazy inequalities

Stavros S. Cosmadakis, Albert R. Meyer, Jon G. Riecke

Proceedings of the Fifth Annual Symposium on Logic in Computer Science (LICS '90), 1990

1989

A Remark on Bisimulation Between Probabilistic Processes.

Bard Bloom, Albert R. Meyer

Proceedings of the Logic at Botik '89, 1989

1988

Towards Fully Abstract Semantics for Local Variables.

Albert R. Meyer, Kurt Sieber

Proceedings of the Conference Record of the Fifteenth Annual ACM Symposium on Principles of Programming Languages, 1988

Semantical Paradigms: Notes for an Invited Lecture, with Two Appendices by Stavros S. Cosmadakis

Albert R. Meyer

Proceedings of the Third Annual Symposium on Logic in Computer Science (LICS '88), 1988

Continuations May be Unreasonable.

Albert R. Meyer, Jon G. Riecke

Proceedings of the 1988 ACM Conference on LISP and Functional Programming, 1988

1987

Computable Values Can Be Classical.

Val Tannen, Albert R. Meyer

Proceedings of the Conference Record of the Fourteenth Annual ACM Symposium on Principles of Programming Languages, 1987

Empty Types in Polymorphic Lambda Calculus.

Albert R. Meyer, John C. Mitchell, Eugenio Moggi, Richard Statman

Proceedings of the Conference Record of the Fourteenth Annual ACM Symposium on Principles of Programming Languages, 1987

Polymorphism is conservative over simple types (Preliminary Report)

Val Tannen, Albert R. Meyer

Proceedings of the Symposium on Logic in Computer Science (LICS '87), 1987

1986

On Time versus Space III.

Joseph Y. Halpern, Michael C. Loui, Albert R. Meyer, Daniel Weise

Math. Syst. Theory, 1986

"Type" Is Not A Type.

Albert R. Meyer, Mark B. Reinhold

Proceedings of the Conference Record of the Thirteenth Annual ACM Symposium on Principles of Programming Languages, 1986

Floyd-Hoare Logic Defines Semantics: Preliminary Version

Albert R. Meyer

Proceedings of the Symposium on Logic in Computer Science (LICS '86), 1986

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

Second-Order Logical Relations (Extended Abstract).

John C. Mitchell, Albert R. Meyer

Proceedings of the Logics of Programs, 1985

Continuation Semantics in Typed Lambda-Calculi (Summary).

Albert R. Meyer, Mitchell Wand

Proceedings of the Logics of Programs, 1985

Lambda Calculus with Constrained Types (Extended Abstract).

Val Breazu-Tannen, Albert R. Meyer

Proceedings of the Logics of Programs, 1985

1984

Equivalences among Logics of Programs.

Albert R. Meyer, Jerzy Tiuryn

J. Comput. Syst. Sci., 1984

Can Message Buffers Be Axiomatized in Linear Temporal Logic?

A. Prasad Sistla, Edmund M. Clarke, Nissim Francez, Albert R. Meyer

Inf. Control., 1984

The Semantics of Second Order Polymorphic Lambda Calculus.

Kim B. Bruce, Albert R. Meyer

Proceedings of the Semantics of Data Types, International Symposium, 1984

The Semantics of Local Storage, or What Makes the Free-List Free?

Joseph Y. Halpern, Albert R. Meyer, Boris A. Trakhtenbrot

Proceedings of the Conference Record of the Eleventh Annual ACM Symposium on Principles of Programming Languages, 1984

1983

Termination Assertions for Recursive Programs: Completeness and Axiomatic Definability

Albert R. Meyer, John C. Mitchell

Inf. Control., 1983

From Denotational to Operational and Axiomatic Semantics for ALGOL-like Languages: an Overview.

Boris A. Trakhtenbrot, Joseph Y. Halpern, Albert R. Meyer

Proceedings of the Logics of Programs, 1983

Understanding ALGOL: The View of a Recent Convert to Denotational Semantics.

Albert R. Meyer

Proceedings of the Information Processing 83, 1983

1982

What is a Model of the Lambda Calculus?

Albert R. Meyer

Inf. Control., January, 1982

Expressing Program Looping in Regular Dynamic Logic.

Albert R. Meyer, Karl Winklmann

Theor. Comput. Sci., 1982

Omega(n log n) Lower Bounds on Length of Boolean Formulas.

Michael J. Fischer, Albert R. Meyer, Mike Paterson

SIAM J. Comput., 1982

Axiomatic Definitions of Programming Languages: A Theoretical Assessment.

Albert R. Meyer, Joseph Y. Halpern

J. ACM, 1982

Axiomatic Definability and Completeness for Recursive Programs.

Albert R. Meyer, John C. Mitchell

Proceedings of the Conference Record of the Ninth Annual ACM Symposium on Principles of Programming Languages, 1982

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

Definability in Dynamic Logic.

Albert R. Meyer, Rohit Parikh

J. Comput. Syst. Sci., 1981

The Complexity of the Finite Containment Problem for Petri Nets.

Ernst W. Mayr, Albert R. Meyer

J. ACM, 1981

Axiomatic Definitions of Programming Languages, II.

Joseph Y. Halpern, Albert R. Meyer

Proceedings of the Conference Record of the Eighth Annual ACM Symposium on Principles of Programming Languages, 1981

A Note On Equivalences Among Logics of Programs.

Albert R. Meyer, Jerzy Tiuryn

Proceedings of the Logics of Programs, Workshop, Yorktown Heights, New York, USA, May 1981, 1981

The Deducibility Problem in Propositional Dynamic Logic.

Albert R. Meyer, Robert S. Streett, Grazyna Mirkowska

Proceedings of the Automata, 1981

1980

On Time-Space Classes and their Relation to the Theory of Real Addition.

Anna R. Bruss, Albert R. Meyer

Theor. Comput. Sci., 1980

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

1979

Can Partial Correctness Assertions Specify Programming Language Semantics?.

Albert R. Meyer, Irene Greif

Proceedings of the Theoretical Computer Science, 1979

On the Expressive Power of Dynamic Logic (Preliminary Report)

Albert R. Meyer, Karl Winklmann

Proceedings of the 11h Annual ACM Symposium on Theory of Computing, April 30, 1979

Specifying Programming Language Semantics.

Irene Greif, Albert R. Meyer

Proceedings of the Conference Record of the Sixth Annual ACM Symposium on Principles of Programming Languages, 1979

1978

Separating Nondeterministic Time Complexity Classes.

Joel I. Seiferas, Michael J. Fischer, Albert R. Meyer

J. ACM, 1978

Coping with Errors in Binary Search Procedures (Preliminary Report)

Ronald L. Rivest, Albert R. Meyer, Daniel J. Kleitman, Karl Winklmann, Joel Spencer

Proceedings of the 10th Annual ACM Symposium on Theory of Computing, 1978

On Time-Space Classes and Their Relation to the Theory of Real Addition

Anni R. Bruss, Albert R. Meyer

Proceedings of the 10th Annual ACM Symposium on Theory of Computing, 1978

1977

Computability and Completeness in Logics of Programs (Preliminary Report)

David Harel, Albert R. Meyer, Vaughan R. Pratt

Proceedings of the 9th Annual ACM Symposium on Theory of Computing, 1977

1976

Exponential Space Complete Problems for Petri Nets and Commutative Semigroups: Preliminary Report

E. Cardoza, Richard J. Lipton, Albert R. Meyer

Proceedings of the 8th Annual ACM Symposium on Theory of Computing, 1976

A Note on the Average Time to Compute Transitive Closures.

Peter A. Bloniarz, Michael J. Fischer, Albert R. Meyer

Proceedings of the Third International Colloquium on Automata, 1976

1975

Lower Bounds on the Size of Boolean Formulas: Preliminary Report

Michael J. Fischer, Albert R. Meyer, Mike Paterson

Proceedings of the 7th Annual ACM Symposium on Theory of Computing, 1975

1974

Honest Bounds for Complexity Classes of Recursive Functions.

Robert Moll, Albert R. Meyer

J. Symb. Log., 1974

1973

A characterization of log-space computable functions.

John Lind, Albert R. Meyer

SIGACT News, 1973

A note on disjunctive form tautologies.

M. Bauer, D. Brand, Michael J. Fischer, Albert R. Meyer, Mike Paterson

SIGACT News, 1973

Word Problems Requiring Exponential Time: Preliminary Report

Larry J. Stockmeyer, Albert R. Meyer

Proceedings of the 5th Annual ACM Symposium on Theory of Computing, April 30, 1973

Sets that Don't Help

Nancy A. Lynch, Albert R. Meyer, Michael J. Fischer

Proceedings of the 5th Annual ACM Symposium on Theory of Computing, April 30, 1973

Refinements of the Nondeterministic Time and Space Hierarchies

Joel I. Seiferas, Michael J. Fischer, Albert R. Meyer

Proceedings of the 14th Annual Symposium on Switching and Automata Theory, 1973

1972

Program Size in Restricted Programming Languages

Albert R. Meyer

Inf. Control., November, 1972

Computational Speed-Up by Effective Operators.

Albert R. Meyer, Patrick C. Fischer

J. Symb. Log., 1972

Real-Time Simulation of Multihead Tape Units.

Patrick C. Fischer, Albert R. Meyer, Arnold L. Rosenberg

J. ACM, 1972

Program Size and Economy of Descriptions: Preliminary Report

Albert R. Meyer, A. Bagchi

Proceedings of the 4th Annual ACM Symposium on Theory of Computing, 1972

The Equivalence Problem for Regular Expressions with Squaring Requires Exponential Space

Albert R. Meyer, Larry J. Stockmeyer

Proceedings of the 13th Annual Symposium on Switching and Automata Theory, 1972

1971

Economy of Description by Automata, Grammars, and Formal Systems

Albert R. Meyer, Michael J. Fischer

Proceedings of the 12th Annual Symposium on Switching and Automata Theory, 1971

Boolean Matrix Multiplication and Transitive Closure

Michael J. Fischer, Albert R. Meyer

Proceedings of the 12th Annual Symposium on Switching and Automata Theory, 1971

1970

Time-Restricted Sequence Generation.

Patrick C. Fischer, Albert R. Meyer, Arnold L. Rosenberg

J. Comput. Syst. Sci., 1970

1969

Sequential Boolean Equations.

Shimon Even, Albert R. Meyer

IEEE Trans. Computers, 1969

Remarks on Algebraic Decomposition of Automata.

Albert R. Meyer, C. Thompson

Math. Syst. Theory, 1969

A Note on Star-Free Events.

Albert R. Meyer

J. ACM, 1969

Classes of Computable Functions Defined by Bounds on Computation: Preliminary Report

Edward M. McCreight, Albert R. Meyer

Proceedings of the 1st Annual ACM Symposium on Theory of Computing, 1969

1968

Counter Machines and Counter Languages.

Patrick C. Fischer, Albert R. Meyer, Arnold L. Rosenberg

Math. Syst. Theory, 1968

On Computational Speed-Up

Albert R. Meyer, Patrick C. Fischer

Proceedings of the 9th Annual Symposium on Switching and Automata Theory, 1968

1967

Turing Machines with Several Read-Write Heads (Preliminary Report)

Albert R. Meyer, Arnold L. Rosenberg, Patrick C. Fischer

Proceedings of the 8th Annual Symposium on Switching and Automata Theory, 1967

Real Time Counter Machines (Preliminary Version)

Patrick C. Fischer, Albert R. Meyer, Arnold L. Rosenberg

Proceedings of the 8th Annual Symposium on Switching and Automata Theory, 1967

The complexity of loop programs.

Albert R. Meyer, Dennis M. Ritchie

Proceedings of the 22nd national conference, 1967

1966

Test for Planarity of a Circuit Given by an Expression.

Shimon Even, Albert R. Meyer

IEEE Trans. Electron. Comput., 1966