A Counterexample to Polynomially Bounded Realizability of Basic Arithmetic. - Mohammad Ardeshir; Erfan Khaniki; Mohsen Shahriari (Notre Dame J. Formal Log., 2019)

On Proof complexity of Resolution over Polynomial Calculus. - Erfan Khaniki (Electron. Colloquium Comput. Complex., 2020)

Nisan-Wigderson generators in Proof Complexity: New lower bounds. - Erfan Khaniki (Electron. Colloquium Comput. Complex., 2022)

New Relations and Separations of conjectures about Incompleteness in the finite Domain. - Erfan Khaniki (J. Symb. Log., 2022)

Jump Operators, Interactive Proofs and Proof Complexity Generators. - Erfan Khaniki (FOCS, 2024)

From Proof Complexity to Circuit Complexity via Interactive Protocols. - Noel Arteche; Erfan Khaniki; Ján Pich; Rahul Santhanam (ICALP, 2024)

TFNP Intersections Through the Lens of Feasible Disjunction. - Pavel Hubácek; Erfan Khaniki; Neil Thapen (ITCS, 2024)

The provably total functions of basic arithmetic and its extensions. - Mohammad Ardeshir; Erfan Khaniki; Mohsen Shahriari (Arch. Math. Log., 2025)

The Proof Analysis Problem. - Noel Arteche; Albert Atserias; Susanna F. de Rezende; Erfan Khaniki (CoRR, 2025)