An algorithm M is described that solves any well-defined problem p as quickly as the fastest algorithm computing a solution to p, save for a factor of 5 and loworder additive term...
We study routing and scheduling in packet-switched networks. We assume an adversary that controls the injection time, source, and destination for each packet injected. A set of pat...
We apply the Jigsaw cooperative learning model to our CS1 closed labs. The Jigsaw cooperative learning model assigns students into main groups in which each group member is respon...
We introduce Topobo, a 3D constructive assembly system embedded with kinetic memory, the ability to record and playback physical motion. Unique among modeling systems is Topoboʼs...
How suitable is a Python-based CS1 course as preparation for a C++-based CS2 course? After fifteen years of using C++ for both CS1 and CS2, the Computer Science Department at Mich...
Richard J. Enbody, William F. Punch, Mark McCullen