The paper "Deterministic Dynamic Maximal Matching in Sublinear Update Time" by Aaron Bernstein, Sayan Bhattacharya, Peter Kiss, and Thatchaphol Saranurak will appear at the ACM Symposium on Theory of Computing (STOC 2025).
