#### Submissions from 2017

Social and Technical Trade-Offs in Data Science, Sorelle Friedler, Solon Barocas, Danah Boyd, and Hanna Wallach

#### Submissions from 2016

MATH COUNTS: Inside CS2013, John Dougherty

Auditing Black-box Models for Indirect Influence, Casey Falk, Phillip D.F. Adler, Sorelle A. Friedler, Gabriel Rybeck '16, Carlos Scheidegger, Brandon Smith '16, and Suresh Venkatasubramanian

Machine-learning-assisted materials discovery using failed experiments, Paul Raccuglia '14, Katherine C. Elbert '13, Phillip D.F. Adler, Casey Falk '16, Malia B. Wenny '17, Aurelio Mollo '17, Sorelle A. Friedler, Joshua Schrier, and Alexander J. Norquist

#### Submissions from 2015

From sunset to sunrise, John Dougherty

A Sensor-based Framework for Kinetic Data Compression, Sorelle A. Friedler

#### Submissions from 2012

Distributed Shared Memory and Compiler-Induced Scalable Locality for Scalable Cluster Performance, David Wonnacott

#### Submissions from 2011

ompVerify: Polyhedral Analysis for the OpenMP Programmer, V. Basupalli, T. Yuki, S. Rajopadhye, and David Wonnacott

Review of Judy Green and Jeanne LaDuke's Pioneering Women in American Mathematics: the Pre-1940 PhD’s, Sorelle A. Friedler

#### Submissions from 2010

Approximation Algorithm for the Kinetic Robust k-center Problem, Sorelle A. Friedler

Review of Patricia Clark Kenschaft's Change is Possible: Stories of Women and Minorities in Mathematics, Sorelle A. Friedler

Spatio-temporal Range Searching over Compressed Kinetic Sensor Data, Sorelle A. Friedler

If ____________, you might be a computational thinker!, Daniel D. Garcia, Colleen M. Lewis, John P. Dougherty, and Matthew C. Jadud

Certification and standards for computing education in Pennsylvania , Jean Griffin, John P. Dougherty, Tammy R. Pirmann, and Rita Powell

Real-Time Collaboration Tools for Digital Ink, Steven Lindell

#### Submissions from 2009

Integrating data-intensive scalable computing into the computer science curriculum, Alice E. Fischer, Gregory Kesden, John P. Dougherty, and Mark E. Hoffman

Compressing kinetic data from sensor networks, Sorelle A. Friedler

#### Submissions from 2008

Using lyrics and music to reinforce concepts , John P. Dougherty

Enabling Teachers to Explore Grade Patterns to Identify Individual Needs and Promote Fairer Student Assessment, Sorelle A. Friedler

A normal form for first-order logic over doubly-linked data structures, Steven Lindell

#### Submissions from 2007

Concept visualization in CS0 using ALICE, John P. Dougherty

Virtual Worlds and Concepts in Computing, John P. Dougherty

Elements of Finite Model Theory [book review], Steven Lindell and Scott Weinstein

Attribute Grammars and the Teaching of Compiler Design and Implementation, David Wonnacott

Unifying the Applied Undergraduate CS Curriculum Around a Simplified Microprocessor Architecture, David Wonnacott

#### Submissions from 2005

Computer Science and Bioinformatics, John P. Dougherty

Use and assessment of a rigorous approach for CS1, John P. Dougherty and David Wonnacott

Robustness testing of Java server applications, C. Fu, A. Milanova, B. G. Ryder, and David Wonnacott

A Term Logic for Physically Realizable Models of Information, Steven Lindell

Efficient manipulation of disequalities during dependence analysis, Robert Seater and David Wonnacott

#### Submissions from 2004

Beowulf cluster computing with Linux [book review], John P. Dougherty

Turbo codes: desirable and designable [book review], John P. Dougherty

Testing of Java Web Services for Robustness, C. Fu, B. G. Ryder, A. Milanova, and David Wonnacott

#### Submissions from 2003

Compiler-directed Program Fault Coverage for Highly Available Java Internet Services, C. Fu and K. Martin

#### Submissions from 2002

Information technology fluency at a liberal arts college: Experience with implementation and assessment, John P. Dougherty

Information technology fluency in practice, John P. Dougherty, T. Clear, S. Cooper, and T. Decechi

Teaching the use of IT in specific domains: Developing, assessing and refining a curriculum development framework, John P. Dougherty, N. Kock, C. Sandas, and R. M. Aiken

Achieving scalable locality with time skewing, David Wonnacott

#### Submissions from 2001

Computing Across the Curriculum, R. A. Austing, F. 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

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

Extending scalar optimizations for arrays, David Wonnacott

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

Elementary Properties of the Finite Ranks, A. Dawar, K. Doets, Steven Lindell, and Scott Weinstein

Constraint-based array dependence analysis, William Pugh and David Wonnacott

#### Submissions from 1996

First Order Logic, Fixed Point Logic and Linear Order, A. Dawar, Steven Lindell, and Scott Weinstein

Generalized Implicit Definitions on Finite Structures, St Grumbach, Z. Lacroix, and Steven Lindell

#### Submissions from 1995

Infinitary Logic and Inductive Definability over Finite Structures, A. Dawar, Steven Lindell, and Scott Weinstein

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

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

Non-linear array dependence analysis, William 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

Made-to-measure: computing a great fit, John P. Dougherty

Exact method for analysis of value-based array data dependences, William Pugh and David Wonnacott

#### Submissions from 1992

Invariant Problem for Binary String Structures and the Parallel Complexity Theory of Queries, Steven Lindell

Logspace Algorithm for Tree Canonization, Steven Lindell

Purely Logical Characterization of Circuit Uniformity, Steven Lindell

Eliminating false data dependences using the Omega test, William Pugh and David Wonnacott

#### Submissions from 1991

Analysis of Fixed-Point Queries on Binary Trees, Steven Lindell