| 2001 |
|---|
| 12 | EE | C. Andrew Neff:
A verifiable secret shuffle and its application to e-voting.
ACM Conference on Computer and Communications Security 2001: 116-125 |
| 11 | EE | Ed Gerck,
C. Andrew Neff,
Ronald L. Rivest,
Aviel D. Rubin,
Moti Yung:
The Business of Electronic Voting.
Financial Cryptography 2001: 234-259 |
| 1996 |
|---|
| 10 | EE | C. Andrew Neff,
John H. Reif:
An Efficient Algorithm for the Complex Roots Problem.
J. Complexity 12(2): 81-115 (1996) |
| 1994 |
|---|
| 9 | | C. Andrew Neff,
John H. Reif:
An O(n^1+epsilon log b) Algorithm for the Complex Roots Problem
FOCS 1994: 540-547 |
| 8 | | Don Coppersmith,
C. Andrew Neff:
Roots of a Polynomial and its Derivatives.
SODA 1994: 271-279 |
| 7 | | C. Andrew Neff:
Specified Precision Polynomial Root Isolation Is in NC.
J. Comput. Syst. Sci. 48(3): 429-463 (1994) |
| 1990 |
|---|
| 6 | | C. Andrew Neff:
Specified Precision Polynomial Root Isolation is in NC
FOCS 1990: 152-162 |
| 5 | EE | Rida T. Farouki,
C. Andrew Neff:
Algebraic properties of plane offset curves.
Computer Aided Geometric Design 7(1-4): 101-127 (1990) |
| 4 | EE | Rida T. Farouki,
C. Andrew Neff:
Analytic properties of plane offset curves.
Computer Aided Geometric Design 7(1-4): 83-99 (1990) |
| 1989 |
|---|
| 3 | EE | Rida T. Farouki,
C. Andrew Neff,
M. A. O'Conner:
Automatic parsing of degenerate quadric-surface intersections.
ACM Trans. Graph. 8(3): 174-203 (1989) |
| 2 | EE | C. Andrew Neff:
Decomposing algebraic sets using Gröbner bases.
Computer Aided Geometric Design 6(3): 249-263 (1989) |
| 1987 |
|---|
| 1 | EE | C. Andrew Neff,
Ravi Nair:
A Ranking Algorithm for MOS Circuit Layouts.
IEEE Trans. on CAD of Integrated Circuits and Systems 6(1): 17-21 (1987) |
