Please note: This is a beta version of the new dblp website.
You can find the classic dblp view of this page here.
You can find the classic dblp view of this page here.
Robert Moll
Robert N. Moll
2000 – 2009
- 2000
[c9]Robert Moll, Theodore J. Perkins, Andrew G. Barto: Machine Learning for Subproblem Selection. ICML 2000: 615-622
1990 – 1999
- 1998
- [c8]Robert Moll, Andrew G. Barto, Theodore J. Perkins, Richard S. Sutton: Learning Instance-Independent Value Functions to Enhance Local Search. NIPS 1998: 1017-1023
- 1995
- [j4]Ugo A. Buy, Robert Moll: A Specification-Based Approach to Concurrency Analysis. Autom. Softw. Eng. 2(4): 265-309 (1995)
- 1994
- [c7]Mahesh Girkar, Robert Moll: New Results on the Analysis of Concurrent Systems with an Infinite Number of Processes. CONCUR 1994: 65-80
- 1993
- [c6]Mahesh Girkar, Robert Moll: Vector Sequence Analysis and Full Weak Safety for Concurrent Systems. FCT 1993: 256-265
- 1990
- [c5]Ugo A. Buy, Robert Moll: A Proof Lattice-Based Technique for Analyzing Liveness of Resource Controllers. CAV 1990: 292-301
- [c4]
1980 – 1989
- 1988
- [b2]Robert N. Moll, Michael A. Arbib, A. J. Kfoury: An Introduction to Formal Language Theory. Springer 1988, ISBN 0-387-96698-6
- 1981
- [b1]Michael A. Arbib, Assaf J. Kfoury, Robert N. Moll: A basis for theoretical computer science. Texts and monographs in computer science, Springer 1981, ISBN 978-0-387-90573-0, pp. I-VIII, 1-220
- [c3]Balakrishnan Krishnamurthy, Robert N. Moll: Examples of Hard Tautologies in the Propositional Calculus. STOC 1981: 28-37
1970 – 1979
- 1979
- [j3]Balakrishnan Krishnamurthy, Robert N. Moll: On the Number of Affine Families of Boolean Functions. Information and Control 43(3): 327-337 (1979)
- [c2]
- 1976
- [j2]Robert Moll: An Operator Embedding Theorem for Complexity Classes of Recursive Functions. Theor. Comput. Sci. 1(3): 193-198 (1976)
- 1974
- [j1]Robert Moll, Albert R. Meyer: Honest Bounds for Complexity Classes of Recursive Functions. J. Symb. Log. 39(1): 127-138 (1974)
- 1972
- [c1]Albert R. Meyer, Robert Moll: Honest Bounds for Complexity Classes of Recursive Functions. SWAT (FOCS) 1972: 61-66
Coauthor Index
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2013-02-06 21:03 CET by the dblp team