Meetings Link to heading

This is where we publish all of our weekly content, along with any other related material. These will be listed in reverse chronological order. If there is anything missing, let us know.

Spring 2026 Link to heading

  • Jeff - 3SUM [slides]
  • Mihir - E-Graphs [slides]
  • Jack - Graphons [slides]
  • Ian - Parallel Graph Algorithms [slides] [source] (joint meeting with SIAM)
  • Navid - Shortest Paths [slides]
  • Ian - Dynamic Graph Connectivity [slides] [source]
  • Franklin - Rolling and XOR Hashing

Fall 2025 Link to heading

  • Ian - Linear Time Minimum Spanning Tree [slides] [source]
  • Patrick - Semi-Random Methods in Graph Theory
  • Prithiv - Derandomization
  • Sasha - Quantum Complexity
  • Akshay - Data Fusion
  • Nhi - Choosability on Multipartite Graphs
  • Prithiv - Minimum Enclosing Circle
  • Ian - Generating Random Samples [slides] [source]
  • Porter - Distributed Leader Election [slides] [source] [video]

Spring 2025 Link to heading

Fall 2024 Link to heading

Spring 2024 Link to heading

Trading depth for breadth, this semester will have no central theme! If you are interested in presenting, please see Discord and reach out!

Fall 2023 Link to heading

This semester’s theme was about all things related to coding theory! This can range from sphere packing, complexity, error correcting codes, and more.

Spring 2023 Link to heading

This semester, we ran meetings about combinatorial structures and algorithms. Much of the material is being based out of Donald Knuth’s “The Art of Computer of Computer Programming” Volumes 4A and 4B. We will also probably look into other sources as the field is quite vast.

Fall 2022 Link to heading

This semester was our first semester! As such, we decided to start with some more introductory material. The material was loosely based on Michael Sipser’s “Introduction to the Theory of Computation”