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=428
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
The three-squares lemma for partial words with one hole
F. Blanchet-Sadri
,
Robert Mercaş
Theoretical Computer Science
428
, 2012, pp. 1-9
Coloring vertices of a graph or finding a Meyniel obstruction
Kathie Cameron
,
Benjamin Lévêque
,
Frédéric Maffray
Theoretical Computer Science
428
, 2012, pp. 10-17
Tiara: A self-stabilizing deterministic skip list and skip graph
Thomas Clouser
,
Mikhail Nesterenko
,
Christian Scheideler
Theoretical Computer Science
428
, 2012, pp. 18-35
Effectively approximating measurable sets by open sets
Chris J. Conidis
Theoretical Computer Science
428
, 2012, pp. 36-46
Self-stabilizing gathering with strong multiplicity detection
Yoann Dieudonné
,
Franck Petit
Theoretical Computer Science
428
, 2012, pp. 47-57
Algorithmic paradigms for stability-based cluster validity and model selection statistical methods, with applications to microarray data analysis
R. Giancarlo
,
F. Utro
Theoretical Computer Science
428
, 2012, pp. 58-79
A self-stabilizing 6-approximation for the minimum connected dominating set with safe convergence in unit disk graphs
Sayaka Kamei
,
Hirotsugu Kakugawa
Theoretical Computer Science
428
, 2012, pp. 80-90
A note on the paper by Murat Cenk and Ferruh Ozbudak ``Multiplication of polynomials modulo
X^n
''
Victor Y. Pan
Theoretical Computer Science
428
, 2012, pp. 91-91
Completing a combinatorial proof of the rigidity of Sturmian words generated by morphisms
Gwénaël Richomme
,
Patrice Séébold
Theoretical Computer Science
428
, 2012, pp. 92-97