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 YEAR=1999
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Theory of evolutionary algorithms: A bird's eye view
A.E. Eiben
,
G. Rudolph
Theoretical Computer Science
229
(1-2), 1999, pp. 3-9
Genetic algorithms: Bridging the convergence gap
J.A. Lozano
,
P. Larrañaga
,
M. Graña
,
F.X. Albizuri
Theoretical Computer Science
229
(1-2), 1999, pp. 11-22
On the convergence rates of genetic algorithms
Jun He
,
Lishan Kang
Theoretical Computer Science
229
(1-2), 1999, pp. 23-39
Statistical dynamics of the royal road genetic algorithm
Erik van Nimwegen
,
James P. Crutchfield
,
Melanie Mitchell
Theoretical Computer Science
229
(1-2), 1999, pp. 41-102
Random heuristic search
Michael D. Vose
Theoretical Computer Science
229
(1-2), 1999, pp. 103-142
Fourier analysis of genetic algorithms
Walter A. Kosters
,
Joost N. Kok
,
Patrik Floréen
Theoretical Computer Science
229
(1-2), 1999, pp. 143-175
Analysis of speciation and niching in the multi-niche crowding GA
Walter Cedeño
,
V. Rao Vemuri
Theoretical Computer Science
229
(1-2), 1999, pp. 177-197
Bisimilarity as a theory of functional programming
Andrew D. Gordon
Theoretical Computer Science
228
(1-2), 1999, pp. 5-47
Bireflectivity
P.J. Freyd
,
P.W. O'Hearn
,
A.J. Power
,
M. Takeyama
,
R. Street
,
R.D. Tennent
Theoretical Computer Science
228
(1-2), 1999, pp. 49-76
Closed action calculi
Philippa Gardner
Theoretical Computer Science
228
(1-2), 1999, pp. 77-103
A fully abstract semantics for a higher-order functional language with nondeterministic computation
Alan Jeffrey
Theoretical Computer Science
228
(1-2), 1999, pp. 105-150
logspace and ptime characterized by programming languages
Neil D. Jones
Theoretical Computer Science
228
(1-2), 1999, pp. 151-174
Call-by-name, call-by-value, call-by-need and the linear lambda calculus
J. Maraist
,
M. Odersky
,
D.N. Turner
,
P. Wadler
Theoretical Computer Science
228
(1-2), 1999, pp. 175-210
Syntactic control of interference revisited
P.W. O'Hearn
,
A.J. Power
,
M. Takeyama
,
R.D. Tennent
Theoretical Computer Science
228
(1-2), 1999, pp. 211-252
Objects, interference, and the Yoneda embedding
Peter W. O'Hearn
,
Uday S. Reddy
Theoretical Computer Science
228
(1-2), 1999, pp. 253-282
Full abstraction for idealized Algol with passive expressions
Samson Abramsky
,
Guy McCusker
Theoretical Computer Science
227
(1-2), 1999, pp. 3-42
A classical linear
\lambda
-calculus
G.M. Bierman
Theoretical Computer Science
227
(1-2), 1999, pp. 43-78
Reversible, irreversible and optimal
\lambda
-machines
Vincent Danos
,
Laurent Regnier
Theoretical Computer Science
227
(1-2), 1999, pp. 79-97
A general theory of sharing graphs
Stefano Guerrini
Theoretical Computer Science
227
(1-2), 1999, pp. 99-151
Coherence completions of categories
Hongde Hu
,
Andre Joyal
Theoretical Computer Science
227
(1-2), 1999, pp. 153-184
Distributed concurrent linear logic programming
Naoki Kobayashi
,
Toshihiro Shimizu
,
Akinori Yonezawa
Theoretical Computer Science
227
(1-2), 1999, pp. 185-220
Polynomial equivalence among systems LLNC, LLNC
_a
and LLNC
_0
François Métayer
Theoretical Computer Science
227
(1-2), 1999, pp. 221-229
Operational interpretations of linear logic
David N. Turner
,
Philip Wadler
Theoretical Computer Science
227
(1-2), 1999, pp. 231-248
On denotational completeness
Jean-Yves Girard
Theoretical Computer Science
227
(1-2), 1999, pp. 249-273
Coherent Banach spaces: A continuous denotational semantics
Jean-Yves Girard
Theoretical Computer Science
227
(1-2), 1999, pp. 275-297
Seiten 1
2
3
4
5
6
7
8
9
10
>