Faster Sparse Suffix Sorting

Tomohiro I, Juha Kärkkäinen, Dominik Kempa

Forskningsoutput: Kapitel i bok/rapport/konferenshandlingKonferensbidragVetenskapligPeer review

Originalspråkengelska
Titel på gästpublikation31st International Symposium on Theoretical Aspects of Computer Science (STACS 2014)
RedaktörerErnst W. Mayr, Natacha Portier
Antal sidor11
UtgivningsortWadern
FörlagSchloss Dagstuhl - Leibniz-Zentrum für Informatik
Utgivningsdatum2014
Sidor386-396
ISBN (elektroniskt)978-3-939897-65-1
DOI
StatusPublicerad - 2014
MoE-publikationstypA4 Artikel i en konferenspublikation
EvenemangSymposium on Theoretical Aspects of Computer Science - Lyon, Frankrike
Varaktighet: 5 mar 20148 mar 2014
Konferensnummer: 31

Publikationsserier

NamnLeibniz International Proceedings in Informatics (LIPIcs)
FörlagSchloss Dagstuhl-Leibniz-Zentrum fuer Informatik
Volym25
ISSN (tryckt)1868-8969

Bibliografisk information

Jufo_ID: 59045 ; lyhenne: STACS.
Volume:
Proceeding volume:

Vetenskapsgrenar

  • 113 Data- och informationsvetenskap

Citera det här

I, T., Kärkkäinen, J., & Kempa, D. (2014). Faster Sparse Suffix Sorting. I E. W. Mayr, & N. Portier (Red.), 31st International Symposium on Theoretical Aspects of Computer Science (STACS 2014) (s. 386-396). (Leibniz International Proceedings in Informatics (LIPIcs); Vol. 25). Wadern: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.STACS.2014.386
I, Tomohiro ; Kärkkäinen, Juha ; Kempa, Dominik. / Faster Sparse Suffix Sorting. 31st International Symposium on Theoretical Aspects of Computer Science (STACS 2014). redaktör / Ernst W. Mayr ; Natacha Portier. Wadern : Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2014. s. 386-396 (Leibniz International Proceedings in Informatics (LIPIcs)).
@inproceedings{5d1289cd06764efc9aced7c3d0fd4b9c,
title = "Faster Sparse Suffix Sorting",
keywords = "113 Computer and information sciences, string algorithms, sparse suffix sorting, sparse suffix trees, Karp-Rabin fingerprints, space-time tradeoffs",
author = "Tomohiro I and Juha K{\"a}rkk{\"a}inen and Dominik Kempa",
note = "Jufo_ID: 59045 ; lyhenne: STACS. Volume: Proceeding volume:",
year = "2014",
doi = "10.4230/LIPIcs.STACS.2014.386",
language = "English",
series = "Leibniz International Proceedings in Informatics (LIPIcs)",
publisher = "Schloss Dagstuhl - Leibniz-Zentrum f{\"u}r Informatik",
pages = "386--396",
editor = "Mayr, {Ernst W.} and Natacha Portier",
booktitle = "31st International Symposium on Theoretical Aspects of Computer Science (STACS 2014)",
address = "Germany",

}

I, T, Kärkkäinen, J & Kempa, D 2014, Faster Sparse Suffix Sorting. i EW Mayr & N Portier (red), 31st International Symposium on Theoretical Aspects of Computer Science (STACS 2014). Leibniz International Proceedings in Informatics (LIPIcs), vol. 25, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, Wadern, s. 386-396, Symposium on Theoretical Aspects of Computer Science, Lyon, Frankrike, 05/03/2014. https://doi.org/10.4230/LIPIcs.STACS.2014.386

Faster Sparse Suffix Sorting. / I, Tomohiro; Kärkkäinen, Juha; Kempa, Dominik.

31st International Symposium on Theoretical Aspects of Computer Science (STACS 2014). red. / Ernst W. Mayr; Natacha Portier. Wadern : Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2014. s. 386-396 (Leibniz International Proceedings in Informatics (LIPIcs); Vol. 25).

Forskningsoutput: Kapitel i bok/rapport/konferenshandlingKonferensbidragVetenskapligPeer review

TY - GEN

T1 - Faster Sparse Suffix Sorting

AU - I, Tomohiro

AU - Kärkkäinen, Juha

AU - Kempa, Dominik

N1 - Jufo_ID: 59045 ; lyhenne: STACS. Volume: Proceeding volume:

PY - 2014

Y1 - 2014

KW - 113 Computer and information sciences

KW - string algorithms

KW - sparse suffix sorting

KW - sparse suffix trees

KW - Karp-Rabin fingerprints

KW - space-time tradeoffs

U2 - 10.4230/LIPIcs.STACS.2014.386

DO - 10.4230/LIPIcs.STACS.2014.386

M3 - Conference contribution

T3 - Leibniz International Proceedings in Informatics (LIPIcs)

SP - 386

EP - 396

BT - 31st International Symposium on Theoretical Aspects of Computer Science (STACS 2014)

A2 - Mayr, Ernst W.

A2 - Portier, Natacha

PB - Schloss Dagstuhl - Leibniz-Zentrum für Informatik

CY - Wadern

ER -

I T, Kärkkäinen J, Kempa D. Faster Sparse Suffix Sorting. I Mayr EW, Portier N, redaktörer, 31st International Symposium on Theoretical Aspects of Computer Science (STACS 2014). Wadern: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. 2014. s. 386-396. (Leibniz International Proceedings in Informatics (LIPIcs)). https://doi.org/10.4230/LIPIcs.STACS.2014.386