Robert N. Moll
List of publications from the
| 2000 |
|---|
| 13 | | Robert Moll,
Theodore J. Perkins,
Andrew G. Barto:
Machine Learning for Subproblem Selection.
ICML 2000: 615-622 |
| 1998 |
|---|
| 12 | EE | 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 |
|---|
| 11 | | Ugo A. Buy,
Robert Moll:
A Specification-Based Approach to Concurrency Analysis.
Autom. Softw. Eng. 2(4): 265-309 (1995) |
| 1994 |
|---|
| 10 | | Mahesh Girkar,
Robert Moll:
New Results on the Analysis of Concurrent Systems with an Infinite Number of Processes.
CONCUR 1994: 65-80 |
| 1993 |
|---|
| 9 | | Mahesh Girkar,
Robert Moll:
Vector Sequence Analysis and Full Weak Safety for Concurrent Systems.
FCT 1993: 256-265 |
| 1990 |
|---|
| 8 | | Ugo A. Buy,
Robert Moll:
A Proof Lattice-Based Technique for Analyzing Liveness of Resource Controllers.
CAV 1990: 292-301 |
| 7 | | Bruce MacLeod,
Robert Moll:
A Toolkit for Vehicle Routing.
ICSI 1990: 426-431 |
| 1988 |
|---|
| 6 | | Robert N. Moll,
Michael A. Arbib,
A. J. Kfoury:
An Introduction to Formal Language Theory
Springer 1988 |
| 1981 |
|---|
| 5 | | Balakrishnan Krishnamurthy,
Robert N. Moll:
Examples of Hard Tautologies in the Propositional Calculus
STOC 1981: 28-37 |
| 1979 |
|---|
| 4 | | Balakrishnan Krishnamurthy,
Robert N. Moll:
On the Number of Affine Families of Boolean Functions
Information and Control 43(3): 327-337 (1979) |
| 1976 |
|---|
| 3 | | Robert Moll:
An Operator Embedding Theorem for Complexity Classes of Recursive Functions.
Theor. Comput. Sci. 1(3): 193-198 (1976) |
| 1974 |
|---|
| 2 | | Robert Moll,
Albert R. Meyer:
Honest Bounds for Complexity Classes of Recursive Functions.
J. Symb. Log. 39(1): 127-138 (1974) |
| 1972 |
|---|
| 1 | | Albert R. Meyer,
Robert Moll:
Honest Bounds for Complexity Classes of Recursive Functions
FOCS 1972: 61-66 |
