Tutorial:
Treisman Workshops for Computer Science. To appear in the
Ninth Annual Northwestern Regional Conference of
the Consortium for Computing Sciences in Colleges,
Uncovering Student Values for Hiring in the
Software Industry. To appear in the Third International Computing Education
Research Workshop,
Problem Solving and Student Performance in Data Structures and Algorithms, with Catherine Spencer and Kristofer Martin. Proceedings of 12th Annual SIGCSE Conference on Innovation and Technology in Computer Science Education, Dundee, Scotland, June 2007, 241-245.
Treisman Workshops and Student Performance in CS, with
Kristofer Martin and Catherine Spencer. Proceedings of the 38th SIGCSE
Technical Symposium on Computer Science Education,
Work in Progress: Adapting the Treisman Model to Computer
Science, with Kristofer Martin. 36th Annual Frontiers in Education
Conference,
Collaborative, Problem-based Learning in Computer Science, with Kristofer Martin. The Journal of Computing Sciences in Colleges, vol. 21, no. 1 (Oct. 2005), 239-245.
Peer Assessment in the Algorithms Course. Proceedings of the
10th Annual SIGCSE Conference on Innovation and Technology in Computer Science
Education,
Panel: Using Peer Review in Teaching Computing, with Edward
F. Gehringer, Mark Ardis, and Manuel A. Pérez-Quiñones. Proceedings of the 36th SIGCSE Technical
Symposium on Computer Science Education,
A panel discussion on the use of peer review in computer science. My contribution to the panel was my experience in using peer review in the algorithms course.
Students designing software: a multi-national-multi-institutional study, with Sally Fincher, Marian Petre, Josh Tenenberg, et al. Informatics in Education, 4(1), 143-162, 2005.
Journal version of the conference paper.
A multi-national,
multi-institutional study of student-generated software designs, with
Sally Fincher, Marian Petre, Josh Tenenberg, et al. Fourth Annual Finnish / Baltic Sea Conference
on Computer Science Education, Koli Calling,
A conference version of the
technical report below.
Cause for alarm?: A multi-national, multi-institutional study of
student-generated software designs, with S Fincher, M Petre, J Tenenberg, et
al. Technical Report 16-04,
Computing Laboratory,
This paper examines the question of what students produce when asked to design software.
Nifty Assignments, with Nick Parlante, David Matuszek, Jeff Lehman, David Reed, and John K. Estell. Proceedings of the 35th SIGCSE Technical Symposium on Computer Science Education, March 2004, 46-47.
An
assignment for the algorithms course that uses digital signatures, font files,
and recursion.
The Role of the Data Structures Course in the Computing Curriculum, with P. Prins and J. Tenenberg. The Journal of Computing Sciences in Colleges, vol. 19, no. 2 (Dec. 2003), 91-93.
A panel discussion on the purpose and content of the data structures course.
Non-clairvoyant Multiprocessing Scheduling of Jobs with Changing Execution Characteristics, with J. Edmonds, T. Brecht, and X. Deng. Journal of Scheduling 6: 231-250, 2003.
The journal version of the STOC paper.
A
Lower Bound for Nearly Minimal Adaptive and Hot Potato Algorithms, with
This paper
contains non-trivial generalizations of the doctoral thesis work.
Non-clairvoyant Multiprocessing Scheduling of Jobs with Changing Execution Characteristics, with J. Edmonds, T. Brecht, and X. Deng. In Twenty-ninth ACM Symposium on Theory of Computation, 1997, 120–129.
This paper
provides upper and lower bounds on the competitive ratio of online job
scheduling algorithms for a variety of classes of scheduling algorithms (how
often they can preempt processors) and a variety of classes of job types (what
their speedup functions look like). The
results of the paper apply even if the jobs are allowed to have multiple
phases, where each phase has a different speedup function but are still in the
same class.
A Lower Bound for Nearly Minimal Adaptive and Hot Potato Algorithms, with Ben-Aroya, I and Schuster, A. European Symposium on Algorithms, 1996, 471-485.
Minimal Adaptive Routing on the Mesh with Bounded Queue Size, with Tom Leighton and Martin Tompa. In Journal of Parallel and Distributed Computing, 34 (1996), 154–170.
A full version of the SPAA paper below. Originally appeared as UW Technical Report 94-07-03.
Packet Routing in Multiprocessor Networks. My Ph.D. thesis. UW Technical Report 95-03-06.
Lots more details in this than in the routing papers below.
Minimal Adaptive Routing on the Mesh with Bounded Queue Size, with
Tom Leighton and Martin Tompa. In Symposium of Parallel Algorithms and
Architectures (SPAA),
The Performance of Adaptive Routers on Worst Case Permutations.
In Parallel Computing Routing and Communication Workshop (Lecture Notes
in Computer Science, volume 853),
Bounds on Sample Size for Matrix Product Verification, with Rakesh Sinha. Information Processing Letters, 48 (1993), 87-91. This originally appeared as UW Technical Report 92-12-01 .
Method
Validating a Signed File or an Unsigned File Prior to Execution, with B.
Dresevic and G. Hitchcock.
This patent describes a way to reduce the likelihood that code executed
in a font file will cause the operating system to crash.
System
and Method for Secure Font Distribution, with D. Simon, J. Benaloh, G.
Hitchcock, and D. Meltzer.
This patent describes a way to sign and verify a digital signature on a
font file, even if the font file undergoes a process called subsetting, where
some of the glyphs in the font file are deleted from the file, which would
invalidate a normal digital signature.