Teacher perceptions of student emotional and behavioral needs: Implications for Positive Behavior Support, with L. Feuerborn. Accepted for publication to Behavioral Disorders.
Introductory programming: examining the exams, with Simon, Sheard, J., Carbone A., Laakso, M.-J., Clear, T., de Raadt, M., D'Souza, D., Lister, L., Philpot, A., Skene, J., and Warburton, G. Proceedings of the Fourteenth Australasian Computing Education Conference (ACE 2012). CRPIT, 123, Melbourne, Australia, ACS, January 2012, 61-70.
Exploring programming assessment instruments: a classification scheme for examination questions, with Sheard, J., Simon, Carbone, A., Chinn, D., Laakso, M.-J., Clear, T., de Raadt, M., D’Souza, D., Harland, J., Lister, R., and Philpot, A., Warburton, G. International Computing Education Research Workshop (ICER 2011), Providence, RI, August 2011, 33-38.
Exam Taxonomy Workshop: What is the nature of introductory programming exam papers?, with Sheard, J., Carbone, A., Chinn, D., and Laakso, M.-J., Sheard, J. Workshop at the Thirteenth Australasian Computing Education Conference (ACE 2011), Perth, Australia, January 2011.
Study Habits of CS 1 Students: What do they
do outside the classroom?, with A. Carbone, J. Sheard, M.-J. Laakso. Proceedings of the Twelfth Australasian
Computing Education Conference (ACE 2010), CRPIT 103,
Improving Mathematics Teachers’ Content Knowledge via Brief In-Service: A United States Case Study, with L. Feuerborn and G. Morlan. Professional Development in Education, 35(4), December 2009, 531-545.
Panel on Computational Thinking – What is it, How is it relevant, Who's doing what with it?, with R. Bryant, M. Folsom, , G. Hauser, and S. Wallace. The Journal of Computing Sciences in Colleges, 25(1), October 2009, 170-171.
Peer Assessment in the Algorithms Course. Annals of Research on Engineering Education, vol. 4, no. 3 (Spring/Summer 2009). http://www.areeonline.org/
An Exercise to Engage Computing Students in Discussion of Professional Issues, with T. VanDeGrift. 2009 ASEE Annual Conference and Exposition, June 2009, AC 2009-2512.
Using Bloom’s Taxonomy To Code Verbal Protocols of Students Solving a Data Structure Problem, with J. Parham and D. E. Stevenson. Proceedings of the 47th Annual Southeast Regional Conference, article 39, Clemson, SC, March 2009.
Gender and Diversity in Hiring Software
Professionals: What Do Students Say?, with T. VanDeGrift. Proceedings of the Fourth International Computing Education Research
What Students Say about Gender in Hiring Software Professionals (poster), with T. VanDeGrift. Proceedings of the 13th Annual SIGCSE Conference on Innovation and Technology in Computer Science Education, Madrid, Spain, June 2008, 344.
Serious Fun: Peer-Led Team Learning in CS,
with S. Huss-Lederman and J. Skrentny (panel). Proceedings of the Thirty-Ninth SIGCSE Technical Symposium on Computer
Uncovering Student Values for Hiring in the Software Industry, with T. VanDeGrift. Journal on Educational Resources in Computing, volume 4, issue 7 (January 2008). (33 pages)
Tutorial: Treisman Workshops for Computer Science. The Journal of Computing Sciences in Colleges, 23(2), Dec. 2007, 67-68.
Uncovering Student Values for Hiring in the Software Industry, with T. VanDeGrift. Third International Computing Education Research Workshop, Atlanta, GA, September 2007, 145-158.
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,
Treisman Workshops and Student Performance
in CS, with Kristofer Martin and Catherine Spencer. Proceedings of the 38th SIGCSE Technical Symposium on Computer Science
Work in Progress: Adapting the Treisman Model to Computer Science, with Kristofer Martin. 36th Annual Frontiers in Education Conference, San Diego, CA, October 2006, T2C-23-24.
Collaborative, Problem-based Learning in Computer Science, with Kristofer Martin. The Journal of Computing Sciences in Colleges, 21(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, Joensuu, Finland, 2004.
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, 19(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 I. Ben-Aroya and A. Schuster. In Algorithmica 21 (1998), 347–376.
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. 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. 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. Proceedings of the Sixth Annual Symposium on Parallel Algorithms and Architectures (SPAA), Cape May, NJ, June 1994, 354-63.
Performance of Adaptive Routers on Worst Case Permutations. 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 .
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.
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.