[talks] Yonatan Naamad will present his FPO, "Hardness from Densest Subgraph Conjectures"on Monday, October 30, 2017 at 4pm in CS 402

Tue Oct 24 09:56:56 EDT 2017

Yonatan Naamad will present his FPO, "Hardness from Densest Subgraph Conjectures"on Monday, October 30, 2017 at 4pm in CS 402. 

The members of his committee are: Moses Charikar (adviser); Readers: Sanjeev Arora and Anthony Wirth (University of Melbourne); Examiners: Moses Charikar, Mark Braverman, and Matt Weinberg. 

A copy of his thesis is available in Room 310. Everyone is invited to attend his talk. The talk abstract is attached to this email. 
-------------- next part --------------
An HTML attachment was scrubbed...
URL: <http://lists.cs.princeton.edu/pipermail/talks/attachments/20171024/fb4dcd02/attachment-0001.html>
-------------- next part --------------
A non-text attachment was scrubbed...
Name: thesis_abstract.pdf
Type: application/pdf
Size: 1166187 bytes
Desc: not available
URL: <http://lists.cs.princeton.edu/pipermail/talks/attachments/20171024/fb4dcd02/attachment-0001.pdf>