The SCEAS System
| |||||||

## Search the dblp DataBase
Hovhannes A. Harutyunyan:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
## Publications of Author- Hovhannes A. Harutyunyan, Xiaolin Liu
**Multicast Algorithms in Torus Network.**[Citation Graph (0, 0)][DBLP] Applied Informatics, 2003, pp:429-434 [Conf] - Hovhannes A. Harutyunyan, Bin Shao
**An Experimental Result for Broadcast Time.**[Citation Graph (0, 0)][DBLP] Applied Informatics, 2003, pp:441-445 [Conf] - Hovhannes A. Harutyunyan, Calin D. Morosan
**On Two Properties of the Minimum Broadcast Time Function.**[Citation Graph (0, 0)][DBLP] IV, 2005, pp:523-527 [Conf] - Hovhannes A. Harutyunyan, Bin Shao
**A Heuristic for k-Broadcasting in Arbitrary Networks.**[Citation Graph (0, 0)][DBLP] IV, 2003, pp:287-293 [Conf] - Hovhannes A. Harutyunyan, Perouz Taslakian
**Orderly Broadcasting in a 2D Torus.**[Citation Graph (0, 0)][DBLP] IV, 2004, pp:370-375 [Conf] - Hovhannes A. Harutyunyan, Edward Maraachlian
**Broadcasting in Optimal Bipartite Double Loop Graphs.**[Citation Graph (0, 0)][DBLP] IV, 2006, pp:521-528 [Conf] - Hovhannes A. Harutyunyan, Shengjian Wang
**Efficient Multicast Algorithms for Mesh-connected Multicomputers.**[Citation Graph (0, 0)][DBLP] IV, 2006, pp:504-510 [Conf] - Hovhannes A. Harutyunyan
**Multiple message broadcasting in modified Knödel graph.**[Citation Graph (0, 0)][DBLP] SIROCCO, 2000, pp:157-165 [Conf] - Hovhannes A. Harutyunyan, Calin D. Morosan
**The global fault-tolerance of interconnection networks.**[Citation Graph (0, 0)][DBLP] SNPD, 2006, pp:171-176 [Conf] - Hovhannes A. Harutyunyan, Arthur L. Liestman
**More Broadcast Graphs.**[Citation Graph (0, 0)][DBLP] Discrete Applied Mathematics, 1999, v:98, n:1-2, pp:81-102 [Journal] - Hovhannes A. Harutyunyan, Arthur L. Liestman
**On the monotonicity of the broadcast function.**[Citation Graph (0, 0)][DBLP] Discrete Mathematics, 2003, v:262, n:1-3, pp:149-157 [Journal] - Jean-Claude Bermond, Hovhannes A. Harutyunyan, Arthur L. Liestman, Stephane Perennes
**A Note on the Dimensionality of Modified Knö;del Graphs.**[Citation Graph (0, 0)][DBLP] Int. J. Found. Comput. Sci., 1997, v:8, n:2, pp:109-0 [Journal] - Francesc Comellas, Hovhannes A. Harutyunyan, Arthur L. Liestman
**Messy Broadcasting in Multidimensional Directed Tori.**[Citation Graph (0, 0)][DBLP] Journal of Interconnection Networks, 2003, v:4, n:1, pp:37-51 [Journal] - Hovhannes A. Harutyunyan, Bin Shao
**An efficient heuristic for broadcasting in networks.**[Citation Graph (0, 0)][DBLP] J. Parallel Distrib. Comput., 2006, v:66, n:1, pp:68-76 [Journal] - Hovhannes A. Harutyunyan, Arthur L. Liestman
**k-Broadcasting in trees.**[Citation Graph (0, 0)][DBLP] Networks, 2001, v:38, n:3, pp:163-168 [Journal] - Hovhannes A. Harutyunyan, Arthur L. Liestman
**Improved upper and lower bounds for k-broadcasting.**[Citation Graph (0, 0)][DBLP] Networks, 2001, v:37, n:2, pp:94-101 [Journal] - Hovhannes A. Harutyunyan
**Minimum multiple message broadcast graphs.**[Citation Graph (0, 0)][DBLP] Networks, 2006, v:47, n:4, pp:218-224 [Journal] - Hovhannes A. Harutyunyan, Arthur L. Liestman
**Messy Broadcasting.**[Citation Graph (0, 0)][DBLP] Parallel Processing Letters, 1998, v:8, n:2, pp:149-159 [Journal] - Hovhannes A. Harutyunyan, Edward Maraachlian
**Linear Algorithm for Broadcasting in Unicyclic Graphs.**[Citation Graph (0, 0)][DBLP] COCOON, 2007, pp:372-382 [Conf] - Hovhannes A. Harutyunyan, Xiangyang Xu
**New Construction of Broardcast Graphs.**[Citation Graph (0, 0)][DBLP] IV, 2007, pp:751-756 [Conf] - Hovhannes A. Harutyunyan, Bin Shao
**Efficient heuristics for message dissemination in networks.**[Citation Graph (0, 0)][DBLP] Parallel and Distributed Computing and Networks, 2007, pp:192-197 [Conf] - Hovhannes A. Harutyunyan, Shengjian Wang
**Path-based multicasting in multicomputers.**[Citation Graph (0, 0)][DBLP] Parallel and Distributed Computing and Networks, 2007, pp:206-211 [Conf] **Near Optimal Broadcasting in Optimal Triple Loop Graphs.**[Citation Graph (, )][DBLP]**Efficient Heuristic for Multicasting in Arbitrary Networks.**[Citation Graph (, )][DBLP]**Efficient Broadcasting in Networks with Weighted Nodes.**[Citation Graph (, )][DBLP]**Broadcasting in Weighted-Vertex Graphs.**[Citation Graph (, )][DBLP]**Two Tree-Based Algorithms for Network Spare Capacity Design.**[Citation Graph (, )][DBLP]**Multi-Shared-Trees Based Multicasting in Mesh-Connected Networks.**[Citation Graph (, )][DBLP]**Linear Algorithm for Broadcasting in Networks With No Intersecting Cycles.**[Citation Graph (, )][DBLP]**A New Peer-to-Peer Network.**[Citation Graph (, )][DBLP]**Optimum Broadcasting in Complete Weighted-Vertex Graphs.**[Citation Graph (, )][DBLP]**Broadcasting in necklace graphs.**[Citation Graph (, )][DBLP]
Search in 0.022secs, Finished in 0.025secs | |||||||

| |||||||

| |||||||

System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002 for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002 |