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=410
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Empire of colonies: Self-stabilizing and self-organizing distributed algorithm
Shlomi Dolev
,
Nir Tzachar
Theoretical Computer Science
410
(6-7), 2009, pp. 514-532
On the cost of uniform protocols whose memory consumption is adaptive to interval contention
Burkhard Englert
Theoretical Computer Science
410
(6-7), 2009, pp. 533-545
Of malicious motes and suspicious sensors: On the efficiency of malicious interference in wireless networks
Seth Gilbert
,
Rachid Guerraoui
,
Calvin Newport
Theoretical Computer Science
410
(6-7), 2009, pp. 546-569
A topological treatment of early-deciding set-agreement
Rachid Guerraoui
,
Maurice Herlihy
,
Bastian Pochon
Theoretical Computer Science
410
(6-7), 2009, pp. 570-580
Robust self-stabilizing weight-based clustering algorithm
Colette Johnen
,
Le Huy Nguyen
Theoretical Computer Science
410
(6-7), 2009, pp. 581-594
Adversarial queuing theory with setups
M. Kiwi
,
M. Soto
,
C. Thraves
Theoretical Computer Science
410
(8-10), 2009, pp. 670-687
The degree distribution of random
k
-trees
Yong Gao
Theoretical Computer Science
410
(8-10), 2009, pp. 688-695
Treewidth and logical definability of graph products
Selma Djelloul
Theoretical Computer Science
410
(8-10), 2009, pp. 696-710
A quadratic time 2-approximation algorithm for block sorting
Wolfgang W. Bein
,
Lawrence L. Larmore
,
Linda Morales
,
I. Hal Sudborough
Theoretical Computer Science
410
(8-10), 2009, pp. 711-717
A more effective linear kernelization for cluster editing
Jiong Guo
Theoretical Computer Science
410
(8-10), 2009, pp. 718-726
The price of optimum in Stackelberg games on arbitrary single commodity networks and latency functions
A.C. Kaporis
,
P.G. Spirakis
Theoretical Computer Science
410
(8-10), 2009, pp. 745-755
A
5 + \epsilon
-approximation algorithm for minimum weighted dominating set in unit disk graph
Decheng Dai
,
Changyuan Yu
Theoretical Computer Science
410
(8-10), 2009, pp. 756-765
A generalization of Thue freeness for partial words
F. Blanchet-Sadri
,
Robert Mercaş
,
Geoffrey Scott
Theoretical Computer Science
410
(8-10), 2009, pp. 793-800
On the bipanpositionable bipanconnectedness of hypercubes
Tzu-Liang Kung
,
Cheng-Kuan Lin
,
Tyne Liang
,
Lih-Hsing Hsu
,
Jimmy J.M. Tan
Theoretical Computer Science
410
(8-10), 2009, pp. 801-811
On the pseudo-achromatic number problem
Jianer Chen
,
Iyad A. Kanj
,
Jie Meng
,
Ge Xia
,
Fenghui Zhang
Theoretical Computer Science
410
(8-10), 2009, pp. 818-829
A variant of the tandem duplication - Random loss model of genome rearrangement
Mathilde Bouvel
,
Dominique Rossin
Theoretical Computer Science
410
(8-10), 2009, pp. 847-858
The complexity of the matroid-greedoid partition problem
Vera Asodi
,
Christopher Umans
Theoretical Computer Science
410
(8-10), 2009, pp. 859-866
Efficient algorithms for two generalized 2-median problems and the group median problem on trees
Chi-Yuan Chan
,
Shan-Chyun Ku
,
Chi-Jen Lu
,
Biing-Feng Wang
Theoretical Computer Science
410
(8-10), 2009, pp. 867-876
Fast payment schemes for truthful mechanisms with verification
Alessandro Ferrante
,
Gennaro Parlato
,
Francesco Sorrentino
,
Carmine Ventre
Theoretical Computer Science
410
(8-10), 2009, pp. 886-899
Dynamic TCP acknowledgment with sliding window
Hisashi Koga
Theoretical Computer Science
410
(8-10), 2009, pp. 914-925
Constructing edge-disjoint spanning trees in locally twisted cubes
Sun-Yuan Hsieh
,
Chang-Jen Tu
Theoretical Computer Science
410
(8-10), 2009, pp. 926-932
On the support size of stable strategies in random games
Spyros C. Kontogiannis
,
Paul G. Spirakis
Theoretical Computer Science
410
(8-10), 2009, pp. 933-942
Overlap-freeness in infinite partial words
Vesa Halava
,
Tero Harju
,
Tomi Kärki
,
Patrice Séébold
Theoretical Computer Science
410
(8-10), 2009, pp. 943-948
Improved approximation bounds for edge dominating set in dense graphs
Jean Cardinal
,
Stefan Langerman
,
Eythan Levy
Theoretical Computer Science
410
(8-10), 2009, pp. 949-957
Compressed depth sequences
Travis Gagie
Theoretical Computer Science
410
(8-10), 2009, pp. 958-962
Seiten
<
1
2
3
4
5
6
7
8
9
10
11
12
>