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
[1]
Hilfe
Suche: Author="Nehaniv, Chrystopher L."
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
An assertion concerning functionally complete algebras and
NP
-completeness
Gábor Horváth
,
Chrystopher L. Nehaniv
,
Csaba Szabó
Theoretical Computer Science
407
(1-3), 2008, pp. 591-595
Finite semigroups, feedback, and the Letichevsky criteria on non-empty words in finite automata
Pál Dömösi
,
Chrystopher L. Nehaniv
,
John L. Rhodes
Theoretical Computer Science
302
(1-3), 2003, pp. 295-317
On complete systems of automata
Pál Dömösi
,
Chrystopher L. Nehaniv
Theoretical Computer Science
245
(1), 2000, pp. 27-54
Linear analysis of genetic algorithms
Lothar M. Schmitt
,
Chrystopher L. Nehaniv
,
Robert H. Fujii
Theoretical Computer Science
200
(1-2), 1998, pp. 101-134
Monoids and groups acating on trees: Cahracterizations, gluing, and applications of the depth preserving actions
Chrystopher L. Nehaniv
International Journal of Algebra and Computation
5
(2), 1995, pp. 137-172