A Ranking Algorithm for MOS Circuit Layouts. - C. Andrew Neff; Ravi Nair (IEEE Trans. Comput. Aided Des. Integr. Circuits Syst., 1987)

Decomposing algebraic sets using Gröbner bases. - C. Andrew Neff (Comput. Aided Geom. Des., 1989)

Automatic parsing of degenerate quadric-surface intersections. - Rida T. Farouki; C. Andrew Neff; M. A. O'Conner (ACM Trans. Graph., 1989)

Analytic properties of plane offset curves. - Rida T. Farouki; C. Andrew Neff (Comput. Aided Geom. Des., 1990)

Algebraic properties of plane offset curves. - Rida T. Farouki; C. Andrew Neff (Comput. Aided Geom. Des., 1990)

An O(n^1+epsilon log b) Algorithm for the Complex Roots Problem - C. Andrew Neff; John H. Reif (FOCS, 1994)

Roots of a Polynomial and its Derivatives. - Don Coppersmith; C. Andrew Neff (SODA, 1994)

Specified Precision Polynomial Root Isolation Is in NC. - C. Andrew Neff (J. Comput. Syst. Sci., 1994)

An Efficient Algorithm for the Complex Roots Problem. - C. Andrew Neff; John H. Reif (J. Complex., 1996)

A verifiable secret shuffle and its application to e-voting. - C. Andrew Neff (CCS, 2001)

The Business of Electronic Voting. - Ed Gerck; C. Andrew Neff; Ronald L. Rivest; Aviel D. Rubin; Moti Yung (Financial Cryptography, 2001)

Ballot Casting Assurance. - Ben Adida; C. Andrew Neff (EVT, 2006)

Efficient Receipt-Free Ballot Casting Resistant to Covert Channels. - Ben Adida; C. Andrew Neff (IACR Cryptol. ePrint Arch., 2008)

Efficient Receipt-Free Ballot Casting Resistant to Covert Channels. - C. Andrew Neff (EVT/WOTE, 2009)