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=498
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Groups synchronizing a transformation of non-uniform kernel
João Araújo
,
Wolfram Bentz
,
Peter J. Cameron
Theoretical Computer Science
498
, 2013, pp. 1-9
Optimal probabilistic ring exploration by semi-synchronous oblivious robots
Stéphane Devismes
,
Franck Petit
,
Sébastien Tixeuil
Theoretical Computer Science
498
, 2013, pp. 10-27
DVcube: A novel compound architecture of disc-ring graph and hypercube-like graph
Ruo-Wei Hung
Theoretical Computer Science
498
, 2013, pp. 28-45
Bounded-degree minimum-radius spanning trees in wireless sensor networks
Min Kyung An
,
Nhat X. Lam
,
Dung T. Huynh
,
Trac N. Nguyen
Theoretical Computer Science
498
, 2013, pp. 46-57
Similarity in languages and programs
Cewei Cui
,
Zhe Dang
,
Thomas R. Fischer
,
Oscar H. Ibarra
Theoretical Computer Science
498
, 2013, pp. 58-75
Polynomial algorithms for open plane graph and subgraph isomorphisms
Colin de la Higuera
,
Jean-Christophe Janodet
,
Émilie Samuel
,
Guillaume Damiand
,
Christine Solnon
Theoretical Computer Science
498
, 2013, pp. 76-99
The worst Hanoi graphs
Ernst L. Leiss
Theoretical Computer Science
498
, 2013, pp. 100-106
On approximating string selection problems with outliers
Christina Boucher
,
Gad M. Landau
,
Avivit Levy
,
David Pritchard
,
Oren Weimann
Theoretical Computer Science
498
, 2013, pp. 107-114
Parameterized complexity of control by voter selection in Maximin, Copeland, Borda, Bucklin, and Approval election systems
Hong Liu
,
Daming Zhu
Theoretical Computer Science
498
, 2013, pp. 115-123