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=161
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Parallel constructions of maximal path sets and applications to short suberstrings
Zhi-Zhong Chen
Theoretical Computer Science
161
(1-2), 1996, pp. 1-21
On the Kleijn-Rozenberg
k
-adjacent languages
F. Carrere
Theoretical Computer Science
161
(1-2), 1996, pp. 23-68
Algorithmes de calcul de la réduction de Hermite d'une matrice à coefficients polynomiaux
Salah Labhalla
,
Henri Lombardi
,
Roger Marlin
Theoretical Computer Science
161
(1-2), 1996, pp. 68-92
Flatwords and post correspondence problem
Tero Harju
,
Marjo Lipponen
,
Alexandru Mateescu
Theoretical Computer Science
161
(1-2), 1996, pp. 93-108
The complexity of PDL with interleaving
Alain J. Mayer
,
Larry J. Stockmeyer
Theoretical Computer Science
161
(1-2), 1996, pp. 109-122
On resource-bounded instance complexity
Lance Fortnow
,
Martin Kummer
Theoretical Computer Science
161
(1-2), 1996, pp. 123-140
On the language of primitive words
H. Petersen
Theoretical Computer Science
161
(1-2), 1996, pp. 141-156
Over testable languages
Carla Selmi
Theoretical Computer Science
161
(1-2), 1996, pp. 157-190
Chain automata
Olivier Carton
Theoretical Computer Science
161
(1-2), 1996, pp. 191-203
On parsing coupled-context-free languages
Günter Hotz
,
Gisela Pitsch
Theoretical Computer Science
161
(1-2), 1996, pp. 205-233
Learning in the presence of inaccurate information
Mark Fulk
,
Sanjay Jain
Theoretical Computer Science
161
(1-2), 1996, pp. 235-261
Index sets and presentations of complexity classes
Kenneth W. Regan
Theoretical Computer Science
161
(1-2), 1996, pp. 263-287
Inferring a tree from walks
Osama Maruyama
,
Satoru Miyano
Theoretical Computer Science
161
(1-2), 1996, pp. 289-300
Generalized Knapsack problems and fixed degree separations
Felipe Cucker
,
Michael Shub
Theoretical Computer Science
161
(1-2), 1996, pp. 301-306
Constructing the highest degree subgraph for dense graphs is in
{\cal{NCAS}}
Alexander E. Andreev
,
Andrea E.F. Clementi
,
José D.P. Rolim
Theoretical Computer Science
161
(1-2), 1996, pp. 307-314