Submissions from 2009
Compressing kinetic data from sensor networks, Sorelle A. Friedler
Integrating data-intensive scalable computing into the computer science curriculum, Alice E. Fischer, Gregory Kesden, John P. Dougherty, and Mark E. Hoffman
Submissions from 2008
A normal form for first-order logic over doubly-linked data structures, Steven Lindell
Enabling Teachers to Explore Grade Patterns to Identify Individual Needs and Promote Fairer Student Assessment, Sorelle A. Friedler
Using lyrics and music to reinforce concepts, John P. Dougherty
Submissions from 2007
Attribute Grammars and the Teaching of Compiler Design and Implementation, David Wonnacott
Concept visualization in CS0 using ALICE, John P. Dougherty
Elements of Finite Model Theory [book review], Steven Lindell and Scott Weinstein
Unifying the Applied Undergraduate CS Curriculum Around a Simplified Microprocessor Architecture, David Wonnacott
Virtual Worlds and Concepts in Computing, John P. Dougherty
Submissions from 2005
A Term Logic for Physically Realizable Models of Information, Steven Lindell
Computer Science and Bioinformatics, John P. Dougherty
Efficient manipulation of disequalities during dependence analysis, Robert Seater and David Wonnacott
Robustness testing of Java server applications, C. Fu, A. Milanova, B. G. Ryder, and David Wonnacott
Use and assessment of a rigorous approach for CS1, John P. Dougherty and David Wonnacott
Submissions from 2004
Beowulf cluster computing with Linux [book review], John P. Dougherty
Testing of Java Web Services for Robustness, C. Fu, B. G. Ryder, A. Milanova, and David Wonnacott
Turbo codes: desirable and designable [book review], John P. Dougherty
Submissions from 2003
Compiler-directed Program Fault Coverage for Highly Available Java Internet Services, C. Fu and K. Martin
Submissions from 2002
Achieving scalable locality with time skewing, David Wonnacott
Information technology fluency at a liberal arts college: Experience with implementation and assessment, John P. Dougherty
Information technology fluency in practice, John P. Dougherty, Tom Decechi, Tony Clear, Brad Richards, Stephen Cooper, and Tadeusz Wilusz
Teaching the use of IT in specific domains: Developing, assessing and refining a curriculum development framework, John P. Dougherty, Ned F. Kock, Cheryl Sandas, and Robert M. Aiken
Submissions from 2001
Computing Across the Curriculum, Richard A. Austing, Fay Cover, and John P. Dougherty
Descriptive Complexity [book review], Steven Lindell
Polynomial time array dataflow analysis, Robert Seater and David Wonnacott
Using accessory functions to generalize dynamic dispatch in single-dispatch object-oriented languages, David Wonnacott
Submissions from 2000
An Open Source Computer Science Laboratory, John P. Dougherty and T. Miller
Extending scalar optimizations for arrays, David Wonnacott
Omega Calculator and Library (Omega Project): release 1.2, W. Kelly, W. Maslov, E. Pugh, and David Wonnacott
The Role of Decidability in First Order Separations over Classes of Finite Structures, Steven Lindell and Scott Weinstein
Using time skewing to eliminate idle time due to memory bandwidth and network limitations, David Wonnacott
Submissions from 1999
Structured performability analysis of parallel applications, John P. Dougherty
Time skewing for parallel computers, David Wonnacott
Submissions from 1998
Constraint-based array dependence analysis, William Pugh and David Wonnacott
Elementary Properties of the Finite Ranks, Anuj Dawar, Kees Doets, Steven Lindell, and Scott Weinstein
Submissions from 1996
First Order Logic, Fixed Point Logic and Linear Order, Anuj Dawar, Steven Lindell, and Scott Weinstein
Generalized Implicit Definitions on Finite Structures, St Grumbach, Z. Lacroix, and Steven Lindell
Submissions from 1995
Constant-Space Sequential Model of Computation for First-Order Logic, Steven Lindell
Going beyond integer programming with the Omega test to eliminate false data dependences, William Pugh and David Wonnacott
Infinitary Logic and Inductive Definability over Finite Structures, Anuj Dawar, Steven Lindell, and Scott Weinstein
Non-linear array dependence analysis, William Pugh and David Wonnacott
Omega Library and Omega Calculator (Omega Project), W. Kelly, W. Maslov, E. Pugh, and David Wonnacott
Petit (Omega Project), W. Kelly, W. Maslov, E. Pugh, and David Wonnacott
Submissions from 1994
Experiences with constraint-based array dependence analysis, William Pugh and David Wonnacott
Static analysis of upper and lower bounds on dependences and parallelism, William Pugh and David Wonnacott
Submissions from 1993
Exact method for analysis of value-based array data dependences, William Pugh and David Wonnacott
Made-to-measure: computing a great fit, John P. Dougherty
Submissions from 1992
A Purely Logical Characterization of Circuit Uniformity, Steven Lindell
Eliminating false data dependences using the Omega test, William Pugh and David Wonnacott
Invariant Problem for Binary String Structures and the Parallel Complexity Theory of Queries, Steven Lindell
Logspace Algorithm for Tree Canonization, Steven Lindell
Submissions from 1991
Analysis of Fixed-Point Queries on Binary Trees, Steven Lindell
