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=436
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Splicing systems and the Chomsky hierarchy
Jean Berstel
,
Luc Boasson
,
Isabelle Fagnot
Theoretical Computer Science
436
, 2012, pp. 2-22
The expressive power of analog recurrent neural networks on infinite input streams
Jérémie Cabessa
,
Alessandro E.P. Villa
Theoretical Computer Science
436
, 2012, pp. 23-34
Sand piles: From physics to cellular automata models
G. Cattaneo
,
M. Comito
,
D. Bianucci
Theoretical Computer Science
436
, 2012, pp. 35-53
A large population size can be unhelpful in evolutionary algorithms
Tianshi Chen
,
Ke Tang
,
Guoliang Chen
,
Xin Yao
Theoretical Computer Science
436
, 2012, pp. 54-70
Non-existence of linear universal drift functions
Benjamin Doerr
,
Daniel Johannsen
,
Carola Winzen
Theoretical Computer Science
436
, 2012, pp. 71-86
An Abstract Interpretation framework for genotype elimination algorithms
Giuseppe Lettieri
Theoretical Computer Science
436
, 2012, pp. 87-105
The use of tail inequalities on the probable computational time of randomized search heuristics
Dong Zhou
,
Dan Luo
,
Ruqian Lu
,
Zhangang Han
Theoretical Computer Science
436
, 2012, pp. 106-117