August 16-18, 2023
Columbia University, New York
https://mihalisfest.cs.columbia.edu/

Professor Mihalis Yannakakis has been one of the leading lights in theoretical computer science for many years. He has made deep and lasting contributions to an extraordinary range of research areas, including algorithms and complexity theory, combinatorial optimization, automated verification and testing theory, and database theory. This workshop will bring together leading researchers in computer science to celebrate Yannakakis’ 70th birthday, and to survey the state of the art and future horizons in the various research areas that have been strongly influenced by Yannakakis’ work.

June 12-16, 2023
MIT, Building 1, Room 1-190
https://fodsi.us/ccsi.html

FODSI @ MIT is organizing tutorial lectures and a workshop on the Computational Complexity of Statistical Inference The workshop will cover topics pertaining to the computational complexity of statistical inference. The workshop (June 14-16) will be preceded by two days of tutorials (June 12-13) on a range of broadly related topics including fine-grained complexity, Markov chain mixing, and connections to cryptography and statistical physics. The workshop is open to all, but registration is required.
.

June 12-15, 2023
DIMACS, Rutgers University, Piscataway, NJ
https://sites.google.com/view/dimacswmtga

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
https://www.dcs.warwick.ac.uk/~u2270030/wact

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
MIT
https://fodsi.us/sublinear.html

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 an​d 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
https://www.ideal.northwestern.edu/events/high-dimensional-analysis/

Speakers
Ainesh Bakshi (Carnegie Mellon University), Arnold Filtser (Bar Ilan University), Weiyun Ma (Stanford University), Assaf Naor (Princeton University), Erik Waingarten (Stanford University)

Logistics
Dates: Friday, May 27
Location: Northwestern University
Rooms: Mudd 3514
Streaming: Zoom

Registration Link on website-
https://www.ideal.northwestern.edu/events/high-dimensional-analysis/

PRELIMINARY Schedule
All times are in the Central Time Zone (CDT; Chicago time).

9:30: Breakfast
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