C. Andrew Neff - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 15 from 15

2009

Efficient Receipt-Free Ballot Casting Resistant to Covert ChannelsC. Andrew Neff. uss 2009: [doi]

2008

Efficient Receipt-Free Ballot Casting Resistant to Covert ChannelsBen Adida, C. Andrew Neff. iacr, 2008:207, 2008. [doi]

2006

Ballot Casting AssuranceBen Adida, C. Andrew Neff. uss 2006: [doi]

2001

The Business of Electronic VotingEd Gerck, C. Andrew Neff, Ronald L. Rivest, Aviel D. Rubin, Moti Yung. fc 2002: 234-259 [doi]

A verifiable secret shuffle and its application to e-votingC. Andrew Neff. ccs 2001: 116-125 [doi]

1996

An Efficient Algorithm for the Complex Roots ProblemC. Andrew Neff, John H. Reif. jc, 12(2):81-115, 1996. [doi]

1994

Roots of a Polynomial and its DerivativesDon Coppersmith, C. Andrew Neff. soda 1994: 271-279

An O(n^1+epsilon log b) Algorithm for the Complex Roots ProblemC. Andrew Neff, John H. Reif. focs 1994: 540-547

Specified Precision Polynomial Root Isolation Is in NCC. Andrew Neff. jcss, 48(3):429-463, 1994.

1990

Analytic properties of plane offset curvesRida T. Farouki, C. Andrew Neff. cagd, 7(1-4):83-99, 1990. [doi]

Algebraic properties of plane offset curvesRida T. Farouki, C. Andrew Neff. cagd, 7(1-4):101-127, 1990. [doi]

Specified Precision Polynomial Root Isolation is in NCC. Andrew Neff. focs 1990: 152-162

1989

Automatic parsing of degenerate quadric-surface intersectionsRida T. Farouki, C. Andrew Neff, M. A. O Conner. tog, 8(3):174-203, 1989. [doi]

Decomposing algebraic sets using Gröbner basesC. Andrew Neff. cagd, 6(3):249-263, 1989. [doi]

1987

A Ranking Algorithm for MOS Circuit LayoutsC. Andrew Neff, Ravi Nair. tcad, 6(1):17-21, 1987. [doi]

Sign in or sign up to see more results.

runs on WebDSL