Computer Science Research

Research Interest

Algorithms and network communications

Research Grant

  • An NSERC research grant from 2001 to 2010
  • Brandon University Internal Research Fund $2,500 and Travel Fund $750 in 2005-2006
  • Brandon University Internal Research Fund $4,000 in 2003-2004
  • The University of Alberta (Augustana) Internal Research Fund $2,000 in 2001-2002
  • Alberta Government Supporting Research Student Fund $1,450 in 2001
  • The University of Alberta (Augustana) Internal Research Fund $5,000 in 2000-2001
  • Cape Breton University Special Research Grant $11,000 and Nova Scotia
  • Government Supporting Research Student Fund¬†$4,741 in 2000
  • Cape Breton University Summer Research Stipend $618 in 2000
  • The University of Lethbridge Internal Research Fund $3,800 in 1997-98

Messy Broadcasting

Current studies of messy broadcasting have so far concentrated on finding worst-case times. However, such worst-case scenarios are extremely unlikely to occur in general. Hence, finding average-case times for completing messy broadcasting in various network topologies is both necessary and meaningful in practice. My research is focused on seeking the average messy broadcast times of networks such as hypercubes, d-ary trees and complete graphs using randomized algorithms and probability theory. Furthermore, the approach we introduced for average-case time complexity can also be used to simplify the proofs of existing results of worst-case situations.

Click here for the research contribution which appeared in the Journal of Interconnection Networks