![](https://dblp1.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp1.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp1.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp1.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp1.uni-trier.de/img/search.dark.16x16.png)
default search action
C. Andrew Neff
Person information
Refine list
![note](https://dblp1.uni-trier.de/img/note-mark.dark.12x12.png)
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 1996
- [j7]C. Andrew Neff, John H. Reif:
An Efficient Algorithm for the Complex Roots Problem. J. Complex. 12(2): 81-115 (1996) - 1994
- [j6]C. Andrew Neff:
Specified Precision Polynomial Root Isolation Is in NC. J. Comput. Syst. Sci. 48(3): 429-463 (1994) - 1990
- [j5]Rida T. Farouki, C. Andrew Neff:
Analytic properties of plane offset curves. Comput. Aided Geom. Des. 7(1-4): 83-99 (1990) - [j4]Rida T. Farouki, C. Andrew Neff:
Algebraic properties of plane offset curves. Comput. Aided Geom. Des. 7(1-4): 101-127 (1990) - 1989
- [j3]C. Andrew Neff:
Decomposing algebraic sets using Gröbner bases. Comput. Aided Geom. Des. 6(3): 249-263 (1989) - [j2]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) - 1987
- [j1]C. Andrew Neff, Ravi Nair:
A Ranking Algorithm for MOS Circuit Layouts. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 6(1): 17-21 (1987)
Conference and Workshop Papers
- 2009
- [c7]C. Andrew Neff:
Efficient Receipt-Free Ballot Casting Resistant to Covert Channels. EVT/WOTE 2009 - 2006
- [c6]Ben Adida, C. Andrew Neff:
Ballot Casting Assurance. EVT 2006 - 2001
- [c5]C. Andrew Neff:
A verifiable secret shuffle and its application to e-voting. CCS 2001: 116-125 - [c4]Ed Gerck, C. Andrew Neff, Ronald L. Rivest, Aviel D. Rubin, Moti Yung:
The Business of Electronic Voting. Financial Cryptography 2001: 234-259 - 1994
- [c3]C. Andrew Neff, John H. Reif:
An O(n^1+epsilon log b) Algorithm for the Complex Roots Problem. FOCS 1994: 540-547 - [c2]Don Coppersmith, C. Andrew Neff:
Roots of a Polynomial and its Derivatives. SODA 1994: 271-279 - 1990
- [c1]C. Andrew Neff:
Specified Precision Polynomial Root Isolation is in NC. FOCS 1990: 152-162
Informal and Other Publications
- 2008
- [i1]Ben Adida, C. Andrew Neff:
Efficient Receipt-Free Ballot Casting Resistant to Covert Channels. IACR Cryptol. ePrint Arch. 2008: 207 (2008)
Coauthor Index
![](https://dblp1.uni-trier.de/img/cog.dark.24x24.png)
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 23:01 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint