Adaptive Dynamic Bitvectors
Lecture Notes in Computer Science, 2025
Compressed Graph Representations for Evaluating Regular Path Queries
Lecture Notes in Computer Science, 2025
Clustering-based compression for raster time series
COMPUTER JOURNAL, 2024
Dynamic compact data structure for temporal reachability with unsorted contact insertions
COMPUTER JOURNAL, 2024
A Textbook Solution for Dynamic Strings
Leibniz International Proceedings in Informatics, LIPIcs, 2024
MillenniumDB: A Multi-modal, Multi-model Graph Database
Proceedings of the ACM SIGMOD International Conference on Management of Data, 2024
BAT-LZ out of hell
Leibniz International Proceedings in Informatics, LIPIcs, 2024
Space & Time Efficient Leapfrog Triejoin
Proceedings of the 7th ACM SIGMOD Joint International Workshop on Graph Data Management Experiences and Systems, (GRADES) and Network Data Analytics, (NDA), GRADES-NDA 2024, 2024
Taxonomic Classification with Maximal Exact Matches in KATKA Kernels and Minimizer Digests
Leibniz International Proceedings in Informatics, LIPIcs, 2024
Tackling Challenges in Implementing Large-Scale Graph Databases
COMMUNICATIONS OF THE ACM, 2024
Faster Maximal Exact Matches with Lazy LCP Evaluation
Data Compression Conference Proceedings, 2024
The Ring: Worst-case Optimal Joins in Graph Databases using (Almost) No Extra Space
ACM TRANSACTIONS ON DATABASE SYSTEMS, 2024
Two-Dimensional Block Trees
COMPUTER JOURNAL, 2024
Wheeler Maps
Lecture Notes in Computer Science, 2024
Space-Efficient Conversions from SLPs
Lecture Notes in Computer Science, 2024
Iterated Straight-Line Programs
Lecture Notes in Computer Science, 2024
Optimizing RPQs over a compact graph representation
VLDB JOURNAL, 2024
Near-Optimal Search Time in d-Optimal Space, and Vice Versa
ALGORITHMICA, 2024
Constant Time and Space Updates for the Sigma-Tau Problem
Lecture Notes in Computer Science, 2023
A Simple Grammar-Based Index for Finding Approximately Longest Common Substrings
Lecture Notes in Computer Science, 2023
Evaluating Regular Path Queries on Compressed Adjacency Matrices
Lecture Notes in Computer Science, 2023
MillenniumDB: An Open-Source Graph Database System
DATA INTELLIGENCE, 2023
Computing MEMs on Repetitive Text Collections
Leibniz International Proceedings in Informatics, LIPIcs, 2023
L-Systems for Measuring Repetitiveness
Leibniz International Proceedings in Informatics, LIPIcs, 2023
Compact Data Structures Meet Databases
Leibniz International Proceedings in Informatics, LIPIcs, 2023
Compact representations of spatial hierarchical structures with support for topological queries
INFORMATION AND COMPUTATION, 2023
Toward a Definitive Compressibility Measure for Repetitive Sequences
IEEE TRANSACTIONS ON INFORMATION THEORY, 2023
Space/time-efficient RDF stores based on circular suffix sorting
JOURNAL OF SUPERCOMPUTING, 2023
Efficient Construction of the BWT for Repetitive Text Using String Compression
INFORMATION AND COMPUTATION, 2023
Faster compressed quadtrees
JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 2023
Navigating planar topologies in near-optimal space and time
COMPUTATIONAL GEOMETRY-THEORY AND APPLICATIONS, 2023
Efficient Construction of the BWT for Repetitive Text Using String Compression
Leibniz International Proceedings in Informatics, LIPIcs, 2022
Grammar Compression by Induced Suffix Sorting
Journal of Experimental Algorithmics, 2022
Graph Compression for Adjacency-Matrix Multiplication
SN Computer Science, 2022
Correction to: Graph Compression for Adjacency-Matrix Multiplication (SN Computer Science, (2022), 3, 3, (193), 10.1007/s42979-022-01084-2)
SN Computer Science, 2022
Bi-Directional r-Indexes
Leibniz International Proceedings in Informatics, LIPIcs, 2022
Balancing Run-Length Straight-Line Programs
Lecture Notes in Computer Science, 2022
Near-Optimal Search Time in d -Optimal Space
Lecture Notes in Computer Science, 2022
HOLZ: High-Order Entropy Encoding of Lempel-Ziv Factor Distances
Data Compression Conference Proceedings, 2022
Time- and Space-Efficient Regular Path Queries
Proceedings - International Conference on Data Engineering, 2022
Improving Matrix-vector Multiplication via Lossless Grammar-Compressed Matrices
PROCEEDINGS OF THE VLDB ENDOWMENT, 2022
Total mutational load and clinical features as predictors of the metastatic status in lung adenocarcinoma and squamous cell carcinoma patients
JOURNAL OF TRANSLATIONAL MEDICINE, 2022
Faster repetition-aware compressed suffix trees based on Block Trees
INFORMATION AND COMPUTATION, 2022
A practical succinct dynamic graph representation
INFORMATION AND COMPUTATION, 2022
Optimal Joins Using Compressed Quadtrees
ACM TRANSACTIONS ON DATABASE SYSTEMS, 2022
The Compression Power of the BWT
COMMUNICATIONS OF THE ACM, 2022
Efficient and compact representations of some non-canonical prefix-free codes
THEORETICAL COMPUTER SCIENCE, 2022
Engineering Practical Lempel-Ziv Tries
Journal of Experimental Algorithmics, 2021
On Stricter Reachable Repetitiveness Measures
Lecture Notes in Computer Science, 2021
An LMS-Based Grammar Self-index with Local Consistency Properties
Lecture Notes in Computer Science, 2021
PFP compressed suffix trees
Proceedings of the Workshop on Algorithm Engineering and Experiments, 2021
PHONI: Streamed Matching Statistics with Multi-Genome References
Data Compression Conference Proceedings, 2021
An index for moving objects with constant-time access to their compressed trajectories
INTERNATIONAL JOURNAL OF GEOGRAPHICAL INFORMATION SCIENCE, 2021
A grammar compressor for collections of reads with applications to the construction of the BWT
Data Compression Conference Proceedings, 2021
Compact Representation of Spatial Hierarchies and Topological Relationships
Data Compression Conference Proceedings, 2021
A Disk-Based Index for Trajectories with an In-Memory Compressed Cache
Data Compression Conference Proceedings, 2021
Of. N312