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 2005
Bounds on an exponential sum arising in Boolean circuit complexity, Frederic Green, Amitabha Roy, and Howard Straubing
Submissions from 2004
The correlation between parity and quadratic polynomials mod 3, Frederic Green
Submissions from 2002
Counting, fanout, and the complexity of quantum ACC, Frederic Green, Steven Homer, Cristopher Moore, and Christopher Pollett
Submissions from 2001
Relativized separation of EQP from PNP, Frederic Green and Randall Pruim
Submissions from 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
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 1997
Coping with Uncertainty in Map Learning, Kenneth Basye, Thomas Dean, and Jeffrey Scott Vitter
Submissions from 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
Learning dynamics: system identification for perceptually challenged agents, Kenneth Basye, Thomas Dean, and Leslie Pack Kaelbling
Inferring Finite Automata with Stochastic Output Functions and an Application to Map Learning, Thomas Dean, Dana Angluin, Kenneth Basye, Sean Engelson, Leslie Kaelbling, Evangelos Kokkevis, and Oded Maron
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
Graph-based mapping by mobile robots, Kenneth J. Basye
On the power of deterministic reductions to C=P, Frederic Green
Submissions from 1992
An Automata-based Approach to Robotic Map Learning, Kenneth Basye
The power of the middle bit, Frederic Green, Johannes Kobler, and Jacobo Toran
Submissions from 1991
An oracle separating ΘP from PPPH, Frederic Green
