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="Vildh{\o}j, Hjalte Wedel"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
String indexing for patterns with wildcards
Philip Bille
,
Inge Li Grtz
,
Hjalte Wedel Vildhj
,
Sren Vind
Theory of Computing Systems
55
(1), 2014, pp. 41-60
Sublinear space algorithms for the longest common substring problem
Tomasz Kociumaka
,
Tatiana Starikovskaya
,
Hjalte Wedel Vildhj
Lecture Notes in Computer Science
8737
, 2014, pp. 605-617
Fingerprints in compressed strings
Philip Bille
,
Patrick Hagge Cording
,
Inge Li Grtz
,
Benjamin Sach
,
Hjalte Wedel Vildhj
,
Sren Vind
Lecture Notes in Computer Science
8037
, 2013, pp. 146-157
Sparse suffix tree construction in small space
Philip Bille
,
Johannes Fischer
,
Inge Li Grtz
,
Tsvi Kopelowitz
,
Benjamin Sach
,
Hjalte Wedel Vildhj
Lecture Notes in Computer Science
7965
, 2013, pp. 148-159
Time-space trade-offs for the longest common substring problem
Tatiana Starikovskaya
,
Hjalte Wedel Vildhj
Lecture Notes in Computer Science
7922
, 2013, pp. 223-234
Time-space trade-offs for longest common extensions
Philip Bille
,
Inge Li Grtz
,
Benjamin Sach
,
Hjalte Wedel Vildhj
Lecture Notes in Computer Science
7354
, 2012, pp. 293-305
String indexing for patterns with wildcards
Philip Bille
,
Inge Li Grtz
,
Hjalte Wedel Vildhj
,
Sren Vind
Lecture Notes in Computer Science
7357
, 2012, pp. 283-294
String matching with variable length gaps
Philip Bille
,
Inge Li Grtz
,
Hjalte Wedel Vildhj
,
David Kofoed Wind
Theoretical Computer Science
443
, 2012, pp. 25-34