 | Li, M. |
 |
 | Kearns, M. -- On the learnability of Boolean formulae - 1987 |
| Kearns, M. -- Robust learning in polynomial time: possibilities and limitations - 1987 |
| Kearns, M. -- Recent Results on Boolean Concept Learning - June 1987 |
| Li, M. -- On the learnability of finite automata - 1988 |
| Gao, Q. -- An application of minimum description length principle to online r ecognition of handprinted alphanumerals - 1989 |
| Li, M. -- A theory of learning simple concepts under simple distributions and average case complexity for the universal distribution - 1989 |
| Li, M. -- Towards a DNA sequencing theory learning a string - 1990 |
| Li, M. -- Learning simple concepts under simple distributions - 1991 |
| Li, M. -- Inductive reasoning and Kolmogorov complexity - 1992 |
| Li, M. -- An Introduction to Kolmogorov Complexity and Its Applications - 1993 |
| Jiang, T. -- On the complexity of learning strings and sequences - 1993 |
| Kearns, M. -- Learning in the presence of malicious errors - 1993 |
|
