Derandomizing Arthur-Merlin games and approximate counting implies exponential-size lower boundsDan GutfreundAkinori Kawachi2010CCC 2010Conference paper
Communication complexity with synchronized clocksRussell ImpagliazzoRyan Williams2010CCC 2010Conference paper