Joshua Brody

I am an Associate Professor of Computer Science at Swarthmore College. I received a Ph.D. in computer science in September 2010 from Dartmouth College, where I was fortunate to be advised by Amit Chakrabarti. Between Dartmouth and Swarthmore, I was a postdoctoral researcher at Tsinghua University and Aarhus University.

Prior to graduate school, I was a Peace Corps Volunteer in Burkina Faso, where I taught high school mathematics and introductory computer skills.

My main research area is theoretical computer science. I am particularly interested in query complexity and communication complexity, and in how communication lower bounds give you lower bounds in areas such as streaming algorithms, property testing, and data structures.

Have something to say? Provide some ~~anonymous feedback~~ (anonymous feedback currently down).

Current Teaching

CS 41: Introduction to Algorithms
Lecture: MWF 10:30-11:20, Singer 222.
Lab A: Monday 1:15-2:45, Clothier 016.
Office Hours: F 2-4, Science Center 260.
CS 35x: Competitive Programming
Lecture: T 1:15-2:30, SCI 240.
Office Hours: R 2-4, Science Center 260.

Past Teaching

CS 21: Introduction to Computer Science (F21, S19, S16)
CS 35: Data Structures and Algorithms (S24, F23, S20, S17, F14, S14, F13 lab)
CS 41: Introduction to Algorithms (F22, F20, F19, F18, F16, S15, F13)
CS 46/Math 46: Theory of Computation (S21)
CS 49/Math 59: The Probabilistic Method (F15)
CS 91T: Randomized Algorithms (S23)
CS 93: Directed Reading (F23, S23, F22, S21, S19x2, F18, S16, F15, F14, S14, F13)
Sublinear Time Algortihms: Property Testing. Aarhus University, Third Quarter, Winter 2013.
Communication Complexity. Aarhus University, Second Quarter Fall 2011.
Research Immersion in Theoretical Computer Science. Tsinghua University, Summer 2011.
Computer Architecture (CS37). Dartmouth College, Summer 2010.