Search filters

List of works by Philip Bille

A separation between RLSLPs and LZ77

Compact q-Gram Profiling of Compressed Strings

Compact q-gram profiling of compressed strings

Compressed Communication Complexity of Longest Common Prefixes

article by Philip Bille et al published 2018 in Lecture Notes in Computer Science

Compressed Data Structures for Range Searching

Compressed Subsequence Matching and Packed Tree Coloring

Compressed Subsequence Matching and Packed Tree Coloring

Dynamic Relative Compression, Dynamic Partial Sums, and Substring Concatenation

Fast Arc-Annotated Subsequence Matching in Linear Space

Fast Arc-Annotated Subsequence Matching in Linear Space

Finger Search in Grammar-Compressed Strings

Fingerprints in Compressed Strings

Fingerprints in compressed strings

From a 2D Shape to a String Structure Using the Symmetry Set

Immersive Algorithms

scholarly article published 2017

Improved Approximate String Matching and Regular Expression Matching on Ziv-Lempel Compressed Texts

Improved approximate string matching and regular expression matching on Ziv-Lempel compressed texts

Indexing Motion Detection Data for Surveillance Video

Longest Common Extensions in Sublinear Space

Longest Common Extensions in Trees

Longest Common Extensions via Fingerprinting

Longest common extensions in trees

Matching subsequences in trees

Space-Efficient Re-Pair Compression

Sparse Suffix Tree Construction in Small Space

Sparse Text Indexing in Small Space

String Indexing for Patterns with Wildcards

Theory of Computing Systems article

String Indexing for Patterns with Wildcards

SWAT 2012 article

String Indexing for Top-k Close Consecutive Occurrences

scientific article published in January 2020

String matching with variable length gaps

Subsequence Automata with Default Transitions

Subsequence automata with default transitions

Substring Range Reporting

Substring Range Reporting

The tree inclusion problem

Tight Bounds for Top Tree Compression

Time-Space Trade-Offs for Longest Common Extensions

Time–space trade-offs for longest common extensions

Tree Compression with Top Trees

Tree compression with top trees