Volume 92; Issue 1

Theoretical Computer Science

Volume 92; Issue 1
1

Foreword

Year:
1992
File:
PDF, 30 KB
1992
2

Average running time of the Boyer-Moore-Horspool algorithm

Year:
1992
Language:
english
File:
PDF, 671 KB
english, 1992
3

String-matching on ordered alphabets

Year:
1992
Language:
english
File:
PDF, 975 KB
english, 1992
5

Optimal algorithms for computing the canonical form of a circular string

Year:
1992
Language:
english
File:
PDF, 1.13 MB
english, 1992
6

An approximate string-matching algorithm

Year:
1992
Language:
english
File:
PDF, 774 KB
english, 1992
7

A string-matching interpretation of the equation xmyn = zp

Year:
1992
Language:
english
File:
PDF, 1.03 MB
english, 1992
8

Fast average-case pattern matching by multiplexing sparse tables

Year:
1992
Language:
english
File:
PDF, 920 KB
english, 1992
9

Data compression with factor automata

Year:
1992
Language:
english
File:
PDF, 465 KB
english, 1992
10

Contents EATCS bulletin number 45, October 1991

Year:
1992
Language:
english
File:
PDF, 230 KB
english, 1992
11

Editorial board

Year:
1992
Language:
english
File:
PDF, 207 KB
english, 1992
12

Fast linear-space computations of longest common subsequences

Year:
1992
Language:
english
File:
PDF, 1.02 MB
english, 1992
13

Dynamic programming with convexity, concavity and sparsity

Year:
1992
Language:
english
File:
PDF, 1.84 MB
english, 1992
14

A variation on the Boyer-Moore algorithm

Year:
1992
Language:
english
File:
PDF, 1.15 MB
english, 1992
15

Minimisation of acyclic deterministic automata in linear time

Year:
1992
Language:
english
File:
PDF, 504 KB
english, 1992
16

Approximate string-matching with q-grams and maximal matches

Year:
1992
Language:
english
File:
PDF, 1.33 MB
english, 1992