( en | de | ru )

 

Disambiguation of "Larsson, N. Jesper"

Author of the publication

copydeleteadd this publication to your clipboard
Most Recent Match Queries in On-Line Suffix Trees.

. CPM, volume 8486 of Lecture Notes in Computer Science, page 252-261. Springer, (2014)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Jesper Larsson Träff

n n n

Jesper Dieckmann

Zur (Psycho-)Pharmakologie halluzinogener Tryptamin-Derivate: eine Literaturübersicht mit besonderer Berücksichtigung der Schizophrenieforschung. MedH Hannover, (2009)

Andreas Larsson

Willi Larsson

 

Other publications of authors with the same name

Run-Length Encoding in a Finite Universe.. SPIRE, volume 11811 of Lecture Notes in Computer Science, page 355-371. Springer, (2019)Considerations and Algorithms for Compression of Sets.. DCC, page 503. IEEE, (2013)Efficient Representation for Online Suffix Tree Construction., , and . SEA, volume 8504 of Lecture Notes in Computer Science, page 400-411. Springer, (2014)Extended Application of Suffix Trees to Data Compression.. Data Compression Conference, page 190-199. IEEE Computer Society, (1996)Structures of String Matching and Data Compression.. Lund University, Sweden, (1999)base-search.net (ftulundlup:oai:lup.lub.lu.se:c6646122-e480-4d3f-98f0-8a1b6cefea84).Offline Dictionary-Based Compression., and . Data Compression Conference, page 296-305. IEEE Computer Society, (1999)The Context Trees of Block Sorting Compression.. Data Compression Conference, page 189-198. IEEE Computer Society, (1998)The CAP theorem versus databases with relaxed ACID properties., , , and . ICUIMC, page 78:1-78:7. ACM, (2014)Most Recent Match Queries in On-Line Suffix Trees.. CPM, volume 8486 of Lecture Notes in Computer Science, page 252-261. Springer, (2014)