The problem of converting deterministic finite automata into (short) regular expressions is considered. It is known that the required expression size is 2(n) in the worst case for ...
We report on the successful process of transitioning a 4th-year university software engineering capstone course from a waterfall approach to an iterative, more agile model. The se...
As the field of information visualization matures, the tools and ideas described in our research publications are reaching users. The reports of usability studies and controlled e...
This paper presents an analysis of user studies from a review of papers describing new visualisation applications and uses these to highlight various issues related to the evaluat...
We consider the problem of maintaining information about the rank of a matrix M under changes to its entries. For an n × n matrix M, we show an amortized upper bound of O(nω−1)...