activity
20192026
most citedQuantifying Membership Inference Vulnerability via Generalization Gap and Other Model Metrics

10 citations · 13 across the 6 of their papers we have counts for

collaborators

10 papers

cs.DS2026

ZigZag Trie: A Novel Index for Contextual Queries

Ling Li, Daniel Gibney, Sharma V. Thankachan +3

There is increasing interest in queries about the context of a string in a longer text , i.e., the set of all string pairs , with , for a given , such t…

cs.DS2026

Average-Case Minimum-Weight Decoding of Two-Dimensional Color Codes

Daniel Gibney, Jackson Huffstutler, Kaamil Kaka

Color codes are an important family of topological quantum error-correcting codes, in part because they support a richer set of transversal logical gates than surface codes. Their…

cs.DS2025

Contextual Pattern Mining and Counting

Ling Li, Daniel Gibney, Sharma V. Thankachan +2

Given a string of length , a longer string of length , and two integers and , the context of in is the set of all string pairs , w…

cs.DS2023

Near-Optimal Quantum Algorithms for Bounded Edit Distance and Lempel-Ziv Factorization

Daniel Gibney, Ce Jin, Tomasz Kociumaka +1

Classically, the edit distance of two length- strings can be computed in time, whereas an -time procedure would falsify the Orthogonal Vectors Hypothesis. I…

cs.DS2023★ 2 cited

Compressibility-Aware Quantum Algorithms on Strings

Daniel Gibney, Sharma V. Thankachan

Sublinear time quantum algorithms have been established for many fundamental problems on strings. This work demonstrates that new, faster quantum algorithms can be designed when th…

cs.DS2022★ 1 cited

The Complexity of Approximate Pattern Matching on De Bruijn Graphs

Daniel Gibney, Sharma V. Thankachan, Srinivas Aluru

Aligning a sequence to a walk in a labeled graph is a problem of fundamental importance to Computational Biology. For finding a walk in an arbitrary graph with edges that exa…