This work presents a classification of weak models of distributed computing. We focus on deterministic distributed algorithms, and we study models of computing that are weaker ve...
The strongest well-known measure for the quality of a universal hash-function family H is its being -strongly universal, which measures, for randomly chosen h H, one's inabi...
Senior citizens often find it difficult to remember names. This paper describes a novel cell phone application that uses information about one's social network and the places...
Kent Fenwick, Michael Massimi, Ronald Baecker, San...
Prior to 1994, student registration at Newcastle University involved students being registered in a single place, where they would present a form which had previously been filled ...
Mark C. Little, Stuart M. Wheater, David B. Ingham...
In this paper, we describe a demonstration called an “End-to-End” demonstration developed for the 2005 offering of our grid computing course that was taught across the State o...