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=191
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Univariate polynomial factorization over finite fields
Patrice Naudin
,
Claude Quitté
Theoretical Computer Science
191
(1-2), 1998, pp. 1-36
Fine hierarchy of regular
\omega
-languages
Victor Selivanov
Theoretical Computer Science
191
(1-2), 1998, pp. 37-59
Synchronisation déterministe des automates à délai borné
Christiane Frougny
,
Jacques Sakarovitch
Theoretical Computer Science
191
(1-2), 1998, pp. 61-77
Characterization and closure properties of linear
\omega
-languages
Douadi Mihoubi
Theoretical Computer Science
191
(1-2), 1998, pp. 79-95
Parameterized circuit complexity and the
W
hierarchy
Rodney G. Downey
,
Michael R. Fellows
,
Kenneth W. Regan
Theoretical Computer Science
191
(1-2), 1998, pp. 97-115
The meet operation in the lattice of codes
Véronique Bruyère
,
Denis Derencourt
,
Michel Latteux
Theoretical Computer Science
191
(1-2), 1998, pp. 117-129
The suffix tree of a tree and minimizing sequential transducers
Dany Breslauer
Theoretical Computer Science
191
(1-2), 1998, pp. 131-144
Makanin's algorithm is not primitive recursive
Antoni Kościelski
,
Leszek Pacholski
Theoretical Computer Science
191
(1-2), 1998, pp. 145-156
Some chip transfer games
Thomas S. Ferguson
Theoretical Computer Science
191
(1-2), 1998, pp. 157-171
Secure multiparty computations without computers
Valtteri Niemi
,
Ari Renvall
Theoretical Computer Science
191
(1-2), 1998, pp. 173-183
An improved zero-one law for algorithmically random sequences
Steven M. Kautz
Theoretical Computer Science
191
(1-2), 1998, pp. 185-192
Moving a food trolley around a corner
Gerd Eriksson
,
Henrik Eriksson
,
Kimmo Eriksson
Theoretical Computer Science
191
(1-2), 1998, pp. 193-203
Shortest common superstrings and scheduling with coordinated starting times
Martin Middendorf
Theoretical Computer Science
191
(1-2), 1998, pp. 205-214
Computational indistinguishability: Algorithms vs. circuits
Oded Goldreich
,
Bernd Meyer
Theoretical Computer Science
191
(1-2), 1998, pp. 215-218
Finite derivation type for semi-direct products of monoids
Jing Wang
Theoretical Computer Science
191
(1-2), 1998, pp. 219-228
Autocorrelation coefficient for the graph bipartitioning problem
E. Angel
,
V. Zissimopoulos
Theoretical Computer Science
191
(1-2), 1998, pp. 229-243
Addition in
\log_2 n+O(1)
steps on average - A simple analysis
Richard Beigel
,
Bill Gasarch
,
Ming Li
,
Louxin Zhang
Theoretical Computer Science
191
(1-2), 1998, pp. 245-248