Skip to main content

Computer Science

Computer Science

Computer Science

Our faculty are connected to the latest trends in computing practices and research. Research interests range from classical and quantum computing to human-computer interaction to assistive technology to artificial intelligence and speech recognition, and so much more.

Submissions from 2004 2004

Hybrid probabilistic RoadMap - Monte Carlo motion planning for closed chain systems with spherical joints, Li Han

EyeKeys: A real-time vision interface based on gaze detection from a low-grade video camera, John J. Magee, Matthew R. Scott, Benjamin N. Waber, and Margrit Betke

Submissions from 2002 2002

Counting, fanout, and the complexity of quantum ACC, Frederic Green, Steven Homer, Cristopher Moore, and Christopher Pollett

Submissions from 2001 2001

Relativized separation of EQP from P^NP, Frederic Green and Randall Pruim

Software mode changes for continuous motion tracking, Deepak Karuppiah, Patrick Deegan, Elizeth Araujo, Yunlei Yang, Gary Holness, Zhigang Zhu, Barbara Lerner, Roderic Grupen, and Edward Riseman

Submissions from 2000 2000

A complex-number Fourier technique for lower bounds on the mod-m degree, Frederic Green

On the complexity of quantum ACC, Frederic Green, Steven Homer, and Christopher Pollett

Submissions from 1999 1999

Determining acceptance possibility for a quantum computation is hard for the polynomial hierarchy, Stephen Fenner, Frederic Green, Steven Homer, and Randall Pruim

Exponential sums and circuits with a single threshold gate and mod-gates, F. Green

Submissions from 1996 1996

On the correlation of symmetric functions, Jin Yi Cai, F. Green, and T. Thierauf

Complements of multivalued functions, Stephen Fenner, Frederic Green, Steven Homer, Alan L. Selman, Thomas Thierauf, and Heribert Vollmer

Submissions from 1995 1995

A lower bound for monotone perceptrons, F. Green

The Power of the Middle Bit of a #P Function, F. Green, J. Kobler, K. W. Regan, T. Schwentick, and J. Toran

Lower bounds for depth-three circuits with equals and mod-gates, Frederic Green

Submissions from 1993 1993

On the power of deterministic reductions to C=P, Frederic Green

Submissions from 1992 1992

The power of the middle bit, Frederic Green, Johannes Kobler, and Jacobo Toran

Submissions from 1991 1991

An oracle separating ΘP from PP^PH, Frederic Green

Submissions from 1986 1986

SU(2) deconfinement temperature on a body-centered hypercubic lattice, W. Celmaster, Eve Kovacs, F. Green, and R. Gupta

Submissions from 1985 1985

A vectorized Monte Carlo algorithm for computing Wilson line observables in Su(2) gauge theory on a BCH lattice, W. Celmaster, F. Green, R. Gupta, and E. Kovacs

Submissions from 1984 1984

Mean field analysis of SU(N) deconfining transitions in the presence of dynamical quarks, F. Green and F. Karsch

SU(4) deconfining transition at strong coupling: A Monte Carlo study, F. Green and F. Karsch

Submissions from 1983 1983

Manifestly broken local symmetries at large N, William Celmaster and Frederic Green

Schwinger-Dyson equations in reduced, quenched, chiral models, Frederic Green

Strong coupling expansions for the string tension at finite temperature, Frederic Green

There is no roughening singularity at finite temperature, Frederic Green