NYU CS Theory "Pandemic Presentations"
Update: The event is now over. Thanks to everyone who made the event a success, especially to the speakers showing their wonderful TCS research!
~
During the pandemic, many researchers here at NYU made progress on and published papers, but did not get to attend an in-person conference to present their work. To make up for this, the Algorithms and Foundations Group at Tandon is hosting a mini-conference for NYU researchers in theoretical computer science to present their recent work!
Who can attend?
Everyone at NYU is welcome to attend!
Talks will be about various topics on theoretical computer science (broadly defined).
Interested in giving a talk?
If you would like to give a talk, then either fill out this form or email Raphael Meyer. Professors, Postdocs, PhD students, and all other NYU affiliates are welcome to present. The list of speakers is now finalized.
Talks will be 25 minutes long: 20 minutes of presentation and 5 minutes for Q&A.
When is it? Where is it?
The event will be on May 2022, from 9:30am to 3:30pm.
The event will be held in a big and open conference room, specifically Room 1201 of the 370 Jay Street building on the Tandon Campus.
Schedule
We plan to have food provided, but we are still working on the logistics for that.
| Time | Presenter | Department | Talk Title |
|---|---|---|---|
| 9:30am | Coffee and Pastries | ||
| 9:55am | Chris Musco | Tandon | Welcome |
| 10:00am | Marshall Ball | Courant | Hardness vs Non-Malleability |
| 10:25am | Min Jae Song | Courant | Continuous Learning with Errors |
| 10:50am | Harish Karthikeyan | Courant | Updatable Public Key Encryption in the Standard Model |
| 11:15am | Break | ||
| 11:25am | Ishan Agarwal | Courant | Stable Matching: Choosing Which Proposals to Make |
| 11:50am | Teal Witter | Tandon | Adaptivity Gaps for the Stochastic Boolean Function Evaluation Problem |
| 12:15pm | Lunch | ||
| 1:15pm | Jiashuo Jiang | Stern | Tight Guarantees for Multi-unit Prophet Inequalities and Online Stochastic Knapsack |
| 1:40pm | Kelly Marshall | Tandon | Differentiable Design With Dynamic Programming |
| 2:05pm | Alberto Bietti | CDS | Efficient Kernel UCB for Contextual Bandits |
| 2:30pm | Break | ||
| 2:40pm | Raphael A. Meyer | Tandon | Chebyshev Sampling is Universal for Lp Polynomial Regression |
| 3:05pm | Jon Niles-Weed | Courant/CDS | Strong Recovery of Geometric Planted Matchings |