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=505
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
On the low-dimensional Steiner minimum tree problem in Hamming metric
Ernst Althaus
,
Joschka Kupilas
,
Rouven Naujoks
Theoretical Computer Science
505
, 2013, pp. 2-10
Non-adaptive complex group testing with multiple positive sets
Francis Y.L. Chin
,
Henry C.M. Leung
,
S.M. Yiu
Theoretical Computer Science
505
, 2013, pp. 11-18
A bad instance for
k
-means++
Tobias Brunsch
,
Heiko Röglin
Theoretical Computer Science
505
, 2013, pp. 19-26
Grey-box steganography
Maciej Liśkiewicz
,
Rüdiger Reischuk
,
Ulrich Wölfel
Theoretical Computer Science
505
, 2013, pp. 27-41
Fast exact algorithm for
L(2,l)
-labeling of graphs
Konstanty Junosza-Szaniawski
,
Jan Kratochvíl
,
Mathieu Liedloff
,
Peter Rossmanith
,
Paweƚ Rza̧żewski
Theoretical Computer Science
505
, 2013, pp. 42-54
Generalized satisfiability for the description logic
\mathcal{ALC}
Arne Meier
,
Thomas Schneider
Theoretical Computer Science
505
, 2013, pp. 55-73
Energy and fan-in of logic circuits computing symmetric Boolean functions
Akira Suzuki
,
Kei Uchizawa
,
Xiao Zhou
Theoretical Computer Science
505
, 2013, pp. 74-80
Turing degrees of multidimensional SFTs
Emmanuel Jeandel
,
Pascal Vanier
Theoretical Computer Science
505
, 2013, pp. 81-92