1
Finding all regex matches has always been O(n²)
every regex engine that promises linear time breaks that promise the moment you ask for all matches. the problem has been there since the 70s, hiding in the iteration loop.
phd student at taltech, working on automata theory, algorithms, fast search engines and solvers.
Visit iev.ee → RSS feedOn Hacker News Mar 2026 – Mar 2026
Software Engineering 3Systems & Performance 1Math & Algorithms 1Programming Languages 1
every regex engine that promises linear time breaks that promise the moment you ask for all matches. the problem has been there since the 70s, hiding in the iteration loop.