📢 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

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

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

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

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

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

The recordings (and slides when provided) of the previous season of TCS+ are now available! #TheoreticalCS

Website: https://www.tcsplus.org/welcome/past-talks/2025-2026
YouTube: https://www.youtube.com/@TCSplusSeminars/videos

List:
2025/12/03: Natalie Collina, "Swap regret and correlated equilibria beyond normal-form games"
2025/11/19: Haotian Jiang, "Beck-Fiala and Komlós Bounds Beyond Banaszczyk"
2025/11/05: Aparna Gupte, "Quantum One-Time Programs, Revisited"
2025/10/22: Ian Mertz, "A Random Walk Down Full Memory Lane"
2025/10/08: Janani Sundaresan, "Distributed Triangle Detection is Hard in Few Rounds"

The list of social activities for #FOCS2025 has been posted! Scavenger hunt, morning runs, random walks, networking event, senior/junior lunches...

Introducing, this year, "Succinct Sketches" for volunteers to blog (semi) live from the conference! #TheoreticalCS

https://focs.computer.org/2025/activities/

just had someone writing "o tilde" as Oish and I'm in tears this is way to good let's make that the official way to call it

#theoreticalCs #computerScience #theoinf