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=264
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Multiple splicing sytems and the universal computability
Satoshi Kobayashi
,
Yasubumi Sakakibara
Theoretical Computer Science
264
(1), 2001, pp. 3-23
Logical string rewriting
Vincenzo Manca
Theoretical Computer Science
264
(1), 2001, pp. 25-51
Gossiping in chordal rings under the line model
Lali Barrière
,
Johanne Cohen
,
Margarida Mitjana
Theoretical Computer Science
264
(1), 2001, pp. 53-64
Communication in the two-way listen-in vertex-disjoint paths mode
Hans-Joachim Böckenhauer
Theoretical Computer Science
264
(1), 2001, pp. 65-90
Random regular graphs with edge faults: Expansion through cores
Andreas Goerdt
Theoretical Computer Science
264
(1), 2001, pp. 91-125
On BPP versus
NP \cup
co
NP
for ordered read-once branching programs
Farid Ablayev
,
Marek Karpinski
,
Rustam Mubarakzjanov
Theoretical Computer Science
264
(1), 2001, pp. 127-137
Counting by quantum eingenvalue estimation
Michele Mosca
Theoretical Computer Science
264
(1), 2001, pp. 139-153
Probabilistic inductive inference: A survey
Andris Ambainis
Theoretical Computer Science
264
(1), 2001, pp. 155-167
Domains in
H
Marcelo P. Fiore
,
Giuseppe Rosolini
Theoretical Computer Science
264
(2), 2001, pp. 171-193
Characterising
FS
domains by means of power domains
Reinhold Heckman
Theoretical Computer Science
264
(2), 2001, pp. 195-203
Some results on Hahn-Banach-type theorems for continuous
D
-cones
Regina Tix
Theoretical Computer Science
264
(2), 2001, pp. 205-218