2 citations · 4 across the 3 of their papers we have counts for
4 papers
Run-Length Encoding in a Finite Universe
N. Jesper Larsson
Text compression schemes and compact data structures usually combine sophisticated probability models with basic coding methods whose average codeword length closely match the entr…
Most Recent Match Queries in On-Line Suffix Trees (with appendix)
N. Jesper Larsson
A suffix tree is able to efficiently locate a pattern in an indexed string, but not in general the most recent copy of the pattern in an online stream, which is desirable in some a…
Efficient Representation for Online Suffix Tree Construction
N. Jesper Larsson, Kasper Fuglsang, Kenneth Karlsson
Suffix tree construction algorithms based on suffix links are popular because they are simple to implement, can operate online in linear time, and because the suffix links are ofte…
Integer Set Compression and Statistical Modeling
N. Jesper Larsson
Compression of integer sets and sequences has been extensively studied for settings where elements follow a uniform probability distribution. In addition, methods exist that exploi…