During Spring 1998, we embarked on pedagogical journey into unknown terrains -- the terrains of collaborative teaching and World Wide Web instruction. In this paper we present a j...
The dual of a 2-manifold polygonal mesh without boundary is commonly defined as another mesh with the same topology (genus) but different connectivity (vertex-face incidence), in ...
This paper describes a research project, which seeks to showcase the experience base of practitioners with technology-enhanced teaching and learning. A particular focus of this in...
A simple variant of a priority queue, called a soft heap, is introduced. The data structure supports the usual operations: insert, delete, meld, and findmin. Its novelty is to beat...
A crashing network protocol is an asynchronous protocol whose memory does not survive crashes. We show that a crashing network protocol that works over unreliable links can be driv...