A note on exponential circuit lower bounds from derandomizing Arthur-Merlin games. - Scott Aaronson; Baris Aydinlioglu; Harry Buhrman; John M. Hitchcock; Dieter van Melkebeek (Electron. Colloquium Comput. Complex., 2010)

Derandomizing Arthur-Merlin Games and Approximate Counting Implies Exponential-Size Lower Bounds. - Baris Aydinlioglu; Dan Gutfreund; John M. Hitchcock; Akinori Kawachi (Comput. Complex., 2011)

Nondeterministic Circuit Lower Bounds from Mildly De-randomizing Arthur-Merlin Games. - Baris Aydinlioglu; Dieter van Melkebeek (CCC, 2012)

Affine Relativization: Unifying the Algebrization and Relativization Barriers. - Baris Aydinlioglu; Eric Bach 001 (Electron. Colloquium Comput. Complex., 2016)

Nondeterministic circuit lower bounds from mildly derandomizing Arthur-Merlin games. - Baris Aydinlioglu; Dieter van Melkebeek (Comput. Complex., 2017)

Corrigendum to Affine Relativization: Unifying the Algebrization and Relativization Barriers. - Baris Aydinlioglu; Eric Bach 001 (ACM Trans. Comput. Theory, 2019)