Hypothesis testing with finite memory in finite time (Corresp.). - Richard A. Flower; Martin E. Hellman (IEEE Trans. Inf. Theory, 1972)

The Complexity of Some Simple Retrieval Problems. - Peter Elias 001; Richard A. Flower (J. ACM, 1975)

Communications via updates of shared memory. - Richard A. Flower (IEEE Trans. Inf. Theory, 1982)