Jakob Nogler

According to our database, Jakob Nogler authored at least 6 papers between 2022 and 2025.

Collaborative distances:

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

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

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

Ce Jin, Jakob Nogler

ACM Trans. Algorithms, October, 2024

Faster Weighted and Unweighted Tree Edit Distance and APSP Equivalence.

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

CoRR, 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

2022

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

Ce Jin, Jakob Nogler

CoRR, 2022