Rutgers/DIMACS Theory of Computing Seminar

Organizers: Sepehr Assadi and Aaron Bernstein
Place: Online (join the mailing list for the link)
Time: Wednesdays 11am–12pm ET

For Participants

There is a mailing list where the announcements of talks and other related information appear. You can subscribe to this list here.


Upcoming Talks—Fall 2020

Date Speaker Affiliation Title
10/21/20 Thatchaphol Saranurak TTIC/UMich Recent Applications of Expanders to Graph Algorithms
10/28/20 Seth Pettie UMich Planar Distance Oracles
11/04/20 Talya Eden MIT TBA
11/11/20 Marshall Ball Columbia TBA
12/09/20 Christian Konrad University of Bristol TBA

Past Talks

Date Speaker Affiliation Title
10/14/20 Deeparnab Chakrabarty Dartmouth Graph Connectivity and Single Element Recovery via Linear and OR Measurements: Rounds v Query Trade-offs
10/07/20 David Wajc Stanford Network Coding Gaps for Completion Times of Multiple Unicasts
09/30/20 Nicole Wein MIT The Worker-Task Assignment Problem
09/23/20 Zach Langley Rutgers Improved Bounds for Distributed Load Balancing
09/16/20 Jie Gao Rutgers Range Query on Planar Graphs and Applications on Spatial Sensing with Privacy
09/09/20 Ariel Schvartzman Rutgers/DIMACS Optimal and Approximately Optimal Mechanism Design Beyond a Single Dimension

Interested in Giving a Talk?

Send an email to the organizers.

Previous iterations of the seminar: Spring 2020, Fall 2019, Spring 2018, Fall 2017