TCS+ retweeted
📢 For the first talk of the TCS+ season, we're starting with a bang! On Wed 09/25 at 10am PT/1pm ET, Adam Klivans from @UTAustin will tell us about "Efficient Algorithms for Learning with Distribution Shift."
Register: docs.google.com/forms/d/e/1F…
TCS+ retweeted
📢 Our next talk is coming up! On August 12, 11am PT, Dr. Emily Wenger from @DukeU will tell us about "Reclaiming Data Agency in the Age of Ubiquitous Machine Learning".
Details and link: sites.google.com/view/dstheo…
TCS+ retweeted
The new season of TCS+ is not that far! Please suggest talks, speakers, surveys: docs.google.com/forms/d/e/1F…
TCS+ retweeted
Tragic news. Luca Trevisan passed away today. The talk he prepared in his final weeks for the TCS4all workshop will be given virtually in his honor on Monday. I hope many of the TCS community can attend.
windowsontheory.org/2024/06/…
Remembrances of Luca from...
Bocconi University: unibocconi.it/en/news/luca-t…
Boaz Barak: windowsontheory.org/2024/06/…
Scott Aaronson: scottaaronson.blog/?p=8057
Lance Fortnow: blog.computationalcomplexity…
#rememberingLuca
TCS+ retweeted
Please share widely. @ccanonne_ @thegautamkamath @boazbaraktcs @shortstein @thesasho @samirkhuller
sigact.org/tcsforall/
TCS+ retweeted
📢 Next week (Wed 05/29) at 10am PT/1pm ET, Jyun-Jie Liao, from @Cornell will give us a survey on the Polynomial Freiman-Ruzsa (PFR) conjecture! This is the last talk of the TCS+ season... hoping to see many of you online!
Register: docs.google.com/forms/d/e/1F…
TCS+ retweeted
This is this week! docs.google.com/forms/d/e/1F…
📢 Next week (Wed 03/20) at 10am PT/1pm ET, Julia Chuzhoy from @TTIC_Connect will tell us about "Faster Combinatorial Algorithms for Bipartite Matching"
Details: tcsplus.wordpress.com/2024/0…
Register (optional): docs.google.com/forms/d/e/1F…
TCS+ retweeted
📢 Next week (Wed 03/20) at 10am PT/1pm ET, Julia Chuzhoy from @TTIC_Connect will tell us about "Faster Combinatorial Algorithms for Bipartite Matching"
Details: tcsplus.wordpress.com/2024/0…
Register (optional): docs.google.com/forms/d/e/1F…
TCS+ retweeted
The link for Zeyong Li's talk (tomorrow!) is now available on the website: tcsplus.org/welcome/next-tcs…
See you tomorrow, bright and early!
📢 Next week (Wed 04/10) at 7:30am PT/10:30am ET/16:30 CEST, Zeyong Li from @NUSingapore will tell us about "Simple Circuit Lower Bound via Algorithm for the Range Avoidance Problem."
Details: tcsplus.wordpress.com/2024/0…
Register (optional): docs.google.com/forms/d/e/1F…
TCS+ retweeted
This is this week! Register to hear Zeyong Li (@li_zeyong_) at: docs.google.com/forms/d/e/1F…
📢 Next week (Wed 04/10) at 7:30am PT/10:30am ET/16:30 CEST, Zeyong Li from @NUSingapore will tell us about "Simple Circuit Lower Bound via Algorithm for the Range Avoidance Problem."
Details: tcsplus.wordpress.com/2024/0…
Register (optional): docs.google.com/forms/d/e/1F…
TCS+ retweeted
Excited to see that Zeyong's near-maximum lower bound for S2E will be presented at TCS+! Looking forward to the talk😍😍😍
📢 Next week (Wed 04/10) at 7:30am PT/10:30am ET/16:30 CEST, Zeyong Li from @NUSingapore will tell us about "Simple Circuit Lower Bound via Algorithm for the Range Avoidance Problem."
Details: tcsplus.wordpress.com/2024/0…
Register (optional): docs.google.com/forms/d/e/1F…
TCS+ retweeted
Really excited to share my recent work on exponential-sized circuit lower bound. More interestingly, it has a simple and clean proof that should be accessible to everyone!😋
📢 Next week (Wed 04/10) at 7:30am PT/10:30am ET/16:30 CEST, Zeyong Li from @NUSingapore will tell us about "Simple Circuit Lower Bound via Algorithm for the Range Avoidance Problem."
Details: tcsplus.wordpress.com/2024/0…
Register (optional): docs.google.com/forms/d/e/1F…
TCS+ retweeted
📢 Next week (Wed 04/10) at 7:30am PT/10:30am ET/16:30 CEST, Zeyong Li from @NUSingapore will tell us about "Simple Circuit Lower Bound via Algorithm for the Range Avoidance Problem."
Details: tcsplus.wordpress.com/2024/0…
Register (optional): docs.google.com/forms/d/e/1F…
TCS+ retweeted
📢 Next week (Wed 03/20) at 10am PT/1pm ET, Huan Li from @Penn will give the first talk of the season, on "Parallel Approximate Maximum Flows in Near-Linear Work and Polylogarithmic Depth."
Details: tcsplus.wordpress.com/2024/0…
Register (optional): docs.google.com/forms/d/e/1F…
TCS+ retweeted
And, of course, subscribe to our mailing list to stay informed! cs.nyu.edu/mailman/listinfo/…
TCS+ retweeted
📢 Next week (Wed 12/13) at 10am PT/1pm ET, Aaron Bernstein from @RutgersU will speak on "Negative-Weight Single-Source Shortest Paths in Near-linear Time." Join us for the last TCS+ talk of 2023!
Details: tcsplus.wordpress.com/2023/1…
Register (optional): docs.google.com/forms/d/e/1F…
TCS+ retweeted
The link for @kasperglarsen's talk (tomorrow!) is now available on the website: tcsplus.org/welcome/next-tcs…
See you tomorrow!
📢 As foretold! Next week (Wed 11/29) at 7:30am PT/10:30 ET, Kasper Green Larsen (@kasperglarsen) from @AarhusUni_int will tell us how "Bagging is an Optimal PAC Learner."
Details: tcsplus.wordpress.com/2023/1…
Register (optional): docs.google.com/forms/d/e/1F…
TCS+ retweeted
This is this week! Register for the Zoom talk at docs.google.com/forms/d/e/1F…
📢 As foretold! Next week (Wed 11/29) at 7:30am PT/10:30 ET, Kasper Green Larsen (@kasperglarsen) from @AarhusUni_int will tell us how "Bagging is an Optimal PAC Learner."
Details: tcsplus.wordpress.com/2023/1…
Register (optional): docs.google.com/forms/d/e/1F…
TCS+ retweeted
📢 As foretold! Next week (Wed 11/29) at 7:30am PT/10:30 ET, Kasper Green Larsen (@kasperglarsen) from @AarhusUni_int will tell us how "Bagging is an Optimal PAC Learner."
Details: tcsplus.wordpress.com/2023/1…
Register (optional): docs.google.com/forms/d/e/1F…








