| 1997 | COLT | FINite Learning Capabilities and Their Limits. | Robert P. Daley, Bala Kalyanasundaram |
| 1993 | ALT | Use of Reduction Arguments in Determining Popperian FIN-Type Learning Capabilities. | Robert P. Daley, Bala Kalyanasundaram |
| 1993 | COLT | Capabilities of Probabilistic Learners with Bounded Mind Changes. | Robert P. Daley, Bala Kalyanasundaram |
| 1993 | COLT | Capabilities of fallible FINite Learning. | Robert P. Daley, Bala Kalyanasundaram, Mahendran Velauthapillai |
| 1992 | COLT | Breaking the Probability | Robert P. Daley, Bala Kalyanasundaram, Mahendran Velauthapillai |
| 1992 | MFCS | Probabilistic and Pluralistic Learners with Mind Changes. | Robert P. Daley, Bala Kalyanasundaram |
| 1991 | COLT | Relations Between Probabilistic and Team One-Shot Learners (Extended Abstract). | Robert P. Daley, Leonard Pitt, Mahendran Velauthapillai, Todd Will |
| 1988 | COLT | Transformation of Probabilistic Learning Strategies into Deterministic Learning Strategies. | Robert P. Daley |
| 1984 | MFCS | On the Complexity of Inductive Inference (Preliminary Report). | Robert P. Daley, Carl H. Smith |
| 1981 | FCT | On the Error Correcting Power of Pluralism in Inductive Inference. | Robert P. Daley |
| 1981 | MFCS | Retraceability, Repleteness and Busy Beaver Sets. | Robert P. Daley |
| 1979 | MFCS | On the Simplification of Constructions in Degrees of Unsolvability via Computational Complexity. | Robert P. Daley |
| 1974 | FOCS | Non-Complex Sequences: Characterizations and Examples | Robert P. Daley |
| 1973 | MFCS | The Process Complexity and the Understanding of Sequences. | Robert P. Daley |