Jakob Nogler

According to our database, Jakob Nogler authored at least 9 papers between 2022 and 2026.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2026

Undirected Replacement Paths: Dual Fault Reduces to Single Source.

Jakob Nogler, Virginia Vassilevska Williams

CoRR, May, 2026

Hardness of Dynamic Tree Edit Distance and Friends.

Bingbing Hu, Jakob Nogler, Barna Saha

Proceedings of the 17th Innovations in Theoretical Computer Science Conference, 2026

The Communication Complexity of Pattern Matching with Edits Revisited.

Tomasz Kociumaka, Jakob Nogler, Philip Wellnitz

Proceedings of the 37th Annual Symposium on Combinatorial Pattern Matching, 2026

2025

Faster Weighted and Unweighted Tree Edit Distance and APSP Equivalence.

Jakob Nogler, Adam Polak, Barna Saha, Virginia Vassilevska Williams, Yinzhan Xu, Christopher Ye

Proceedings of the 57th Annual ACM Symposium on Theory of Computing, 2025

Near-Optimal-Time Quantum Algorithms for Approximate Pattern Matching.

Tomasz Kociumaka, Jakob Nogler, Philip Wellnitz

Proceedings of the 2025 Annual ACM-SIAM Symposium on Discrete Algorithms, 2025

2024

On the Communication Complexity of Approximate Pattern Matching.

Tomasz Kociumaka, Jakob Nogler, Philip Wellnitz

Proceedings of the 56th Annual ACM Symposium on Theory of Computing, 2024

The Geometry of Cyclical Social Trends.

Bernard Chazelle, Kritkorn Karntikoon, Jakob Nogler

Proceedings of the 63rd IEEE Conference on Decision and Control, 2024

2023

Quantum Speed-ups for String Synchronizing Sets, Longest Common Substring, and <i>k</i>-mismatch Matching.

Ce Jin, Jakob Nogler

Proceedings of the 2023 ACM-SIAM Symposium on Discrete Algorithms, 2023

2022

Quantum Speed-ups for String Synchronizing Sets, Longest Common Substring, and k-mismatch Matching.

Ce Jin, Jakob Nogler

CoRR, 2022