Albert R. Meyer

94 papers A* 30A 1B 1Journal 36Unranked 24

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