C. Andrew Neff

15 papers A* 4Journal 8Unranked 3
YearRankTypeTitle / Venue / Authors
2009 — conf
Efficient Receipt-Free Ballot Casting Resistant to Covert Channels.
EVT/WOTE
C. Andrew Neff
2008 J jnl
Efficient Receipt-Free Ballot Casting Resistant to Covert Channels.
IACR Cryptol. ePrint Arch.
Ben Adida, C. Andrew Neff
2006 — conf
Ballot Casting Assurance.
EVT
Ben Adida, C. Andrew Neff
2001 A* conf
A verifiable secret shuffle and its application to e-voting.
CCS
C. Andrew Neff
2001 — conf
The Business of Electronic Voting.
Financial Cryptography
Ed Gerck, C. Andrew Neff, Ronald L. Rivest, Aviel D. Rubin, Moti Yung
1996 J jnl
An Efficient Algorithm for the Complex Roots Problem.
J. Complex.
C. Andrew Neff, John H. Reif
1994 A* conf
An O(n^1+epsilon log b) Algorithm for the Complex Roots Problem
FOCS
C. Andrew Neff, John H. Reif
1994 A* conf
Roots of a Polynomial and its Derivatives.
SODA
Don Coppersmith, C. Andrew Neff
1994 J jnl
Specified Precision Polynomial Root Isolation Is in NC.
J. Comput. Syst. Sci.
C. Andrew Neff
1990 J jnl
Algebraic properties of plane offset curves.
Comput. Aided Geom. Des.
Rida T. Farouki, C. Andrew Neff
1990 J jnl
Analytic properties of plane offset curves.
Comput. Aided Geom. Des.
Rida T. Farouki, C. Andrew Neff
1990 A* conf
Specified Precision Polynomial Root Isolation is in NC
FOCS
C. Andrew Neff
1989 J jnl
Automatic parsing of degenerate quadric-surface intersections.
ACM Trans. Graph.
Rida T. Farouki, C. Andrew Neff, M. A. O'Conner
1989 J jnl
Decomposing algebraic sets using Gröbner bases.
Comput. Aided Geom. Des.
C. Andrew Neff
1987 J jnl
A Ranking Algorithm for MOS Circuit Layouts.
IEEE Trans. Comput. Aided Des. Integr. Circuits Syst.
C. Andrew Neff, Ravi Nair