Mika Göös is a Ph.D. student in the Theory Group at the Department of Computer Science at the University of Toronto, advised by Toniann Pitassi. His research interests lie in computational complexity with a particular fondness for distributed graph algorithms and communication complexity.

Thomas Watson is an assistant professor of computer science at the University of Memphis. Previously, he was a postdoc at the University of Toronto, supervised by Toniann Pitassi. He received his Ph.D. in computer science from the University of California, Berkeley, supervised by Luca Trevisan. He received his undergraduate degree in computer science, math, and computer engineering from the University of Wisconsin-Madison, where his interest in theoretical computer science research was sparked and fostered by Dieter van Melkebeek. His research interests include most of complexity theory, but recently he has been working on communication complexity.