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=358
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
On the power of non-local boxes
Anne Broadbent
,
Andre Allan Méthot
Theoretical Computer Science
358
(1), 2006, pp. 3-14
Quantization of games: Towards quantum artificial intelligence
Katarzyna Miakisz
,
Edward W. Piotrowski
,
Jan Sƚadkowski
Theoretical Computer Science
358
(1), 2006, pp. 15-22
Zeno machines and hypercomputation
Petrus H. Potgieter
Theoretical Computer Science
358
(1), 2006, pp. 23-33
Connectionist computations of intuitionistic reasoning
Artur S. d'Avila Garcez
,
Luís C. Lamb
,
Dov M. Gabbay
Theoretical Computer Science
358
(1), 2006, pp. 34-55
A 3D graphical representation of DNA sequences and its application
Bo Liao
,
Kequan Ding
Theoretical Computer Science
358
(1), 2006, pp. 56-64
Determination of equivalence between quantum sequential machines
Lvzhou Li
,
Daowen Qiu
Theoretical Computer Science
358
(1), 2006, pp. 65-74
An alternative definition of splicing
Remco Loos
Theoretical Computer Science
358
(1), 2006, pp. 75-87
Characterizations of context-sensitive languages and other language classes in terms of symport/antiport
P
systems
Oscar H. Ibarra
,
Gheorghe Păun
Theoretical Computer Science
358
(1), 2006, pp. 88-103
Analysis of a Multiobjective Evolutionary Algorithm on the 0-1 knapsack problem
Rajeev Kumar
,
Nilanjan Banerjee
Theoretical Computer Science
358
(1), 2006, pp. 104-120
Phase transitions and symmetry breaking in genetic algorithms with crossover
Alex Rogers
,
Adam Prügel-Bennett
,
Nicholas R. Jennings
Theoretical Computer Science
358
(1), 2006, pp. 121-141
On the power of parallel communicating Watson-Crick automata systems
Elena Czeizler
,
Eugen Czeizler
Theoretical Computer Science
358
(1), 2006, pp. 142-147
Message-passing automata are expressively equivalent to EMSO logic
Benedikt Bollig
,
Martin Leucker
Theoretical Computer Science
358
(2-3), 2006, pp. 150-172
Probabilistic event structures and domains
Daniele Varacca
,
Hagen Völzer
,
Glynn Winskel
Theoretical Computer Science
358
(2-3), 2006, pp. 173-199
Asynchronous games 2: The true concurrency of innocence
Paul-André Melliès
Theoretical Computer Science
358
(2-3), 2006, pp. 200-228
Resource control for synchronous cooperative threads
Roberto M. Amadio
,
Silvano Dal Zilio
Theoretical Computer Science
358
(2-3), 2006, pp. 229-254
Characterizing EF and EX tree logics
Mikolaj Bojańczyk
,
Igor Walukiewicz
Theoretical Computer Science
358
(2-3), 2006, pp. 255-272
Model checking restricted sets of timed paths
Nicolas Markey
,
Jean-François Raskin
Theoretical Computer Science
358
(2-3), 2006, pp. 273-292
Elimination of quantifiers and undecidability in spatial logics for concurrency
Luís Caires
,
Etienne Lozes
Theoretical Computer Science
358
(2-3), 2006, pp. 293-314
A general approach to comparing infinite-state systems with their finite-state specifications
Antonín Kuc̑era
,
Philippe Schnoebelen
Theoretical Computer Science
358
(2-3), 2006, pp. 315-333