Jakob Nogler

13 papers A* 4A 1Journal 7Unranked 1
YearRankTypeTitle / Venue / Authors
2026 A conf
Hardness of Dynamic Tree Edit Distance and Friends.
ITCS
Bingbing Hu, Jakob Nogler, Barna Saha
2025 A* conf
Faster Weighted and Unweighted Tree Edit Distance and APSP Equivalence.
STOC
Jakob Nogler, Adam Polak, Barna Saha, Virginia Vassilevska Williams, Yinzhan Xu, Christopher Ye
2025 J jnl
Hardness of Dynamic Tree Edit Distance and Friends.
CoRR
Bingbing Hu, Jakob Nogler, Barna Saha
2025 A* conf
Near-Optimal-Time Quantum Algorithms for Approximate Pattern Matching.
SODA
Tomasz Kociumaka, Jakob Nogler, Philip Wellnitz
2024 J jnl
Faster Weighted and Unweighted Tree Edit Distance and APSP Equivalence.
CoRR
Jakob Nogler, Adam Polak, Barna Saha, Virginia Vassilevska Williams, Yinzhan Xu, Christopher Ye
2024 J jnl
Near-Optimal-Time Quantum Algorithms for Approximate Pattern Matching.
CoRR
Tomasz Kociumaka, Jakob Nogler, Philip Wellnitz
2024 A* conf
On the Communication Complexity of Approximate Pattern Matching.
STOC
Tomasz Kociumaka, Jakob Nogler, Philip Wellnitz
2024 J jnl
On the Communication Complexity of Approximate Pattern Matching.
CoRR
Tomasz Kociumaka, Jakob Nogler, Philip Wellnitz
2024 J jnl
Quantum Speed-Ups for String Synchronizing Sets, Longest Common Substring, and
ACM Trans. Algorithms
Ce Jin, Jakob Nogler
2024 — conf
The Geometry of Cyclical Social Trends.
CDC
Bernard Chazelle, Kritkorn Karntikoon, Jakob Nogler
2024 J jnl
The Geometry of Cyclical Social Trends.
CoRR
Bernard Chazelle, Kritkorn Karntikoon, Jakob Nogler
2023 A* conf
Quantum Speed-ups for String Synchronizing Sets, Longest Common Substring, and
SODA
Ce Jin, Jakob Nogler
2022 J jnl
Quantum Speed-ups for String Synchronizing Sets, Longest Common Substring, and k-mismatch Matching.
CoRR
Ce Jin, Jakob Nogler