4 citations · 4 across the 2 of their papers we have counts for
4 papers
Fast Practical Compression of Deterministic Finite Automata
Philip Bille, Inge Li Gørtz, Max Rishøj Pedersen
We revisit the popular \emph{delayed deterministic finite automaton} (\ddfa{}) compression algorithm introduced by Kumar~et~al.~[SIGCOMM 2006] for compressing deterministic finite…
Sliding Window String Indexing in Streams
Philip Bille, Johannes Fischer, Inge Li Gørtz +2
Given a string over an alphabet , the 'string indexing problem' is to preprocess to subsequently support efficient pattern matching queries, i.e., given a pattern string…
Gapped Indexing for Consecutive Occurrences
Philip Bille, Inge Li Gørtz, Max Rishøj Pedersen +1
The classic string indexing problem is to preprocess a string S into a compact data structure that supports efficient pattern matching queries. Typical queries include existential…
String Indexing for Top- Close Consecutive Occurrences
Philip Bille, Inge Li Gørtz, Max Rishøj Pedersen +2
The classic string indexing problem is to preprocess a string into a compact data structure that supports efficient subsequent pattern matching queries, that is, given a patter…