Time-Space Lower Bounds for the Polynomial-Time Hierarchy on Randomized Machines. - Scott Diehl; Dieter van Melkebeek (SIAM J. Comput., 2006)

Lower Bounds for Swapping Arthur and Merlin. - Scott Diehl (APPROX-RANDOM, 2007)

An improved time-space lower bound for tautologies. - Scott Diehl; Dieter van Melkebeek; Ryan Williams 001 (J. Comb. Optim., 2011)