Jakob Nogler
jnogler (at) mit (dot) edu 
About me
Hi there :)
I am a first-year PhD student at MIT, where I am fortunate to be advised by Virginia Vassilevska Williams.
This is my in progress personal webpage. Not much worked on it yet, but more to come!
Publications
-
Undirected Replacement Paths: Dual Fault Reduces to Single Source
Jakob Nogler,
Virginia Vassilevska Williams
- ICALP 2026
[arXiv]
-
The Communication Complexity of Pattern Matching with Edits Revisited
Tomasz Kociumaka,
Jakob Nogler,
Philip Wellnitz
- CPM 2026
[arXiv]
-
Hardness of Dynamic Tree Edit Distance and Friends
Bingbing Hu,
Jakob Nogler,
Barna Saha
- ITCS 2026
[arXiv]
[Slides (Short),
Slides (Long),
Recording @ ITCS 26]
-
Faster Weighted and Unweighted Tree Edit Distance and APSP Equivalence
Jakob Nogler,
Adam Polak,
Barna Saha,
Virginia Vassilevska Williams,
Yinzhan Xu,
Christopher Ye
- STOC 2025
[arXiv]
[Poster,
Slides (Short),
Slides (Long),
Recording @ STOC 25]
-
Near-Optimal-Time Quantum Algorithms for Approximate Pattern Matching
Tomasz Kociumaka,
Jakob Nogler,
Philip Wellnitz
- SODA 2025
[arXiv]
[Slides @ SODA 2025]
-
The Geometry of Cyclical Social Trends
Bernard Chazelle,
Kritkorn Karntikoon,
Jakob Nogler
- CDC 2024
[arXiv]
[Slides @ CDC 2024]
-
On the Communication Complexity of Approximate Pattern Matching
Tomasz Kociumaka,
Jakob Nogler,
Philip Wellnitz
- STOC 2024
[arXiv]
[Poster @ HALG 2024]
[Slides @ STOC 2024]
-
Quantum Speed-ups for String Synchronizing Sets, Longest Common Substring, and k-mismatch Matching
Ce Jin,
Jakob Nogler
- SODA 2023 & ACM TALG
[arXiv]
[Slides @ SODA 2023]
Seminar Talks
-
December 2024, Mittagsseminar @ ETH Zurich,
Master Thesis Presentation: Faster Tree Edit Distance via APSP Equivalence
[Slides]
-
October 2024, Theory Seminar @ UC San Diego,
On the Communication Complexity of Approximate Pattern Matching
[Slides]
