Daniel Gibney

List of research outcomes

This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!

Publication	Date of Publication	Type
Two-dimensional longest common extension queries in compact space	2026-06-24	Paper
Longest common substring with gaps and related problems	2026-05-26	Paper
Finding an optimal alphabet ordering for Lyndon factorization is hard	2026-04-21	Paper
Non-overlapping indexing in BWT-runs bounded space Theoretical Computer Science	2025-11-10	Paper
Near-optimal quantum algorithms for bounded edit distance and Lempel-Ziv factorization	2024-11-28	Paper
Feasibility of flow decomposition with subpath constraints in linear time	2024-08-13	Paper
Non-overlapping indexing in BWT-runs bounded space	2024-05-29	Paper
Simple reductions from formula-SAT to pattern matching on labeled graphs and subtree isomorphism	2024-05-14	Paper
Quantum time complexity and algorithms for pattern matching on labeled graphs String Processing and Information Retrieval	2023-08-04	Paper
scientific article; zbMATH DE number 7651104 (Why is no real title available?)	2023-02-07	Paper
scientific article; zbMATH DE number 7651154 (Why is no real title available?) (available as arXiv preprint)	2023-02-07	Paper
The Fine-Grained Complexity of Median and Center String Problems Under Edit Distance	2023-02-07	Paper
An Efficient Elastic-Degenerate Text Index? Not Likely 1511.68101	2022-12-22	Paper
Co-linear chaining with overlaps and gap costs	2022-08-30	Paper
The complexity of approximate pattern matching on de Bruijn graphs (available as arXiv preprint)	2022-08-30	Paper
On the Hardness and Inapproximability of Recognizing Wheeler Graphs (available as arXiv preprint)	2022-05-11	Paper
On the complexity of recognizing Wheeler graphs Algorithmica	2022-03-22	Paper
I/O-optimal categorical 3-sided skyline queries Theoretical Computer Science	2021-11-18	Paper

Research outcomes over time

This page was built for person: Daniel Gibney