Following last year’s successful launch, we are happy to announce the second edition of the conference on Information-Theoretic Cryptography (ITC). The call for papers for ITC 2021 is out, and, to cheer you up during lockdowns, we prepared a short theme song https://youtu.be/kZT1icVoTp8   Feel free to add your own verse 😉 The submission deadline is … Continue reading ITC 2021 (guest post by Benny Applebaum)

TL;DR: Know of a great recent paper that should be highlighted to the theory community and beyond? Email a nomination to sigact.highlights.nominations@outlook.com by October 19th. The goal of the SIGACT Research Highlights Committee is to help promotetop computer science theory research via identifying results that are ofhigh quality and broad appeal to the general computer … Continue reading SIGACT research highlights – call for nominations

[Guest post by Yossi Azar] The 5th Highlights of Algorithms conference (HALG 2020) will take place Aug 31- Sep 2, 2020. http://highlightsofalgorithms.org/ The Highlights of Algorithms conference is a forum for presenting the highlights of recent developments in algorithms and for discussing potential further advances in this area. The conference will provide a broad picture … Continue reading Highlights of Algorithms (HALG) -free – Aug 31- Sep 2

When I was in grad school a common advice for beginning grad students was to leaf through the (paper) STOC or FOCS proceedings to see papers that you are interested in. This is still a decent advice (and requires less physical strength these days 🙂 ) but papers are not always the best source for … Continue reading Ryan O’Donnell’s “TCS Toolkit” and other resources

[Guest post by Valerie King. TL;DR SOSA 21 will take place jointly with SODA 21. To submit register by August 12, paper deadline August 19.] Call for Papers: Registration deadline August 12, 2020 3rd SIAM Symposium on Simplicity in Algorithms  (SOSA)January 11-12, 2021Alexandria, Virginia, U.S.(Held jointly with SODA 2021)Symposium on Simplicity in Algorithms (SOSA) is … Continue reading CFP: Symposium on Simplicity in Algorithms (SOSA)

(Does it still make sense to blog such announcements or is these days Twitter the only way to go about this? Asking for a friend 🙂 ) Prasad Raghavendra and Avishay Tal have organized a sequence of 6 lectures on some of the exciting recent advances in analysis of Boolean functions. Lecture Series: Advances in … Continue reading Simons institute lectures on analysis of Boolean functions

I originally planned this summer to finish the work on my Introduction to Theoretical Computer Science book, and in particular write the two missing chapters on space complexity and interactive proof systems. Needless to say, this summer did not go as planned and I won't be able to write these chapters. However, I still intend … Continue reading TCS book: Call for GitHub issues

Going directly from undergraduate to Ph.D can be a good idea for many students interested in research, but it's not the only route or the best choice for everyone. As I wrote before, for students that discovered their interest in theoretical CS late in their undergrad, or perhaps after they graduated, a research Masters, can … Continue reading Crowdsourcing Masters program

Madhur writes: Thanks to all who participated in STOC 2020! Since the discussions on some of the topics from the business meeting, on SafeToC, and  on the papers/workshops are still ongoing, we will keep the Slack workspace open till July 31st (instead of just one week after the conference, as announced earlier). Also, if any … Continue reading STOC 2020 slack channel open (from Madhur Tulsiani)