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: Journal=Theor.~Comput.~Sci. AND Volume=92
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Fast linear-space computations of longest common subsequences
A. Apostolico
,
S. Browne
,
C. Guerra
Theoretical Computer Science
92
, 1991, pp. 3-17
Average running time of the Boyer-Moore-Horspool algorithm
Ricardo A. Baeza-Yates
,
Mireille Régnier
Theoretical Computer Science
92
, 1991, pp. 19-31
String-matching on ordered alphabets
Maxime Crochemore
Theoretical Computer Science
92
, 1991, pp. 33-47
Dynamic programming with convexity, concavity and sparsity
Zvi Galil
,
Kunsoo Park
Theoretical Computer Science
92
, 1991, pp. 49-76
Two recognizable string-matching problems over free partially commutative monoids
Kosaburo Hashiguchi
,
Kazuya Yamada
Theoretical Computer Science
92
, 1991, pp. 77-86
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
An approximate string-matching algorithm
Jong Yong Kim
,
John Shawe-Taylor
Theoretical Computer Science
92
, 1991, pp. 107-117
A variation on the Boyer-Moore algorithm
Thierry Lecroq
Theoretical Computer Science
92
, 1991, pp. 119-144
A string-matching interpretation of the equation
x^my^n = z^p
J. Néraud
,
M. Crochemore
Theoretical Computer Science
92
, 1991, pp. 145-164
Fast average-case pattern matching by multiplexing sparse tables
Russell W. Quong
Theoretical Computer Science
92
, 1991, pp. 165-179
Minimisation of acyclic deterministic automata in linear time
Dominique Revuz
Theoretical Computer Science
92
, 1991, pp. 181-189
Approximate string-matching with
q
-grams and maximal matches
Esko Ukkonen
Theoretical Computer Science
92
, 1991, pp. 191-211
Data compression with factor automata
Marc Zipstein
Theoretical Computer Science
92
, 1991, pp. 213-221
Angular 2-structures
A. Ehrenfeucht
,
G. Rozenberg
Theoretical Computer Science
92
, 1991, pp. 227-248
Probabilistic estimation of the number of prefixes of a trace
Massimiliano Goldwurm
Theoretical Computer Science
92
, 1991, pp. 249-268
Generalized semigroup semirings which are zero-divisor-free or multiplicatively left-cancellative
Udo Hebisch
,
Hanns J. Weinert
Theoretical Computer Science
92
, 1991, pp. 269-289
Parallel chip firing games on graphs
Javier Bitar
,
Eric Goles
Theoretical Computer Science
92
, 1991, pp. 291-300
On independent random oracles
Jack H. Lutz
Theoretical Computer Science
92
, 1991, pp. 301-307
Separating complexity classes with tally oracles
Lane A. Hemachandra
,
Roy S. Rubinstein
Theoretical Computer Science
92
, 1991, pp. 309-318
Arrangements of curves in the plane - topology, combinatorics, and algorithms
Herbert Edelsbrunner
,
Leonidas Guibas
,
János Pach
,
Richard Pollack
,
Raimund Seidel
,
Micha Sharir
Theoretical Computer Science
92
, 1991, pp. 319-336