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 Friday, Oct 22, 2021. 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 … Continue reading Nominate papers to SIGACT Research highlights

[Guest post by Guy Rothblum] During the week of July 11-15, 2022, Cynthia Dwork and Guy Rothblum will be teaching a graduate course on algorithmic fairness at IPAM:Graduate Summer School on Algorithmic Fairness (ucla.edu)The first 3 days will focus on theory, and the last two days will transition towards practice and will feature lectures by domain … Continue reading Summer course on algorithmic fairness

[Guest post by Mary Wooters; the conference already started but there are still great activities tomorrow and Wednesday. On an unrelated note, please make sure to watch the new Theory Shorts episode by the Simons Institute of Computing on lower bounds in computational complexity, featuring Madhu Sudan, Paul Beame, Faith Ellen, Jelani Nelson, and Manuel … Continue reading RANDOM/APPROX conference

The second edition of the recently created conference on Information-Theoretic Cryptography (ITC 2021) will take place virtually on July 24-26, 2021. The final program is out and contains exciting new works and invited talks that highlight the recent advances in the area by Benny Applebaum, Elaine Shi, Irit Dinur, Salman Avestimehr, Matthieu Bloch, and Mark … Continue reading ITC 2021: Call for participation (guest post by Benny Applebaum)

The 53rd Annual ACM Symposium on Theory of Computing (STOC'21) concludes today, after 5 days of action-packed, Gather-power talks, workshops, plenary talks, and posters. A huge thank you to all volunteers, organizers, speakers, and attendees, who helped make this virtual conference a success! We would like to ask for your feedback on the conference. Whether … Continue reading STOC feedback and TCS Wikipedia (guest post by Clément Canonne )

[H/T Jelani Nelson] In recent years there has been increasing interest in using machinelearning to improve the performance of classical algorithms incomputer science, by fine-tuning their behavior to adapt to theproperties of the input distribution. This “data-driven” or“learning-based” approach to algorithm design has the potential tosignificantly improve the efficiency of some of the most widely … Continue reading Machine Learning for Algorithms – virtual workshop

The Simons institute started a new virtual seminar series highlighting recent advances in theoretical computer science. The first two talks in the series will be: June 16th 10am-11am PDT (1pm-2pm EDT). Virginia Vassilevska Williams on a  Refined Laser Method and Faster Matrix MultiplicationAugust 5 10am-11am PDT (1pm-2pm EDT) Yuansi Chen on An Almost Constant Lower … Continue reading New seminar series in Simons Institute

The fifth WOLA (Workshop on Local Algorithms) will be virtual, and take place June 14-15. Registration is free, but required: please fill this form by June 10th to attend. Local algorithms — that is, algorithms that compute and make decisions on parts of the output considering only a portion of the input — have been studied in a number of … Continue reading Workshop on Local Algorithms (Guest post by Ronitt Rubinfeld)

A reminder: the deadline to submit nominations for the STOC Test of Time Award is May 24. You can nominate papers for the 10 year award - STOC 2007-201120 year award - STOC 1997-200130 year award - STOC 1987-1991The award website ( https://sigact.org/prizes/stoc_tot.html ) helpfully contains links to the papers published in all these conferences. … Continue reading STOC Test of time award