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=200
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Nondeterministic operations on finite relational structures
Klaus Barthelmann
Theoretical Computer Science
200
(1-2), 1998, pp. 1-44
Stable trace automata vs. full trace automata
Vincent Schmitt
Theoretical Computer Science
200
(1-2), 1998, pp. 45-100
Linear analysis of genetic algorithms
Lothar M. Schmitt
,
Chrystopher L. Nehaniv
,
Robert H. Fujii
Theoretical Computer Science
200
(1-2), 1998, pp. 101-134
Infinite games on finitely coloured graphs with applications to automata on infinite trees
Wiesƚaw Zielonka
Theoretical Computer Science
200
(1-2), 1998, pp. 135-183
On the algebraic structure of combinatorial problems
Peter Jeavons
Theoretical Computer Science
200
(1-2), 1998, pp. 185-204
On quasi orders of words and the confluence property
Tero Harju
,
Lucian Ilie
Theoretical Computer Science
200
(1-2), 1998, pp. 205-224
Bisimulations for a calculus of broadcasting systems
M. Hennessy
,
J. Rathke
Theoretical Computer Science
200
(1-2), 1998, pp. 225-260
Optimal representation in average using Kolmogorov complexity
E. Rivals
,
J.-P. Delahaye
Theoretical Computer Science
200
(1-2), 1998, pp. 261-287
Operational semantics of rewriting with priorities
Jaco van de Pol
Theoretical Computer Science
200
(1-2), 1998, pp. 289-312
Generalized Beimel-Chor schemes for broadcast encryption and interactive key distribution
C. Blundo
,
Luiz A. Frota Mattos
,
D.R. Stinson
Theoretical Computer Science
200
(1-2), 1998, pp. 313-334
Resolution and model building in the infinite-valued calculus of Łukasiewicz
Daniele Mundici
,
Nicola Olivetti
Theoretical Computer Science
200
(1-2), 1998, pp. 335-366