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: Author="Harutyunyan, Hovhannes A."
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
The worst case behavior of randomized gossip protocols
Hervé Baumann
,
Pierre Fraigniaud
,
Hovhannes A. Harutyunyan
,
Rémi de Verclos
Theoretical Computer Science
560, Part 2
, 2014, pp. 108-120
Nonadaptive broadcasting in trees
Hovhannes A. Harutyunyan
,
Arthur L. Liestman
,
Kazuhisa Makino
,
Thomas C. Shermer
Networks
57
(2), 2011, pp. 157-168
A linear algorithm for finding the
k
-broadcast center of a tree
Hovhannes A. Harutyunyan
,
Arthur L. Liestman
,
Bin Shao
Networks
53
(3), 2009, pp. 287-292
On the minimum path problem in Knödel graphs
Hovhannes A. Harutyunyan
,
Calin D. Morosan
Networks
50
(1), 2007, pp. 86-91
An efficient heuristic for broadcasting in networks
Hovhannes A. Harutyunyan
,
Bin Shao
Journal Parallel Distributed Computing
66
(1), 2006, pp. 68-76
Minimum multiple message broadcast graphs
Hovhannes A. Harutyunyan
Networks
47
(4), 2006, pp. 218-224
Improved upper and lower bounds for
k
-broadcasting
Hovhannes A. Harutyunyan
,
Arthur L. Liestman
Networks
37
(2), 2001, pp. 94-101
More broadcast graphs
Hovhannes A. Harutyunyan
,
Arthur L. Liestman
Discrete Applied Mathematics
98
(1-2), 1999, pp. 81-102
Messy broadcasting
Hovhannes A. Harutyunyan
,
Arthur L. Liestman
Parallel Processing Letters
8
(2), 1998, pp. 149-159
A note on the dimensionality of modified Knödel graphs
Jean-Claude Bermond
,
Hovhannes A. Harutyunyan
,
Arthur L. Liestman
,
Stephane Perennes
International Journal of Foundations of Computer Science
8
, 1997, pp. 109-116