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=180
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Some decisional problems on rational relations
Marina Madonia
,
Stefano Varricchio
Theoretical Computer Science
180
(1-2), 1997, pp. 1-15
Solvable black-box group problems are low for
PP
V. Arvind
,
N.V. Vinodchandran
Theoretical Computer Science
180
(1-2), 1997, pp. 17-45
Size of ordered binary decision diagrams representing threshold functions
K. Hosaka
,
Y. Takenaga
,
T. Kaneda
,
S. Yajima
Theoretical Computer Science
180
(1-2), 1997, pp. 47-60
Nonnegative companion matrices and star-height of
N
-rational series
Frédérique Bassino
Theoretical Computer Science
180
(1-2), 1997, pp. 61-80
Séparateurs dans les mots infinis engendrés par morphismes
E. Garel
Theoretical Computer Science
180
(1-2), 1997, pp. 81-113
Multiple sequence comparison - A peptide matching approach
Marie-France Sagot
,
Alain Viari
,
Henri Soldano
Theoretical Computer Science
180
(1-2), 1997, pp. 115-137
On the power of alternation on reversal-bounded alternating Turing machines with a restriction
Hiroaki Yamamoto
Theoretical Computer Science
180
(1-2), 1997, pp. 139-154
Learning counting functions with queries
Zhixiang Chen
,
Steven Homer
Theoretical Computer Science
180
(1-2), 1997, pp. 155-168
Efficient enumeration of all minimal separators in a graph
Hong Shen
,
Weifa Liang
Theoretical Computer Science
180
(1-2), 1997, pp. 169-180
Automaticity II: Descriptional complexity in the unary case
Carl Pomerance
,
John Michael Robson
,
Jeffrey Shallit
Theoretical Computer Science
180
(1-2), 1997, pp. 181-201
The undecidability of the unrestricted modified edit distance
Vitus J. Leung
Theoretical Computer Science
180
(1-2), 1997, pp. 203-215
Testing shift-equivalence of polynomials by deterministic, probabilistic and quantum machines
D. Grigoriev
Theoretical Computer Science
180
(1-2), 1997, pp. 217-228
Alternation on cellular automata
Martín Matamala
Theoretical Computer Science
180
(1-2), 1997, pp. 229-241
Optimal bounds for the approximation of Boolean functions and some applications
Alexander E. Andreev
,
Andrea E.F. Clementi
,
José D.P. Rolim
Theoretical Computer Science
180
(1-2), 1997, pp. 243-268
On extended
P_4
-reducible and extended
P_4
-sparse graphs
Vassilis Giakoumakis
,
Jean-Marie Vanherpe
Theoretical Computer Science
180
(1-2), 1997, pp. 269-286
Parallel algorithms for certain matrix computations
Bruno Codenotti
,
Biswa N. Datta
,
Karabi Datta
,
Mauro Leoncini
Theoretical Computer Science
180
(1-2), 1997, pp. 287-308
Correctness of constructing optimal alphabetic trees revisited
Marek Karpinski
,
Lawrence L. Larmore
,
Wojciech Rytter
Theoretical Computer Science
180
(1-2), 1997, pp. 309-324
Finite semigroup varieties defined by programs
Pierre Péladeau
,
Howard Straubing
,
Denis Thérien
Theoretical Computer Science
180
(1-2), 1997, pp. 325-339
On distributed catenation
Mandred Kudlek
,
Alexandru Mateescu
Theoretical Computer Science
180
(1-2), 1997, pp. 341-352
Cooperation in context-free grammars
Jüren Dassow
,
Victor Mitrana
Theoretical Computer Science
180
(1-2), 1997, pp. 353-361
On some dynamical subsets of the Rauzy fractal
Víctor F. Sirvent
Theoretical Computer Science
180
(1-2), 1997, pp. 363-370
A syntactical proof of the operational equivalence of two
\lambda
-terms
René David
,
Karim Nour
Theoretical Computer Science
180
(1-2), 1997, pp. 371-375