Computational Complexity of Probabilistic Turing Machines - John T. Gill III (STOC, 1974)

On Subcreative Sets and S-Reducibility. - John T. Gill III; Paul H. Morris (J. Symb. Log., 1974)

Quantization with Joint Entropy/Memory Constraints. - Robert M. Gray; John T. Gill III (DCC, 2006)

Lagrangian Vector Quantization With Combined Entropy and Codebook Size Constraints. - Robert M. Gray; Tamás Linder; John T. Gill III (IEEE Trans. Inf. Theory, 2008)

Low-complexity non-uniform demand multicast network coding problems. - Joseph C. Koo; John T. Gill III (Allerton, 2009)

Delay-rate tradeoff for ergodic interference alignment in the Gaussian case. - Joseph C. Koo; William Wu; John T. Gill III (Allerton, 2010)

Twenty Questions Games Always End With Yes - John T. Gill III; William Wu (CoRR, 2010)

Scalable constructions of fractional repetition codes in distributed storage systems. - Joseph C. Koo; John T. Gill III (Allerton, 2011)

Fused Fibonacci-like (p, q) sequences with compression and barcoding applications. - Sarkis Agaian; Jose Garcia; Salahodeen Abdul-Kafi; John T. Gill III (Multimedia on Mobile Devices / Multimedia Content Access: Algorithms and Systems, 2012)