August 1-5, 2022
Foundations of Data Science Institute (FODSI) is organizing a workshop on Sublinear Algorithms. The workshop will be held on August 3-5 at MIT. It will cover topics in sublinear algorithms, including streaming algorithms, sketching algorithms, sublinear-time algorithms, property testing, local algorithms and related topics.
The workshop will be preceded by a summer school (held August 1-2), which will cover topics in sublinear algorithms, as well as the related areas of algorithms for statistical problems and learning-augmented algorithms.
May 27, 2022
Northwestern University Mudd 3514
Ainesh Bakshi (Carnegie Mellon University), Arnold Filtser (Bar Ilan University), Weiyun Ma (Stanford University), Assaf Naor (Princeton University), Erik Waingarten (Stanford University)
Dates: Friday, May 27
Location: Northwestern University
Rooms: Mudd 3514
Registration Link on website-
All times are in the Central Time Zone (CDT; Chicago time).
9:55am: Opening Remarks
10:00am: Arnold Filtser, Locality-Sensitive Orderings
11:00am: Ainesh Bakshi, Robustly Learning a Mixture of k Arbitrary Gaussians 12:00: Lunch
1:00pm: Assaf Naor, Randomized clustering in high dimensions
2:00pm: Erik Waingarten, The Johnson-Lindenstrauss Lemma for Clustering and Subspace Approximation 3:00: Coffee Break
3:20pm: Weiyun Ma, Almost 3-Approximate Correlation Clustering in Constant Rounds
May 13, 2022
Northwestern University and Zoom
We are inviting you to attend the IDEAL Workshop on Algorithms for Massive Data Sets. The workshop will take place at Northwestern University on Friday, May 13. It will be in a hybrid format. If you are interested in participating in the workshop (in-person or remotely), please register on the workshop webpage.
April 22-23, 2022
Northwestern University & Online
We are inviting you to attend the IDEAL Workshop on Clustering. The workshop will take place at Northwestern University on Friday, April 22, and Saturday, April 23. It will be in a hybrid format. If you are interested in participating in the workshop (in-person or remotely), please register on the workshop webpage.
May 31 – June 3, 2022
This 4-day workshop will bring together Australian and Australasian researchers in mathematics and theoretical computer science, in view of fostering exchanges and collaborations. Specifically, the workshop will focus on two themes, “Computational Complexity and Cryptography” and “Graph Theory and Combinatorics,” from the point of view of both the mathematics and computer science community, with ample time for informal discussions around each. Each day will involve plenary talks by both a member of the mathematics and computer science community, and time devoted to open problems and interesting research directions, as seen by both communities.
April 22-23, 2022
Mudd Library 3514
IDEAL Workshop on Clustering. The workshop will take place at Northwestern University on Friday, April 22, and Saturday, April 23, 8:40 am- 4:00 pm CST (Chicago Time) in MUDD 3514. It will be in a hybrid format. If you are interested in participating in the workshop (in-person or remotely), please register at the workshop webpage: https://www.ideal.northwestern.edu/events/clustering/
Dates: Friday, April 22 and Saturday, April 23, 2022
Location: Northwestern University, Evanston, IL
Rooms: Mudd Library 3514 for both Friday and Saturday
Streaming: Panopto and Zoom
July 25-29, 2022
Los Angeles, USA
Registration deadline: April 15, 2022
The goal of this summer school is to present an in-depth introduction to post-quantum and quantum cryptography for advanced
undergraduate and graduate students, as well as young researchers, in mathematics, computer science, and physics. Lecturers in the school will discuss both topics hand in hand: post-quantum
cryptography, or the art of analyzing security of classical
cryptosystems against attacks, and quantum cryptography, or the art of leveraging quantum effects to develop new cryptographic schemes that are made possible by quantum information.
October 17-21, 2022
Submission deadline: May 22, 2022
LATIN is devoted to different areas in theoretical computer science including, but not limited to: algorithms (approximation, online, randomized, algorithmic game
theory, etc.), analytic combinatorics and analysis of algorithms, automata theory and formal languages, coding theory and data compression, combinatorial algorithms, combinatorial optimization, combinatorics and graph theory, complexity theory,
computational algebra, computational biology, computational geometry, computational number theory, cryptology, databases and information retrieval, data structures, formal methods and security, foundations of data science and theoretical machine learning, Internet and the web, parallel and distributed computing, pattern matching, programming language theory, quantum computing, and random structures.
July 11-15, 2022
Prague, Czech Republic
Registration deadline: March 1, 2022
Prague Summer School on Discrete Mathematics 2022 will feature lecture series on
statistical physics methods in combinatorics (Will Perkins) and the container method (Wojciech Samotij). The School is primarily intended for PhD students and postdocs, but students and researchers in other stages of their careers may also participate. A limited number of stipends to cover travel and stay for participants is available.
June 20-24, 2022
Submission deadline: January 15, 2022
STOC/TheoryFest 2022 will hold workshops during the conference week, June 20–24, 2022. We invite groups of interested researchers to submit workshop proposals. The due date for proposals is February 15, 2022. Submission instructions can be found on the STOC’22 website.