The SCEAS System
Navigation Menu
Introduction
Collection Based
Clustering
Ranking
Paper Based
Journals
Conferences
DB Status
Statistics
Search

Search the dblp DataBase

Title:
Author:
Albert R. Meyer: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Larry J. Stockmeyer, Albert R. Meyer
    Word Problems Requiring Exponential Time: Preliminary Report [Citation Graph (5, 0)][DBLP]
    STOC, 1973, pp:1-9 [Conf]
  2. Peter A. Bloniarz, Michael J. Fischer, Albert R. Meyer
    A Note on the Average Time to Compute Transitive Closures. [Citation Graph (3, 0)][DBLP]
    ICALP, 1976, pp:425-434 [Conf]
  3. Michael J. Fischer, Albert R. Meyer
    Boolean Matrix Multiplication and Transitive Closure [Citation Graph (1, 0)][DBLP]
    FOCS, 1971, pp:129-131 [Conf]
  4. Irene Greif, Albert R. Meyer
    Specifying Programming Language Semantics. [Citation Graph (1, 0)][DBLP]
    POPL, 1979, pp:180-189 [Conf]
  5. Albert R. Meyer, Mark B. Reinhold
    ``Type'' Is Not A Type. [Citation Graph (1, 0)][DBLP]
    POPL, 1986, pp:287-295 [Conf]
  6. Anni R. Bruss, Albert R. Meyer
    On Time-Space Classes and Their Relation to the Theory of Real Addition [Citation Graph (1, 0)][DBLP]
    STOC, 1978, pp:233-239 [Conf]
  7. Albert R. Meyer
    What is a Model of the Lambda Calculus? [Citation Graph (1, 0)][DBLP]
    Information and Control, 1982, v:52, n:1, pp:87-122 [Journal]
  8. Anna R. Bruss, Albert R. Meyer
    On Time-Space Classes and their Relation to the Theory of Real Addition. [Citation Graph (1, 0)][DBLP]
    Theor. Comput. Sci., 1980, v:11, n:, pp:59-69 [Journal]
  9. Irene Greif, Albert R. Meyer
    Specifying the Semantics of while Programs: A Tutorial and Critique of a Paper by Hoare and Lauer. [Citation Graph (1, 0)][DBLP]
    ACM Trans. Program. Lang. Syst., 1981, v:3, n:4, pp:484-507 [Journal]
  10. Lalita Jategaonkar, Albert R. Meyer
    Testing Equivalence for Petri Nets with Action Refinement: Preliminary Report. [Citation Graph (0, 0)][DBLP]
    CONCUR, 1992, pp:17-31 [Conf]
  11. Bard Bloom, Albert R. Meyer
    A Remark on Bisimulation Between Probabilistic Processes. [Citation Graph (0, 0)][DBLP]
    Logic at Botik, 1989, pp:26-40 [Conf]
  12. Patrick C. Fischer, Albert R. Meyer, Arnold L. Rosenberg
    Real Time Counter Machines (Preliminary Version) [Citation Graph (0, 0)][DBLP]
    FOCS, 1967, pp:148-154 [Conf]
  13. Albert R. Meyer, Patrick C. Fischer
    On Computational Speed-Up [Citation Graph (0, 0)][DBLP]
    FOCS, 1968, pp:351-355 [Conf]
  14. Albert R. Meyer, Michael J. Fischer
    Economy of Description by Automata, Grammars, and Formal Systems [Citation Graph (0, 0)][DBLP]
    FOCS, 1971, pp:188-191 [Conf]
  15. Albert R. Meyer, Robert Moll
    Honest Bounds for Complexity Classes of Recursive Functions [Citation Graph (0, 0)][DBLP]
    FOCS, 1972, pp:61-66 [Conf]
  16. Albert R. Meyer, Arnold L. Rosenberg, Patrick C. Fischer
    Turing Machines with Several Read-Write Heads (Preliminary Report) [Citation Graph (0, 0)][DBLP]
    FOCS, 1967, pp:117-127 [Conf]
  17. Albert R. Meyer, Larry J. Stockmeyer
    The Equivalence Problem for Regular Expressions with Squaring Requires Exponential Space [Citation Graph (0, 0)][DBLP]
    FOCS, 1972, pp:125-129 [Conf]
  18. Joel I. Seiferas, Michael J. Fischer, Albert R. Meyer
    Refinements of the Nondeterministic Time and Space Hierarchies [Citation Graph (0, 0)][DBLP]
    FOCS, 1973, pp:130-137 [Conf]
  19. Lalita Jategaonkar, Albert R. Meyer
    Deciding True Concurrency Equivalences on Finite Sate Nets (Preliminary Report). [Citation Graph (0, 0)][DBLP]
    ICALP, 1993, pp:519-531 [Conf]
  20. Albert R. Meyer, Robert S. Streett, Grazyna Mirkowska
    The Deducibility Problem in Propositional Dynamic Logic. [Citation Graph (0, 0)][DBLP]
    ICALP, 1981, pp:238-248 [Conf]
  21. Albert R. Meyer
    Understanding ALGOL: The View of a Recent Convert to Denotational Semantics. [Citation Graph (0, 0)][DBLP]
    IFIP Congress, 1983, pp:951-961 [Conf]
  22. Albert R. Meyer, Jon G. Riecke
    Continuations May be Unreasonable. [Citation Graph (0, 0)][DBLP]
    LISP and Functional Programming, 1988, pp:63-71 [Conf]
  23. Val Tannen, Albert R. Meyer
    Polymorphism is conservative over simple types (Preliminary Report) [Citation Graph (0, 0)][DBLP]
    LICS, 1987, pp:7-17 [Conf]
  24. Stavros S. Cosmadakis, Albert R. Meyer, Jon G. Riecke
    Completeness for typed lazy inequalities [Citation Graph (0, 0)][DBLP]
    LICS, 1990, pp:312-320 [Conf]
  25. Lalita Jategaonkar, Albert R. Meyer
    Self-Synchronization of Concurrent Processes (Preliminary Report) [Citation Graph (0, 0)][DBLP]
    LICS, 1993, pp:409-417 [Conf]
  26. Albert R. Meyer
    Floyd-Hoare Logic Defines Semantics: Preliminary Version [Citation Graph (0, 0)][DBLP]
    LICS, 1986, pp:44-48 [Conf]
  27. Albert R. Meyer
    Semantical Paradigms: Notes for an Invited Lecture, with Two Appendices by Stavros S. Cosmadakis [Citation Graph (0, 0)][DBLP]
    LICS, 1988, pp:236-253 [Conf]
  28. Val Breazu-Tannen, Albert R. Meyer
    Lambda Calculus with Constrained Types (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    Logic of Programs, 1985, pp:23-40 [Conf]
  29. Boris A. Trakhtenbrot, Joseph Y. Halpern, Albert R. Meyer
    From Denotational to Operational and Axiomatic Semantics for ALGOL-like Languages: an Overview. [Citation Graph (0, 0)][DBLP]
    Logic of Programs, 1983, pp:474-500 [Conf]
  30. Albert R. Meyer, Robert S. Streett, Grazyna Mirkowska
    The Deducibility Problem in Propositional Dynamic Logic. [Citation Graph (0, 0)][DBLP]
    Logic of Programs, 1979, pp:12-22 [Conf]
  31. Albert R. Meyer, Jerzy Tiuryn
    A Note On Equivalences Among Logics of Programs. [Citation Graph (0, 0)][DBLP]
    Logic of Programs, 1981, pp:282-299 [Conf]
  32. Albert R. Meyer, Mitchell Wand
    Continuation Semantics in Typed Lambda-Calculi (Summary). [Citation Graph (0, 0)][DBLP]
    Logic of Programs, 1985, pp:219-224 [Conf]
  33. John C. Mitchell, Albert R. Meyer
    Second-Order Logical Relations (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    Logic of Programs, 1985, pp:225-236 [Conf]
  34. Bard Bloom, Sorin Istrail, Albert R. Meyer
    Bisimulation Can't Be Traced. [Citation Graph (0, 0)][DBLP]
    POPL, 1988, pp:229-239 [Conf]
  35. Joseph Y. Halpern, Albert R. Meyer
    Axiomatic Definitions of Programming Languages, II. [Citation Graph (0, 0)][DBLP]
    POPL, 1981, pp:139-148 [Conf]
  36. Joseph Y. Halpern, Albert R. Meyer, Boris A. Trakhtenbrot
    The Semantics of Local Storage, or What Makes the Free-List Free? [Citation Graph (0, 0)][DBLP]
    POPL, 1984, pp:245-257 [Conf]
  37. Albert R. Meyer, Joseph Y. Halpern
    Axiomatic Definitions of Programming Languages: A Theoretical Assessment. [Citation Graph (0, 0)][DBLP]
    POPL, 1980, pp:203-212 [Conf]
  38. Albert R. Meyer, John C. Mitchell
    Axiomatic Definability and Completeness for Recursive Programs. [Citation Graph (0, 0)][DBLP]
    POPL, 1982, pp:337-346 [Conf]
  39. Albert R. Meyer, John C. Mitchell, Eugenio Moggi, Richard Statman
    Empty Types in Polymorphic Lambda Calculus. [Citation Graph (0, 0)][DBLP]
    POPL, 1987, pp:253-262 [Conf]
  40. Albert R. Meyer, Kurt Sieber
    Towards Fully Abstract Semantics for Local Variables. [Citation Graph (0, 0)][DBLP]
    POPL, 1988, pp:191-203 [Conf]
  41. Val Tannen, Albert R. Meyer
    Computable Values Can Be Classical. [Citation Graph (0, 0)][DBLP]
    POPL, 1987, pp:238-245 [Conf]
  42. Kim B. Bruce, Albert R. Meyer
    The Semantics of Second Order Polymorphic Lambda Calculus. [Citation Graph (0, 0)][DBLP]
    Semantics of Data Types, 1984, pp:131-144 [Conf]
  43. Albert R. Meyer
    Concurrent Process Equivalences: Some Decision Problems (Abstract). [Citation Graph (0, 0)][DBLP]
    STACS, 1995, pp:349- [Conf]
  44. E. Cardoza, Richard J. Lipton, Albert R. Meyer
    Exponential Space Complete Problems for Petri Nets and Commutative Semigroups: Preliminary Report [Citation Graph (0, 0)][DBLP]
    STOC, 1976, pp:50-54 [Conf]
  45. Ashok K. Chandra, Joseph Y. Halpern, Albert R. Meyer, Rohit Parikh
    Equations between Regular Terms and an Application to Process Logic [Citation Graph (0, 0)][DBLP]
    STOC, 1981, pp:384-390 [Conf]
  46. Michael J. Fischer, Albert R. Meyer, Mike Paterson
    Lower Bounds on the Size of Boolean Formulas: Preliminary Report [Citation Graph (0, 0)][DBLP]
    STOC, 1975, pp:37-44 [Conf]
  47. David Harel, Albert R. Meyer, Vaughan R. Pratt
    Computability and Completeness in Logics of Programs (Preliminary Report) [Citation Graph (0, 0)][DBLP]
    STOC, 1977, pp:261-268 [Conf]
  48. Nancy A. Lynch, Albert R. Meyer, Michael J. Fischer
    Sets that Don't Help [Citation Graph (0, 0)][DBLP]
    STOC, 1973, pp:130-134 [Conf]
  49. Edward M. McCreight, Albert R. Meyer
    Classes of Computable Functions Defined by Bounds on Computation: Preliminary Report [Citation Graph (0, 0)][DBLP]
    STOC, 1969, pp:79-88 [Conf]
  50. Albert R. Meyer, A. Bagchi
    Program Size and Economy of Descriptions: Preliminary Report [Citation Graph (0, 0)][DBLP]
    STOC, 1972, pp:183-186 [Conf]
  51. Albert R. Meyer, Rohit Parikh
    Definability in Dynamic Logic [Citation Graph (0, 0)][DBLP]
    STOC, 1980, pp:1-7 [Conf]
  52. Albert R. Meyer, Karl Winklmann
    On the Expressive Power of Dynamic Logic (Preliminary Report) [Citation Graph (0, 0)][DBLP]
    STOC, 1979, pp:167-175 [Conf]
  53. Ronald L. Rivest, Albert R. Meyer, Daniel J. Kleitman, Karl Winklmann, Joel Spencer
    Coping with Errors in Binary Search Procedures (Preliminary Report) [Citation Graph (0, 0)][DBLP]
    STOC, 1978, pp:227-232 [Conf]
  54. Albert R. Meyer
    Observing Truly Concurrent Processes. [Citation Graph (0, 0)][DBLP]
    TACS, 1994, pp:886- [Conf]
  55. Trevor Jim, Albert R. Meyer
    Full Abstraction and the Context Lemma. [Citation Graph (0, 0)][DBLP]
    TACS, 1991, pp:131-151 [Conf]
  56. Albert R. Meyer, Irene Greif
    Can Partial Correctness Assertions Specify Programming Language Semantics?. [Citation Graph (0, 0)][DBLP]
    Theoretical Computer Science, 1979, pp:25-26 [Conf]
  57. Joel I. Seiferas, Albert R. Meyer
    Characterizations of Realizable Space Complexities. [Citation Graph (0, 0)][DBLP]
    Ann. Pure Appl. Logic, 1995, v:73, n:2, pp:171-190 [Journal]
  58. Val Tannen, Albert R. Meyer
    Conservativity of Equational Theories in Typed Lambda Calculi. [Citation Graph (0, 0)][DBLP]
    Fundam. Inform., 1993, v:19, n:1/2, pp:1-49 [Journal]
  59. Kim B. Bruce, Albert R. Meyer, John C. Mitchell
    The Semantics of Second-Order Lambda Calculus [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 1990, v:85, n:1, pp:76-134 [Journal]
  60. Albert R. Meyer
    Program Size in Restricted Programming Languages [Citation Graph (0, 0)][DBLP]
    Information and Control, 1972, v:21, n:4, pp:382-394 [Journal]
  61. Albert R. Meyer, John C. Mitchell
    Termination Assertions for Recursive Programs: Completeness and Axiomatic Definability [Citation Graph (0, 0)][DBLP]
    Information and Control, 1983, v:56, n:1/2, pp:112-138 [Journal]
  62. A. Prasad Sistla, Edmund M. Clarke, Nissim Francez, Albert R. Meyer
    Can Message Buffers Be Axiomatized in Linear Temporal Logic? [Citation Graph (0, 0)][DBLP]
    Information and Control, 1984, v:63, n:1/2, pp:88-112 [Journal]
  63. Bard Bloom, Sorin Istrail, Albert R. Meyer
    Bisimulation Can't be Traced. [Citation Graph (0, 0)][DBLP]
    J. ACM, 1995, v:42, n:1, pp:232-268 [Journal]
  64. Patrick C. Fischer, Albert R. Meyer, Arnold L. Rosenberg
    Real-Time Simulation of Multihead Tape Units. [Citation Graph (0, 0)][DBLP]
    J. ACM, 1972, v:19, n:4, pp:590-607 [Journal]
  65. Ernst W. Mayr, Albert R. Meyer
    The Complexity of the Finite Containment Problem for Petri Nets. [Citation Graph (0, 0)][DBLP]
    J. ACM, 1981, v:28, n:3, pp:561-576 [Journal]
  66. Albert R. Meyer
    A Note on Star-Free Events. [Citation Graph (0, 0)][DBLP]
    J. ACM, 1969, v:16, n:2, pp:220-225 [Journal]
  67. Albert R. Meyer, Joseph Y. Halpern
    Axiomatic Definitions of Programming Languages: A Theoretical Assessment. [Citation Graph (0, 0)][DBLP]
    J. ACM, 1982, v:29, n:2, pp:555-576 [Journal]
  68. Joel I. Seiferas, Michael J. Fischer, Albert R. Meyer
    Separating Nondeterministic Time Complexity Classes. [Citation Graph (0, 0)][DBLP]
    J. ACM, 1978, v:25, n:1, pp:146-167 [Journal]
  69. Larry J. Stockmeyer, Albert R. Meyer
    Cosmological lower bound on the circuit complexity of a small problem in logic. [Citation Graph (0, 0)][DBLP]
    J. ACM, 2002, v:49, n:6, pp:753-784 [Journal]
  70. Albert R. Meyer, Alexander Moshe Rabinovich
    Valid Identity Problem for Shuffle Regular Expressions. [Citation Graph (0, 0)][DBLP]
    Journal of Automata, Languages and Combinatorics, 2002, v:7, n:1, pp:109-125 [Journal]
  71. Patrick C. Fischer, Albert R. Meyer, Arnold L. Rosenberg
    Time-Restricted Sequence Generation. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1970, v:4, n:1, pp:50-73 [Journal]
  72. Albert R. Meyer, Rohit Parikh
    Definability in Dynamic Logic. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1981, v:23, n:2, pp:279-298 [Journal]
  73. Albert R. Meyer, Jerzy Tiuryn
    Equivalences among Logics of Programs. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1984, v:29, n:2, pp:160-170 [Journal]
  74. Ronald L. Rivest, Albert R. Meyer, Daniel J. Kleitman, Karl Winklmann, Joel Spencer
    Coping with Errors in Binary Search Procedures. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1980, v:20, n:3, pp:396-404 [Journal]
  75. Albert R. Meyer, Patrick C. Fischer
    Computational Speed-Up by Effective Operators. [Citation Graph (0, 0)][DBLP]
    J. Symb. Log., 1972, v:37, n:1, pp:55-68 [Journal]
  76. Robert Moll, Albert R. Meyer
    Honest Bounds for Complexity Classes of Recursive Functions. [Citation Graph (0, 0)][DBLP]
    J. Symb. Log., 1974, v:39, n:1, pp:127-138 [Journal]
  77. Patrick C. Fischer, Albert R. Meyer, Arnold L. Rosenberg
    Counter Machines and Counter Languages. [Citation Graph (0, 0)][DBLP]
    Mathematical Systems Theory, 1968, v:2, n:3, pp:265-283 [Journal]
  78. Joseph Y. Halpern, Michael C. Loui, Albert R. Meyer, Daniel Weise
    On Time versus Space III. [Citation Graph (0, 0)][DBLP]
    Mathematical Systems Theory, 1986, v:19, n:1, pp:13-28 [Journal]
  79. Albert R. Meyer, C. Thompson
    Remarks on Algebraic Decomposition of Automata. [Citation Graph (0, 0)][DBLP]
    Mathematical Systems Theory, 1969, v:3, n:2, pp:110-118 [Journal]
  80. Michael J. Fischer, Albert R. Meyer, Mike Paterson
    Omega(n log n) Lower Bounds on Length of Boolean Formulas. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1982, v:11, n:3, pp:416-427 [Journal]
  81. Trevor Jim, Albert R. Meyer
    Full Abstraction and the Context Lemma. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1996, v:25, n:3, pp:663-696 [Journal]
  82. Rohit Parikh, Ashok K. Chandra, Joseph Y. Halpern, Albert R. Meyer
    Equations Between Regular Terms and an Application to Process Logic. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1985, v:14, n:4, pp:935-942 [Journal]
  83. Bard Bloom, Albert R. Meyer
    Experimenting with Process Equivalence. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1992, v:101, n:2, pp:223-237 [Journal]
  84. Lalita Jategaonkar, Albert R. Meyer
    Deciding True Concurrency Equivalences on Safe, Finite Nets. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1996, v:154, n:1, pp:107-143 [Journal]
  85. Albert R. Meyer, Karl Winklmann
    Expressing Program Looping in Regular Dynamic Logic. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1982, v:18, n:, pp:301-323 [Journal]

  86. Reminiscences. [Citation Graph (, )][DBLP]


Search in 0.005secs, Finished in 0.455secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
Introduction Collection Based Clustering Ranking Paper Based Journals Conferences DB Status Statistics Search
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002