2 |
A theoretical and experimental analysis of BWT variants for string collections ...
|
|
|
|
BASE
|
|
Show details
|
|
3 |
String Rearrangement Inequalities and a Total Order Between Primitive Words ...
|
|
|
|
BASE
|
|
Show details
|
|
4 |
Dynamic Suffix Array with Polylogarithmic Queries and Updates ...
|
|
|
|
BASE
|
|
Show details
|
|
5 |
An Optimal-Time RLBWT Construction in BWT-runs Bounded Space ...
|
|
|
|
BASE
|
|
Show details
|
|
6 |
Suffix tree-based linear algorithms for multiple prefixes, single suffix counting and listing problems ...
|
|
|
|
BASE
|
|
Show details
|
|
7 |
Reduction ratio of the IS-algorithm: worst and random cases ...
|
|
|
|
BASE
|
|
Show details
|
|
11 |
HOLZ: High-Order Entropy Encoding of Lempel-Ziv Factor Distances ...
|
|
|
|
BASE
|
|
Show details
|
|
13 |
A Note on the Performance of Algorithms for Solving Linear Diophantine Equations in the Naturals ...
|
|
|
|
Abstract:
We implement four algorithms for solving linear Diophantine equations in the naturals: a lexicographic enumeration algorithm, a completion procedure, a graph-based algorithm, and the Slopes algorithm. As already known, the lexicographic enumeration algorithm and the completion procedure are slower than the other two algorithms. We compare in more detail the graph-based algorithm and the Slopes algorithm. In contrast to previous comparisons, our work suggests that they are equally fast on small inputs, but the graph-based algorithm gets much faster as the input grows. We conclude that implementations of AC-unification algorithms should use the graph-based algorithm for maximum efficiency. ...
|
|
Keyword:
Data Structures and Algorithms cs.DS; FOS Computer and information sciences; Performance cs.PF
|
|
URL: https://dx.doi.org/10.48550/arxiv.2104.05200 https://arxiv.org/abs/2104.05200
|
|
BASE
|
|
Hide details
|
|
15 |
Lexicographically Fair Learning: Algorithms and Generalization ...
|
|
|
|
BASE
|
|
Show details
|
|
17 |
Dynamic Suffix Array with Sub-linear update time and Poly-logarithmic Lookup Time ...
|
|
|
|
BASE
|
|
Show details
|
|
18 |
The Labeled Direct Product Optimally Solves String Problems on Graphs ...
|
|
|
|
BASE
|
|
Show details
|
|
|
|