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=217
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Parallel Turing machines with one-head control units and cellular automata
Thomas Worsch
Theoretical Computer Science
217
(1), 1999, pp. 3-30
On the dynamical behavior of chaotic cellular automata
G. Cattaneo
,
E. Formenti
,
L. Margara
,
G. Mauri
Theoretical Computer Science
217
(1), 1999, pp. 31-51
Signals in one-dimensional cellular automata
Jacques Mazoyer
,
Véronique Terrier
Theoretical Computer Science
217
(1), 1999, pp. 53-80
Computation in artificially evolved, non-uniform cellular automata
Moshe Sipper
,
Marco Tomassini
Theoretical Computer Science
217
(1), 1999, pp. 81-98
Multilayered cellular automata
Stefania Bandini
,
Giancarlo Mauri
Theoretical Computer Science
217
(1), 1999, pp. 99-113
Lattice Boltzmann computations and applications to physics
Bastien Chopard
,
Pascal O. Luthi
Theoretical Computer Science
217
(1), 1999, pp. 115-130
Applying cellular automata to complex environmental problems: The simulation of the bioremediation of contaminated soils
S. di Gregorio
,
R. Serra
,
M. Villani
Theoretical Computer Science
217
(1), 1999, pp. 131-156
Coupled map lattices dynamics on a variable space for the study of development: A general discussion on Caenorhabditis elegans
Franco A. Bignone
Theoretical Computer Science
217
(1), 1999, pp. 157-172
Graph layout for applications in compiler construction
G. Sander
Theoretical Computer Science
217
(2), 1999, pp. 175-214
Attribute exploration with background knowledge
Bernhard Ganter
Theoretical Computer Science
217
(2), 1999, pp. 215-233
Advances in the theory and practice of graph drawing
Roberto Tamassia
Theoretical Computer Science
217
(2), 1999, pp. 235-254
Boolean layer cakes - Proceedings ORDAL '96
J. Schmid
Theoretical Computer Science
217
(2), 1999, pp. 255-278
Congruence lattices 101
G. Grätzer
Theoretical Computer Science
217
(2), 1999, pp. 279-289
Some combinatorial aspects of congruence lattice representations
G. Grätzer
,
E.T. Schmidt
Theoretical Computer Science
217
(2), 1999, pp. 291-300
Algorithms for the fixed point property
Bernd S.W. Schröder
Theoretical Computer Science
217
(2), 1999, pp. 301-358
Preference structures and their numerical representations
Peter Fishburn
Theoretical Computer Science
217
(2), 1999, pp. 359-383
Generating algebraic laws from imperative programs
H. Peter Gumm
Theoretical Computer Science
217
(2), 1999, pp. 385-405
Latticial structures in data analysis
Vincent Duquenne
Theoretical Computer Science
217
(2), 1999, pp. 407-436