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=412
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Communication complexity and intrinsic universality in cellular automata
E. Goles
,
P.-E. Meunier
,
I. Rapaport
,
G. Theyssier
Theoretical Computer Science
412
(1-2), 2011, pp. 2-21
Abstract geometrical computation 4: Small Turing universal signal machines
Jérôme Durand-Lose
Theoretical Computer Science
412
(1-2), 2011, pp. 57-67
Complexity of multi-head finite automata: Origins and directions
Markus Holzer
,
Martin Kutrib
,
Andreas Malcher
Theoretical Computer Science
412
(1-2), 2011, pp. 83-96
On the complex behavior of simple tag systems - An experimental approach
Liesbeth De Mol
Theoretical Computer Science
412
(1-2), 2011, pp. 97-112
Computing by observing: Simple systems and simple observers
Matteo Cavaliere
,
Peter Leupold
Theoretical Computer Science
412
(1-2), 2011, pp. 113-123
On generalized communicating P systems with minimal interaction rules
Erzsóbet Csuhaj-Varjú
,
Sergey Verlan
Theoretical Computer Science
412
(1-2), 2011, pp. 124-135
P systems with minimal insertion and deletion
Artiom Alhazov
,
Alexander Krassovitskiy
,
Yurii Rogozhin
,
Sergey Verlan
Theoretical Computer Science
412
(1-2), 2011, pp. 136-144
Limitations of self-assembly at temperature 1
David Doty
,
Matthew J. Patitz
,
Scott M. Summers
Theoretical Computer Science
412
(1-2), 2011, pp. 145-158
Simplicity via provability for universal prefix-free Turing machines
Cristian S. Calude
Theoretical Computer Science
412
(1-2), 2011, pp. 178-182
DNA library screening, pooling design and unitary spaces
Suogang Gao
,
Zengti Li
,
Jiangchen Yu
,
Xiaofeng Gao
,
Weili Wu
Theoretical Computer Science
412
(3), 2011, pp. 217-224
A linear time algorithm for computing a most reliable source on a tree network with faulty nodes
Wei Ding
,
Guoliang Xue
Theoretical Computer Science
412
(3), 2011, pp. 225-232
Size-constrained tree partitioning: Approximating the multicast
k
-tree routing problem
Zhipeng Cai
,
Randy Goebel
,
Guohui Lin
Theoretical Computer Science
412
(3), 2011, pp. 240-245
Deterministic risk control for cost-effective network connections
Eduardo Álvarez-Miranda
,
Xujin Chen
,
Jie Hu
,
Xiaodong Hu
,
Alfredo Candia-Véjar
Theoretical Computer Science
412
(3), 2011, pp. 257-264
Scheduling resumable deteriorating jobs on a single machine with non-availability constraints
Baoqiang Fan
,
Shisheng Li
,
Li Zhou
,
Liqi Zhang
Theoretical Computer Science
412
(4-5), 2011, pp. 275-280
On the reversibility and the closed image property of linear cellular automata
Tullio Ceccherini-Silberstein
,
Michel Coornaert
Theoretical Computer Science
412
(4-5), 2011, pp. 300-306
Linear time analysis of properties of conflict-free and general Petri nets
Paola Alimonti
,
Esteban Feuerstein
,
Luigi Laura
,
Umberto Nanni
Theoretical Computer Science
412
(4-5), 2011, pp. 320-338
More on the Magnus-Derek game
Li-Jui Chen
,
Jinn-Jy Lin
,
Min-Zheng Shieh
,
Shi-Chun Tsai
Theoretical Computer Science
412
(4-5), 2011, pp. 339-344
Exact algorithms for computing the tree edit distance between unordered trees
Tatsuya Akutsu
,
Daiji Fukagawa
,
Atsuhiro Takasu
,
Takeyuki Tamura
Theoretical Computer Science
412
(4-5), 2011, pp. 352-364
Shortest path and maximum flow problems in networks with additive losses and gains
Franz J. Brandenburg
,
Mao-cheng Cai
Theoretical Computer Science
412
(4-5), 2011, pp. 391-401
Not every domain of a plain decompressor contains the domain of a prefix-free one
Mikhail Andreev
,
Ilya Razenshteyn
,
Alexander Shen
Theoretical Computer Science
412
(4-5), 2011, pp. 482-486
A simple and efficient Union-Find-Delete algorithm
Amir Ben-Amram
,
Simon Yoffe
Theoretical Computer Science
412
(4-5), 2011, pp. 487-492
Complexity and palindromic defect of infinite words
S. Brlek
,
C. Reutenauer
Theoretical Computer Science
412
(4-5), 2011, pp. 493-497
Negative selection algorithms on strings with efficient training and linear-time classification
Michael Elberfeld
,
Johannes Textor
Theoretical Computer Science
412
(6), 2011, pp. 534-542
A randomized algorithm for two servers in cross polytope spaces
Wolfgang Bein
,
Kazuo Iwama
,
Jun Kawahara
,
Lawrence L. Larmore
,
James A. Oravec
Theoretical Computer Science
412
(7), 2011, pp. 563-572
On min-max
r
-gatherings
Amitai Armon
Theoretical Computer Science
412
(7), 2011, pp. 573-582
Seiten 1
2
3
4
5
6
7
8
9
10
11
12
>