Fakultät für Informatik
-
Technische Universität München
Lehrstuhl für Effiziente Algorithmen
Die bibliographische Datenbank LEABib
Suchen
•
Liste der Journale
•
Liste der Serien
•
Liste der Konferenzen
•
Ausgewählte Publikationen
Hilfe
Suche: Author="Puglisi, Simon J."
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
String range matching
Juha Kärkkäinen
,
Dominik Kempa
,
Simon J. Puglisi
Lecture Notes in Computer Science
8486
, 2014, pp. 232-241
Order-preserving matching
Jinil Kim
,
Peter Eades
,
Rudolf Fleischer
,
Seok-Hee Hong
,
Costas S. Iliopoulos
,
Kunsoo Park
,
Simon J. Puglisi
,
Takeshi Tokuyama
Theoretical Computer Science
525
, 2014, pp. 68-79
Document retrieval on repetitive collections
Gonzalo Navarro
,
Simon J. Puglisi
,
Jouni Sirén
Lecture Notes in Computer Science
8737
, 2014, pp. 725-736
Enhanced string covering
Tomás̑ Flouri
,
Costas S. Iliopoulos
,
Tomasz Kociumaka
,
Solon P. Pissis
,
Simon J. Puglisi
,
W.F. Smyth
,
Wojciech Tyczyński
Theoretical Computer Science
506
, 2013, pp. 102-114
Document listing on repetitive collections
Travis Gagie
,
Kalle Karhu
,
Gonzalo Navarro
,
Simon J. Puglisi
,
Jouni Sirén
Lecture Notes in Computer Science
7922
, 2013, pp. 107-119
Colored range queries and document retrieval
Travis Gagie
,
Juha Kärkkäinen
,
Gonzalo Navarro
,
Simon J. Puglisi
Theoretical Computer Science
483
, 2013, pp. 36-50
Linear time Lempel-Ziv factorization: Simple, fast, small
Juha Kärkkäinen
,
Dominik Kempa
,
Simon J. Puglisi
Lecture Notes in Computer Science
7922
, 2013, pp. 189-200
New algorithms on wavelet trees and applications to information retrieval
Travis Gagie
,
Gonzalo Navarro
,
Simon J. Puglisi
Theoretical Computer Science
426-427
, 2012, pp. 25-41
Faster approximate pattern matching in compressed repetitive texts
Travis Gagie
,
Paweƚ Gawrychowski
,
Simon J. Puglisi
Lecture Notes in Computer Science
7074
, 2011, pp. 653-662
Top-
k
ranked document search in general text databases
J. Shane Culpepper
,
Gonzalo Navarro
,
Simon J. Puglisi
,
Andrew Turpin
Lecture Notes in Computer Science
6347
, 2010, pp. 194-205
Medium-space algorithms for inverse BWT
Juha Kärkkäinen
,
Simon J. Puglisi
Lecture Notes in Computer Science
6346
, 2010, pp. 451-462
Permuted longest-common-prefix array
Juha Kärkkäinen
,
Giovanni Manzini
,
Simon J. Puglisi
Lecture Notes in Computer Science
5577
, 2009, pp. 181-192
A fast hybrid short read fragment assembly algorithm
Bertil Schmidt
,
Ranjan Sinha
,
Bryan Beresford-Smith
,
Simon J. Puglisi
Bioinformatics
25
(17), 2009, pp. 2279-2280
SHREC: A short-read error correction method
Jan Schröder
,
Heiko Schröder
,
Simon J. Puglisi
,
Ranjan Sinha
,
Bertil Schmidt
Bioinformatics
25
(17), 2009, pp. 2157-2163
How many runs can a string contain?
Simon J. Puglisi
,
Jamie Simpson
,
W.F. Smyth
Theoretical Computer Science
401
(1-3), 2008, pp. 165-171
Space-time tradeoffs for longest-common-prefix array computation
Simon J. Puglisi
,
Andrew Turpin
Lecture Notes in Computer Science
5369
, 2008, pp. 124-135
Fast and practical algorithms for computing all the runs in a string
Gang Chen
,
Simon J. Puglisi
,
W.F. Smyth
Lecture Notes in Computer Science
4580
, 2007, pp. 307-315
A new periodicity lemma
Kangmin Fan
,
Simon J. Puglisi
,
W.F. Smyth
,
Andrew Turpin
SIAM Journal on Discrete Mathematics
20
(3), 2006, pp. 656-668