June 12-15, 2023
DIMACS, Rutgers University, Piscataway, NJ
Registration deadline: June 4, 2023
The goal of this workshop is to bring together researchers from different areas of graph algorithms to share the techniques that have been recently influential in their area. The program will include a combination of tutorials, talks, open problem sessions, and collaboration time. Topics cover not only fast graph algorithms in the classical setting, but also algorithms in various computational models such as dynamic, streaming, sublinear, and distributed. We aim to foster an environment for cultivation of ideas and collaborations, leading to further advancements in the area.
Registration is free but required (deadline: June 4, 2023). There are limited funds for travel support (apply by May 14, 2023). Call for posters is out (submit by May 28, 2023).
Organizers: Prantar Ghosh, Zihan Tan, Nicole Wein (DIMACS)
March 27-31, 2023
University of Warwick, Coventry, UK
Algebraic Complexity Theory is a vibrant field that has been seeing a tremendous amount of activity in the recent years. Its classical questions have been interwoven with deep questions from algebraic geometry, invariant theory, and representation theory. Researchers study a wide range of interlinked topics: arithmetic circuit lower bounds, algorithmic algebra, algorithmic invariant theory, geometric complexity theory, tensor rank, polynomial identity testing, and polynomial reconstruction, to name a few. The workshop brings together experts from different parts of this rich field to discuss the current state of the art, discover new connections, and set the directions for the future.
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
December 9-10, 2021
Virtual(on Gather.Town) Please register here(free): (https://forms.gle/Kpqe4xBb9fAzGBX78) to get access to the Gather.town login information (we will send it the day before the event). https://theory.cs.northwestern.edu/events/2021-junior-theorists-workshop/
The 2021 Junior Theorists Workshop is part of the Northwestern CS Quarterly Theory Workshop Series. The focus of this workshop will be on junior researchers in all areas of theoretical computer science.
November 16, 2021
As machine learning systems are being deployed in almost every aspect of decision-making, it is vital for them to be reliable and secure to adversarial corruptions and perturbations of various kinds. This workshop will explore newer notions of robustness and the different challenges that arise in designing reliable ML algorithms. Topics include test-time robustness, adversarial perturbations, distribution shifts, and explore connections between robustness and other areas. The workshop speakers are Aleksander Madry, Gautam Kamath, Kamalika Chaudhuri, Pranjal Awasthi and Sebastien Bubeck. Please register at the webpage given below for free to participate in the virtual workshop.