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
[1]
Hilfe
Suche: Author="Smyth, W.F."
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
A bijective variant of the Burrows-Wheeler Transform using
V
-order
Jacqueline W. Daykin
,
W.F. Smyth
Theoretical Computer Science
531
, 2014, pp. 77-89
A linear partitioning algorithm for Hybrid Lyndons using
v
-order
David E. Daykin
,
Jacqueline W. Daykin
,
W.F. Smyth
Theoretical Computer Science
483
, 2013, pp. 149-161
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
String comparison and Lyndon-like factorization using V-order in linear time
David E. Daykin
,
Jacqueline W. Daykin
,
W.F. Smyth
Lecture Notes in Computer Science
6661
, 2011, pp. 65-76
An adaptive hybrid pattern-matching algorithm on indeterminate strings
W.F. Smyth
,
Shu Wang
International Journal of Foundations of Computer Science
20
(6), 2009, pp. 985-1004
A new approach to the periodicity lemma on strings with holes
W.F. Smyth
,
Shu Wang
Theoretical Computer Science
410
(43), 2009, pp. 4295-4302
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
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
Sorting suffixes of two-pattern strings
Frantisek Franek
,
W.F. Smyth
International Journal of Foundations of Computer Science
16
(6), 2005, pp. 1135-1144
Computing the cover array in linear time
Y. Li
,
W.F. Smyth
Algorithmica
32
(1), 2002, pp. 95-106
Approximate periods of strings
Jeong Seop Sim
,
Costas S. Iliopoulos
,
Kunsoo Park
,
W.F. Smyth
Theoretical Computer Science
262
(1-2), 2001, pp. 557-568
Repetitions in Sturmian strings
Frantis̑ek Franȇk
,
Ayşe Karaman
,
W.F. Smyth
Theoretical Computer Science
249
(2), 2000, pp. 289-303
Repetitive perhaps, but certainly not boring
W.F. Smyth
Theoretical Computer Science
249
(2), 2000, pp. 343-355
Counting distinct strings
D. Moore
,
W.F. Smyth
,
D. Miller
Algorithmica
23
(1), 1999, pp. 1-13
A characterization of the squares in a Fibonacci string
Costas S. Iliopoulos
,
Dennis Moore
,
W.F. Smyth
Theoretical Computer Science
172
(1-2), 1997, pp. 281-291
Covering a circular string with substrings of fixed length
Art M. Duval
,
W.F. Smyth
International Journal of Foundations of Computer Science
7
(1), 1996, pp. 87-93
A correction to ``An optimal algorithm to compute all the covers of a string''
Dennis Moore
,
W.F. Smyth
Information Processing Letters
54
, 1995, pp. 101-103
Parallel RAM algorithms for factorizing words
J.W. Daykin
,
C.S. Iliopoulos
,
W.F. Smyth
Theoretical Computer Science
127
(1), 1994, pp. 53-67
Computing the covers of a string in linear time
Dennis Moore
,
W.F. Smyth
Proceedings of the 5th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA'94 (Arlington, Virginia, January 23-25, 1994)
, 1994, pp. 511-515
An optimal algorithm to compute all the covers of a string
Dennis Moore
,
W.F. Smyth
Information Processing Letters
50
, 1994, pp. 239-246
A fast and effective heuristic for the feedback arc set problem
Peter Eades
,
Xuemin Lin
,
W.F. Smyth
Information Processing Letters
47
(6), 1993, pp. 319-323
Optimal algorithms for computing the canonical form of a circular string
Costas S. Iliopoulos
,
W.F. Smyth
Theoretical Computer Science
92
, 1991, pp. 87-105
Sharp bounds on the diameter of a graph
W.F. Smyth
Can. Math. Bull.
, 1986, February
An upper bound on the maximum cardinality of the vertex set of graphs of given maximum degree and diameter
W.F. Smyth
misc