Here is most of the research work I did from 1995 to 1999, as a postgraduate student and member of the algorithms research group at the Department of Computer Science at Lund University. It concerns data structures for searching sequential data (particularly suffix trees) and reversible compression of sequential data.
The work is all summed up in the Ph.D. thesis Structures of String Matching and Data Compression, which contains the most accurate and comprehensible versions of results contained in the other documents below. The other documents serve the purpose of showing how results were originally published and giving credit to the coauthors.
These documents, and the source code, were previously available via my Lund University homepage. Since that page was removed, this site is kindly hosted by Mark Nelson in order to keep the files available online, and linked from his data compression info site.
Since august 2000 I am head of research at Apptus Technologies working mainly with our search engine and database platforms. We have not yet published any of our results and methods, but hopefully we will eventually find the time to do so.
I write this blog to try to get a discussion about our findings.
To avoid being confused with other people named Jesper Larsson (in particular fellow computer scientist Jesper Larsson Träff; not that I have anything against him, he is just not me) I sometimes use my first initial. Thus, I am listed as N. Jesper Larsson in the publications below.