Erik Kronke
Theoretical computer science, KTH Royal Institute of Technology
I'm a final-year master's student in theoretical computer science at KTH in Stockholm, graduating in 2027. My interests are in algorithms and computational complexity, and in the probability and combinatorics that hold them together.
I'm also interested in how groups solve hard problems together: how to split a problem, share partial progress, and avoid everyone getting stuck in the same place.
This is where I share ideas I think are too nice to keep to myself, and where I work them out until I actually understand them, with full derivations and small interactive figures along the way.
Selected writing
All writing-
The birthday problem, and why 64-bit hashes collide sooner than you think
Why 23 people are enough for a shared birthday, and why a 64-bit hash already collides after about 5 billion items.
Selected projects
All projects-
Autumn 2026
Sketching for Linear Algebra
An individual research project on randomized sketching for linear algebra. It studies how random linear maps such as Gaussian, CountSketch and SRHT matrices compress large matrices while preserving their geometry, and how this underpins fast algorithms for least squares and the randomized SVD. The project combines proofs of the core guarantees with experiments that test predictions from recent research.