Finding Heavy Hitters from Lossy or Noisy Data. - Lucia Batman; Russell Impagliazzo; Cody Murray; Ramamohan Paturi (APPROX-RANDOM, 2013)

On the (Non) NP-Hardness of Computing Circuit Complexity. - Cody Murray; Ryan Williams 001 (Electron. Colloquium Comput. Complex., 2014)

Easiness Amplification and Uniform Circuit Lower Bounds. - Cody D. Murray; R. Ryan Williams (CCC, 2017)

Circuit Lower Bounds for Nondeterministic Quasi-Polytime: An Easy Witness Lemma for NP and NQP. - Cody Murray; R. Ryan Williams (Electron. Colloquium Comput. Complex., 2017)

Connections between circuit analysis problems and circuit lower bounds. - Cody Murray (2018)

Weak lower bounds on resource-bounded compression imply strong separations of complexity classes. - Dylan M. McKay; Cody D. Murray; R. Ryan Williams (STOC, 2019)

Relations and Equivalences Between Circuit Lower Bounds and Karp-Lipton Theorems. - Lijie Chen 001; Dylan M. McKay; Cody Murray; R. Ryan Williams (Electron. Colloquium Comput. Complex., 2019)

Circuit Lower Bounds for Nondeterministic Quasi-polytime from a New Easy Witness Lemma. - Cody D. Murray; R. Ryan Williams (SIAM J. Comput., 2020)