The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Hovhannes A. Harutyunyan: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Hovhannes A. Harutyunyan, Xiaolin Liu
    Multicast Algorithms in Torus Network. [Citation Graph (0, 0)][DBLP]
    Applied Informatics, 2003, pp:429-434 [Conf]
  2. Hovhannes A. Harutyunyan, Bin Shao
    An Experimental Result for Broadcast Time. [Citation Graph (0, 0)][DBLP]
    Applied Informatics, 2003, pp:441-445 [Conf]
  3. 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]
  4. Hovhannes A. Harutyunyan, Bin Shao
    A Heuristic for k-Broadcasting in Arbitrary Networks. [Citation Graph (0, 0)][DBLP]
    IV, 2003, pp:287-293 [Conf]
  5. Hovhannes A. Harutyunyan, Perouz Taslakian
    Orderly Broadcasting in a 2D Torus. [Citation Graph (0, 0)][DBLP]
    IV, 2004, pp:370-375 [Conf]
  6. Hovhannes A. Harutyunyan, Edward Maraachlian
    Broadcasting in Optimal Bipartite Double Loop Graphs. [Citation Graph (0, 0)][DBLP]
    IV, 2006, pp:521-528 [Conf]
  7. Hovhannes A. Harutyunyan, Shengjian Wang
    Efficient Multicast Algorithms for Mesh-connected Multicomputers. [Citation Graph (0, 0)][DBLP]
    IV, 2006, pp:504-510 [Conf]
  8. Hovhannes A. Harutyunyan
    Multiple message broadcasting in modified Knödel graph. [Citation Graph (0, 0)][DBLP]
    SIROCCO, 2000, pp:157-165 [Conf]
  9. Hovhannes A. Harutyunyan, Calin D. Morosan
    The global fault-tolerance of interconnection networks. [Citation Graph (0, 0)][DBLP]
    SNPD, 2006, pp:171-176 [Conf]
  10. 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]
  11. 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]
  12. 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]
  13. 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]
  14. 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]
  15. 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]
  16. 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]
  17. Hovhannes A. Harutyunyan
    Minimum multiple message broadcast graphs. [Citation Graph (0, 0)][DBLP]
    Networks, 2006, v:47, n:4, pp:218-224 [Journal]
  18. 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]
  19. Hovhannes A. Harutyunyan, Edward Maraachlian
    Linear Algorithm for Broadcasting in Unicyclic Graphs. [Citation Graph (0, 0)][DBLP]
    COCOON, 2007, pp:372-382 [Conf]
  20. Hovhannes A. Harutyunyan, Xiangyang Xu
    New Construction of Broardcast Graphs. [Citation Graph (0, 0)][DBLP]
    IV, 2007, pp:751-756 [Conf]
  21. 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]
  22. 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]

  23. Near Optimal Broadcasting in Optimal Triple Loop Graphs. [Citation Graph (, )][DBLP]


  24. Efficient Heuristic for Multicasting in Arbitrary Networks. [Citation Graph (, )][DBLP]


  25. Efficient Broadcasting in Networks with Weighted Nodes. [Citation Graph (, )][DBLP]


  26. Broadcasting in Weighted-Vertex Graphs. [Citation Graph (, )][DBLP]


  27. Two Tree-Based Algorithms for Network Spare Capacity Design. [Citation Graph (, )][DBLP]


  28. Multi-Shared-Trees Based Multicasting in Mesh-Connected Networks. [Citation Graph (, )][DBLP]


  29. Linear Algorithm for Broadcasting in Networks With No Intersecting Cycles. [Citation Graph (, )][DBLP]


  30. A New Peer-to-Peer Network. [Citation Graph (, )][DBLP]


  31. Optimum Broadcasting in Complete Weighted-Vertex Graphs. [Citation Graph (, )][DBLP]


  32. Broadcasting in necklace graphs. [Citation Graph (, )][DBLP]


Search in 0.004secs, Finished in 0.006secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002