Alek Westover

I'm an undergraduate at MIT studying Math+CS.
I've done research in data structures, online algorithms, and algorithmic graph theory.
Recently, I've been thinking about AI safety.

Alek's CV
Email: alekw at mit dot edu

Blog

I keep a blog here. Roughly speaking, my posts fall into the following categories:

1. Technical notes (Math/TCS/ML/AI safety).
2. Life Optimization.
3. Philosophy.

Publications

• "Listing 6-Cycles in Sparse Graphs"
  Virginia Vassilevska Williams, Alek Westover
  To appear in ITCS'25.

• "The Diamond Test: A Novel Direct Sum / Affinity Test"
  Alek Westover, Edward Yu, Kai Zheng
  To appear in ITCS'25.

• "When to Give Up on a Parallel Implementation"
  Nathan S. Sheffield, Alek Westover
  To appear in ITCS'25.

• "Interrater Reliability Estimation via Maximum Likelihood for Gwet’s Chance Agreement Model."
  Westover, Alek M., Tara M. Westover, and M. Brandon Westover.
  Open Journal of Statistics 14.5 (2024): 481-491.

• “A Nearly Quadratic Improvement for Memory Reallocation” (SPAA'24) (Slides)
  Martin Farach-Colton, William Kuszmaul, Nathan Sheffield, and Alek Westover

• “Scheduling Jobs with Work-Inefficient Parallel Solutions” (SPAA'24) (Slides)
  William Kuszmaul and Alek Westover

• “Complexity of Multiple-Hamiltonicity in Graphs of Bounded Degree”
  Brian Liu, Nathan S. Sheffield, Alek Westover

• “On the Relationship Between Several Variants of the Linear Hashing Conjecture”
  Alek Westover

• “The Variable-Processor Cup Game” (ITCS'21) (Slides)
  William Kuszmaul and Alek Westover

• “Cache-Efficient Parallel-Partition Algorithms using Exclusive-Read-and-Write Memory” (SPAA'20) (Animation) (GitHub)
  William Kuszmaul and Alek Westover