N. Jesper Larsson

17 papers B 7C 1Journal 7Unranked 1
YearRankTypeTitle / Venue / Authors
2019 C conf
Run-Length Encoding in a Finite Universe.
SPIRE
N. Jesper Larsson
2019 J jnl
Run-Length Encoding in a Finite Universe.
CoRR
N. Jesper Larsson
2014 B conf
Efficient Representation for Online Suffix Tree Construction.
SEA
N. Jesper Larsson, Kasper Fuglsang, Kenneth Karlsson
2014 J jnl
Efficient Representation for Online Suffix Tree Construction.
CoRR
N. Jesper Larsson, Kasper Fuglsang, Kenneth Karlsson
2014 J jnl
Integer Set Compression and Statistical Modeling.
CoRR
N. Jesper Larsson
2014 J jnl
Most Recent Match Queries in On-Line Suffix Trees (with appendix).
CoRR
N. Jesper Larsson
2014 B conf
Most Recent Match Queries in On-Line Suffix Trees.
CPM
N. Jesper Larsson
2014 — conf
The CAP theorem versus databases with relaxed ACID properties.
ICUIMC
Lars Frank, Rasmus Ulslev Pedersen, Christian Havnø Frank, N. Jesper Larsson
2013 B conf
Considerations and Algorithms for Compression of Sets.
DCC
N. Jesper Larsson
2007 J jnl
Faster suffix sorting.
Theor. Comput. Sci.
N. Jesper Larsson, Kunihiko Sadakane
2000 J jnl
Off-line dictionary-based compression.
Proc. IEEE
N. Jesper Larsson, Alistair Moffat
1999 B conf
Offline Dictionary-Based Compression.
Data Compression Conference
N. Jesper Larsson, Alistair Moffat
1999 — —
Structures of String Matching and Data Compression.
N. Jesper Larsson
1999 J jnl
Suffix Trees on Words.
Algorithmica
Arne Andersson, N. Jesper Larsson, Kurt Swanson
1998 B conf
The Context Trees of Block Sorting Compression.
Data Compression Conference
N. Jesper Larsson
1996 B conf
Extended Application of Suffix Trees to Data Compression.
Data Compression Conference
N. Jesper Larsson
1996 B conf
Suffix Trees on Words.
CPM
Arne Andersson, N. Jesper Larsson, Kurt Swanson