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