John Dellas is a first-year PhD student advised by Robert Robere in the computer science department of McGill University. John is particularly interested in the interplay of circuit, proof and communication complexity. His current research focuses on how characterizing TFNP subclasses with circuit models can provide new insights into separations and relationships between these models. Before joining the ranks of McGill university, John completed his B.Sc. in mathematics and computer science at Rutgers University, where he worked on graph streaming algorithms under Martin Farach-Colton.