And that's a wrap for the semester of TCS+! All the talks of the season are now available on our website:
https://sites.google.com/view/tcsplus/welcome/past-talks/2025-2026

and YouTube channel:
https://www.youtube.com/@TCSplusSeminars/videos

Thank you to all attendees, and to our wonderful speakers—and see you in the Fall! #TheoreticalCS

The Zoom link for Shyamal Patel's TCS+ talk on "Learning Functions of Halfspaces" is now available on our website.

See you tomorrow, 1pm ET! https://www.tcsplus.org/welcome/next-tcs-talk #TheoreticalCS

TCS+ - Next TCS+ talk

Our next TCS+ talk (and last of the season!) will take place on May 20 (10:00am Pacific Time, 1:00 pm Eastern Time, 19:00 Central European Summer Time, 17:00 UTC — check yours here ). Shyamal Patel, from Columbia University, will tell us about "Learning Functions of Halfspaces." ↳Link to the talk

📢 The last TCS+ talk of the season will be Wednesday, May 20 (10am PT, 1pm ET, 19:00 CEST): Shyamal Patel, from Columbia University, will tell us about "Learning Functions of Halfspaces"!

RSVP to receive the link (available one day prior to the talk): https://forms.gle/jeGPub2pqS5RCQgg9 #TheoreticalCS

TCS+ RSVP: Shyamal Patel (2026/05/20)

Title: Learning Functions of Halfspaces

Google Docs

The more I study CS, the more I feel stupid for wanting precise and correct algorithms. Just read about interactive proofs: why bother with complete correctness when you can make the probability of failing just by questioning everything? Seems straight from the book "Mom 101 - telling when your children lie"

#TheoreticalCS

📢 The next TCS+ talk will be Wednesday, April 22 (10am PT, 1pm ET, 19:00 CEST): Yichuan Wang, from UC Berkeley, will speak about "Superquadratic Lower Bounds for Depth-2 Linear Threshold Circuits"

RSVP to receive the link (available one day prior to the talk): https://docs.google.com/forms/d/e/1FAIpQLSdw505aI9za7gQR9a4z_Osc-ajxfglgwMDRn0OG67fLvCkh1A/viewform #TheoreticalCS

TCS+ RSVP: Yichuan Wang (2026/4/022)

Title: Superquadratic Lower Bounds for Depth-2 Linear Threshold Circuits

Google Docs

The Zoom link for Rahul Ilango's talk on "Gödel in Cryptography: Zero-Knowledge Proofs With No Interaction, No Setup, and Perfect Soundness" is now available on the TCS+ website.

See you tomorrow, 1pm ET! https://www.tcsplus.org/welcome/next-tcs-talk #TheoreticalCS

TCS+ - Next TCS+ talk

Our next TCS+ talk (and last of the season!) will take place on May 20 (10:00am Pacific Time, 1:00 pm Eastern Time, 19:00 Central European Summer Time, 17:00 UTC — check yours here ). Shyamal Patel, from Columbia University, will tell us about "Learning Functions of Halfspaces." ↳Link to the talk

The Call for Papers and submission server for #FOCS2026 are up!

⏰ Deadline: April 1, 5:00 PM EDT (21:00 UTC)

https://sanjeevkhanna.org/FOCS2026_CFP.html #TheoreticalCS

FOCS 2026 – Call for Papers

And... TCS+ is back on 🎉! The first talk of the season will be delivered by Sophie Huiberts (CNRS @sophiehuiberts ) on ⏰ March 4 (10am PT, 1pm ET, 19:00 CET): "Analyzing the Simplex Method by the Book"

RSVP to receive the link (one day before the talk): https://forms.gle/aD621bCwswjBihxv7 #TheoreticalCS

TCS+ RSVP: Sophie Huiberts (2026/03/04)

Title: Analyzing the Simplex Method by the Book

Google Docs

Less than one month to go before the start of the new season of TCS+! Remember you can suggest talks and speakers on our website:

https://sites.google.com/view/tcsplus/welcome/suggest-a-talk #TheoreticalCS

TCS+ - Suggest a talk

Suggest a talk

I am thinking of converting my lecture notes for my "Randomized #Algorithms" class into a textbook over this semester. What do you think, and what would you like to see?

More tutorials/exercises? Examples of assignments? Something else? Let me know!

🔗 https://ccanonne.github.io/teaching/COMPx270 #TheoreticalCS

Content for the COMP4270 and COMP5270 Course on “Randomised and Advanced Algorithms” at the University of Sydney ##

Clément Canonne