SIAM Symposium on Simplicity in Algorithms

January 11-12, 2021
Westin Alexandria Old Town, Alexandria, Virginia, U.S.
https://www.siam.org/conferences/cm/conference/sosa21

Submission deadline: August 12, 2020
Registration deadline: December 7, 2020

Symposium on Simplicity in Algorithms is a conference in theoretical computer science dedicated to advancing algorithms research by promoting simplicity and elegance in the design and analysis of algorithms. The benefits of simplicity are manifold: simpler algorithms manifest a better understanding of the problem at hand; they are more likely to be implemented and trusted by practitioners; they can serve as benchmarks, as an initialization step, or as the basis for a “state of the art” algorithm; they are more easily taught and are more likely to be included in algorithms textbooks; and they attract a broader set of researchers to difficult algorithmic problems.

IDEAL Workshop on Estimation of Network Processes and Information Diffusion

May 14, 2020
Virtual
https://www.ideal.northwestern.edu/events/estimation-of-network-processes-and-information-diffusion/?fbclid=IwAR3HRiqCz8zTQfHt46hF-VF9PHE2F1v4uvQ6V_ggxmzKqFvromZXhVOOygY

Many important dynamic processes are determined by an underlying network structure. Examples include the spread of epidemics, the dynamics of public opinions, the diffusion of information about social programs, and biological processes such as neural spike trains. Data about these processes is becoming increasingly available which has lead to a number of different research communities to tackle related questions independently. What is the source of a rumor? Will a given disease spread widely? Who is the key player? This workshop will cover some new tools being developed to address such questions. The workshop speakers are Devavrat Shah, Lori Beaman, Rebecca Willet, and Arun Chandrasekhar. There will be short talks from 11am-3pm Central and a panel discussion 4-5pm. Participants can register to join on Zoom (see link for details), or stream the video on Panopto.

Workshop on Local Algorithms

July 20-21, 2020
Virtual (8am — 12pm Pacific Time)
https://www.mit.edu/~mahabadi/workshops/WOLA-2020.html

Submission deadline: May 15, 2020
Registration deadline: June 30, 2020

Due to the current situation with COVID-19, we have decided to hold a virtual and shorter version of WOLA this year. WOLA 2020 will run for two days between 8am – 12pm PT to maximize the attendance. This year, we will only include spotlight talks and short (postdoc/student) talks. Hopefully next year we can go back to a more inclusive format.

* You are all invited and we would love to see you all. If you plan to attend, please register before June 30th.
* In addition, we will have short (5-10 minutes) talks for postdocs and graduate students. If you would like to give such a talk please submit your proposed title and abstract before May 15th.

Please refer to the website to find registration and short talk submission forms.

Workshop in Quantum Information, Complexity & Cryptography

June 11-12, 2020
University of York, UK
https://sites.google.com/york.ac.uk/quicc/quicc

We are organising a two-day event at the University of York in collaboration with York Interdisciplinary Centre for Cyber Security, which brings researchers in Quantum Information, Complexity and Cryptography together. The goal is to cover recent topics in these areas and facilitate interactions between them. The event is generously sponsored by the Heilbronn Institute for Mathematical Research and York CS department. We hope to have mathematicians, physicists and computer scientists alike at the event. We have about 20 travel bursaries to support the attendance of young and early-career researchers, and encourage under-represented groups to apply.

Prague Summer School on Discrete Mathematics

August 24-28, 2020
Prague, Czech Republic
http://pssdm.math.cas.cz/

Registration deadline: March 22, 2020

The third edition of Prague Summer School on Discrete Mathematics will feature two lecture series:

Subhash Khot (New York University): Hardness of Approximation: From the PCP Theorem to the 2-to-2 Games Theorem, and

Shayan Oveis Gharan (University of Washington): Polynomial Paradigm in Algorithm Design.

The School is primarily intended for PhD students and early career researchers. There is no registration fee and a number of travel stipends will be available.

Krajíček’s Fest – Celebrating Jan Krajíček’s 60th Anniversary and his Contributions to Logic and Complexity

September 1, 2020
Tábor, Czech Republic
https://www.dcs.warwick.ac.uk/~igorcarb/events/krajicek-fest/index.html

We would like to invite you to participate in a workshop on the Logical Foundations of Complexity Theory to celebrate Prof. Jan Krajicek’s 60th anniversary.

Preliminary list of speakers:
Pavel Pudlák (Czech Adacemy of Sciences)
Samuel Buss (University of California, San Diego)
Neil Thapen (Czech Adacemy of Sciences)
Leszek Kołodziejczyk (University of Warsaw)
Emil Jeřábek (Czech Adacemy of Sciences)
Moritz Müller (Universitat Politècnica de Catalunya)

The event will be followed by a 3-day workshop on Complexity Theory which will include tutorials and contributed talks. For more information about the workshops, please visit the website above.