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.
From late 1999 to August 2010 I was out of academia (most of which time I spent as head of research at Apptus Technologies), and did not publish any new research, although the journal version of Faster Suffix Sorting was finally published in 2007.
As of August 2010 I am back in academia as assistant professor at the IT University of Copenhagen, and will eventually have produced some new research, which you might find here or elsewhere. It is not particularly likely to be about suffix trees or compression, but it is too early to be certain. The best way to keep up with me right now is to follow me on Twitter
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.