We present a randomized EREW PRAM algorithm to nd a minimum spanning forest in a weighted undirected graph. On an n-vertex graph the algorithm runs in o((logn)1+ ) expected time f...
This article describes a framework for managing the life cycle of knowledge in organisations and to utilise this framework for reusing and repurposing knowledge work. The framework...
This is a time of increasing interdisciplinary research. Computer science is learning more from biology every day, enabling a plethora of new software techniques to flourish. And b...
To investigate the nature of people’s understandings for how search engines work, we collected data from 232 undergraduate and graduate students. Students were asked to “draw ...
The k-merge problem, given a collection of k, (2 k n), sorted sequences of total length n, asks to merge them into a new sorted sequence. The main contribution of this work is...