N. Jesper Larsson

According to our database1, N. Jesper Larsson authored at least 14 papers between 1996 and 2019.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2019
Run-Length Encoding in a Finite Universe.
Proceedings of the String Processing and Information Retrieval, 2019

2014
Most Recent Match Queries in On-Line Suffix Trees (with appendix).
CoRR, 2014

Integer Set Compression and Statistical Modeling.
CoRR, 2014

Efficient Representation for Online Suffix Tree Construction.
Proceedings of the Experimental Algorithms - 13th International Symposium, 2014

The CAP theorem versus databases with relaxed ACID properties.
Proceedings of the 8th International Conference on Ubiquitous Information Management and Communication, 2014

Most Recent Match Queries in On-Line Suffix Trees.
Proceedings of the Combinatorial Pattern Matching - 25th Annual Symposium, 2014

2013
Considerations and Algorithms for Compression of Sets.
Proceedings of the 2013 Data Compression Conference, 2013

2007
Faster suffix sorting.
Theor. Comput. Sci., 2007

2000
Off-line dictionary-based compression.
Proc. IEEE, 2000

1999
Structures of String Matching and Data Compression.
PhD thesis, 1999

Suffix Trees on Words.
Algorithmica, 1999

Offline Dictionary-Based Compression.
Proceedings of the Data Compression Conference, 1999

1998
The Context Trees of Block Sorting Compression.
Proceedings of the Data Compression Conference, 1998

1996
Extended Application of Suffix Trees to Data Compression.
Proceedings of the 6th Data Compression Conference (DCC '96), Snowbird, Utah, USA, March 31, 1996


  Loading...