Autoreducibility of NP-Complete Sets. - John M. Hitchcock; Hadi Shafei (Electron. Colloquium Comput. Complex., 2016)

Autoreducibility of NP-Complete Sets under Strong Hypotheses. - John M. Hitchcock; Hadi Shafei (Comput. Complex., 2018)

Nonuniform Reductions and NP-Completeness. - John M. Hitchcock; Hadi Shafei (Electron. Colloquium Comput. Complex., 2018)

Polynomial-Time Random Oracles and Separating Complexity Classes. - John M. Hitchcock; Adewale Sekoni; Hadi Shafei (Electron. Colloquium Comput. Complex., 2018)

Review of Kolmogorov Complexity and Algorithmic Randomness by A. Shen, V. A. Uspensky, and N. Vereshchagin. - Hadi Shafei (SIGACT News, 2019)

Random Permutations in Computational Complexity. - John M. Hitchcock; Adewale Sekoni; Hadi Shafei (MFCS, 2025)

Counting Martingales for Measure and Dimension in Complexity Classes. - John M. Hitchcock; Adewale Sekoni; Hadi Shafei (Electron. Colloquium Comput. Complex., 2025)