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=520
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Monoid-matrix type automata
Hui Xu
,
Jing Tian
,
Xianzhong Zhao
Theoretical Computer Science
520
, 2014, pp. 1-10
Information dissemination in unknown radio networks with large labels
Shailesh Vaya
Theoretical Computer Science
520
, 2014, pp. 11-26
Randomised broadcasting: Memory vs. randomness
Petra Berenbrink
,
Robert Elsässer
,
Thomas Sauerwald
Theoretical Computer Science
520
, 2014, pp. 27-42
Sharing information for the all pairs shortest path problem
Tadao Takaoka
Theoretical Computer Science
520
, 2014, pp. 43-50
Identity based identification from algebraic coding theory
Guomin Yang
,
Chik How Tan
,
Yi Mu
,
Willy Susilo
,
Duncan S. Wong
Theoretical Computer Science
520
, 2014, pp. 51-61
Improvements in closest point search based on dual HKZ-bases
Urs Wagner
,
Gérard Maze
Theoretical Computer Science
520
, 2014, pp. 62-74
Vulnerability of super edge-connected networks
Zhen-Mu Hong
,
Jun-Ming Xu
Theoretical Computer Science
520
, 2014, pp. 75-86
The complexity of multicut and mixed multicut problems in (di)graphs
Jrgen Bang-Jensen
,
Anders Yeo
Theoretical Computer Science
520
, 2014, pp. 87-96
Strong matching preclusion for torus networks
Shiying Wang
,
Kai Feng
Theoretical Computer Science
520
, 2014, pp. 97-110
Improved probabilistic decoding of interleaved Reed-Solomon codes and folded Hermitian codes
Ferruh Özbudak
,
Og̑uz Yayla
Theoretical Computer Science
520
, 2014, pp. 111-123
Total coloring of planar graphs with 7-cycles containing at most two chords
Renyu Xu
,
Jian-Liang Wu
Theoretical Computer Science
520
, 2014, pp. 124-129
A correction to Andersson's fusion tree construction
Z̑eljko Vrba
,
Pål Halvorsen
,
Carsten Griwodz
Theoretical Computer Science
520
, 2014, pp. 130-132
Partitioning powers of traceable or Hamiltonian graphs
Olivier Baudon
,
Julien Bensmail
,
Jakub Przybyƚo
,
Mariusz Woźniak
Theoretical Computer Science
520
, 2014, pp. 133-137