Alek Westover

Right now I'm working on AI safety at Redwood Research.
I recently graduated from MIT where I studied Math, CS and AI.
Before working on AI safety I did theoretical comptuer science research
(data structures, online algorithms, and algorithmic graph theory).

Alek's CV
Email: alek dot westover at gmail dot com

Blog

I occasionally put some unpolished thoughts on my blog here. 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" (ITCS'25)
  Virginia Vassilevska Williams, Alek Westover

• "The Diamond Test: A Novel Direct Sum / Affinity Test" (ITCS'25)
  Alek Westover, Edward Yu, Kai Zheng

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

• "Interrater Reliability Estimation via Maximum Likelihood for Gwet’s Chance Agreement Model." (OJoS'24)
  Westover, Alek M., Tara M. Westover, and M. Brandon Westover.

• “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