nr |
titel |
auteur |
tijdschrift |
jaar |
jaarg. |
afl. |
pagina('s) |
type |
1 |
An approximate string-matching algorithm
|
Kim, Jong Yong |
|
1992 |
92 |
1 |
p. 107-117 11 p. |
artikel |
2 |
Approximate string-matching with q-grams and maximal matches
|
Ukkonen, Esko |
|
1992 |
92 |
1 |
p. 191-211 21 p. |
artikel |
3 |
A string-matching interpretation of the equation xmyn = zp
|
Néraud, J. |
|
1992 |
92 |
1 |
p. 145-164 20 p. |
artikel |
4 |
A variation on the Boyer-Moore algorithm
|
Lecroq, Thierry |
|
1992 |
92 |
1 |
p. 119-144 26 p. |
artikel |
5 |
Average running time of the Boyer-Moore-Horspool algorithm
|
Baeza-Yates, Ricardo A. |
|
1992 |
92 |
1 |
p. 19-31 13 p. |
artikel |
6 |
Contents EATCS bulletin number 45, October 1991
|
|
|
1992 |
92 |
1 |
p. 223-226 4 p. |
artikel |
7 |
Data compression with factor automata
|
Zipstein, Marc |
|
1992 |
92 |
1 |
p. 213-221 9 p. |
artikel |
8 |
Dynamic programming with convexity, concavity and sparsity
|
Galil, Zvi |
|
1992 |
92 |
1 |
p. 49-76 28 p. |
artikel |
9 |
Editorial board
|
|
|
1992 |
92 |
1 |
p. ii-iv nvt p. |
artikel |
10 |
Fast average-case pattern matching by multiplexing sparse tables
|
Quong, Russell W. |
|
1992 |
92 |
1 |
p. 165-179 15 p. |
artikel |
11 |
Fast linear-space computations of longest common subsequences
|
Apostolico, A. |
|
1992 |
92 |
1 |
p. 3-17 15 p. |
artikel |
12 |
Foreword
|
Crochemore, Maxime |
|
1992 |
92 |
1 |
p. 1- 1 p. |
artikel |
13 |
Minimisation of acyclic deterministic automata in linear time
|
Revuz, Dominique |
|
1992 |
92 |
1 |
p. 181-189 9 p. |
artikel |
14 |
Optimal algorithms for computing the canonical form of a circular string
|
Iliopoulos, Costas S. |
|
1992 |
92 |
1 |
p. 87-105 19 p. |
artikel |
15 |
String-matching on ordered alphabets
|
Crochemore, Maxime |
|
1992 |
92 |
1 |
p. 33-47 15 p. |
artikel |
16 |
Two recognizable string-matching problems over free partially commutative monoids
|
Hashiguchi, Kosaburo |
|
1992 |
92 |
1 |
p. 77-86 10 p. |
artikel |