default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAndrew Novocin
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2013
[j4]Mark van Hoeij, Jürgen Klüners, Andrew Novocin
:
Generating subfields. J. Symb. Comput. 52: 17-34 (2013)- 2012
- [j3]Mark van Hoeij, Andrew Novocin:
Gradual Sub-lattice Reduction and a New Complexity for Factoring Polynomials. Algorithmica 63(3): 616-633 (2012) - 2008
- [j2]Andrew Novocin:
Factoring univariate polynomials over the rationals (abstract only). ACM Commun. Comput. Algebra 42(1-2): 85 (2008) - [j1]Andy Novocin, Mark van Hoeij:
Factoring univariate polynomials over the rationals. ACM Commun. Comput. Algebra 42(3): 157 (2008)
Conference and Workshop Papers
- 2015
- [c7]Andrew Novocin, David Saunders, Alexander Stachnik, Bryan S. Youse:
3-ranks for strongly regular graphs. PASCO 2015: 101-108 - 2012
- [c6]Mustafa Elsheikh, Mark Giesbrecht, Andy Novocin, B. David Saunders:
Fast computation of Smith forms of sparse matrices over local rings. ISSAC 2012: 146-153 - 2011
- [c5]William Hart, Andrew Novocin:
Practical Divide-and-Conquer Algorithms for Polynomial Arithmetic. CASC 2011: 200-214 - [c4]William Hart, Mark van Hoeij, Andrew Novocin:
Practical polynomial factoring in polynomial time. ISSAC 2011: 163-170 - [c3]Mark van Hoeij, Jürgen Klüners, Andrew Novocin:
Generating subfields. ISSAC 2011: 345-352 - [c2]Andrew Novocin, Damien Stehlé, Gilles Villard:
An LLL-reduction algorithm with quasi-linear time complexity: extended abstract. STOC 2011: 403-412 - 2010
- [c1]Mark van Hoeij, Andrew Novocin:
Gradual Sub-lattice Reduction and a New Complexity for Factoring Polynomials. LATIN 2010: 539-553
Informal and Other Publications
- 2014
- [i3]Mustafa Elsheikh, Andy Novocin, Mark Giesbrecht:
Ranks of Quotients, Remainders and $p$-Adic Digits of Matrices. CoRR abs/1401.6667 (2014) - 2012
- [i2]Mustafa Elsheikh, Mark Giesbrecht, Andy Novocin, B. David Saunders:
Fast Computation of Smith Forms of Sparse Matrices Over Local Rings. CoRR abs/1201.5365 (2012) - 2010
- [i1]Mark van Hoeij, Andrew Novocin:
Gradual sub-lattice reduction and a new complexity for factoring polynomials. CoRR abs/1002.0739 (2010)
Coauthor Index
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-25 05:41 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
