We present a strongly history independent (SHI) hash table that supports search in O(1) worst-case time, and insert and delete in O(1) expected time using O(n) data space. This ma...
Abstract. This paper deals with updates of XML documents that satisfy a given schema, e.g., a DTD. In this context, when a given update violates the schema, it might be the case th...
Web technologies have become essential in the computing curricula. However, teaching a Web development course to computing students is challenging because of large bodies of knowl...
This paper describes a knowledge unit and the use of a software tool, DesignMentor, for teaching a very challenging topic in computer graphics and visualization, namely: curve and...
We collected advice on how to succeed at learning to program from 164 CS1 students at 3 institutions during a "saying is believing"intervention designed to encourage a g...
Beth Simon, Brian Hanks, Carol Zander, Laurie Murp...