default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDRoman Pearce
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2017
[c8]Michael B. Monagan, Roman Pearce:
An Algorithm For Spliting Polynomial Systems Based On F4. PASCO@ISSAC 2017: 12:1-12:5- 2016
- [j6]Michael B. Monagan, Roman Pearce:
Fermat benchmarks for rational expressionals in maple. ACM Commun. Comput. Algebra 50(4): 188-190 (2016) - 2015
- [c7]Michael B. Monagan, Roman Pearce:
A compact parallel implementation of F4. PASCO 2015: 95-100 - 2014
- [j5]Michael B. Monagan, Roman Pearce:
The Design of Maple's Sum-of-Products and POLY Data Structures for Representing Mathematical Objects. ACM Commun. Comput. Algebra 48(3/4): 166-186 (2014) - 2012
- [j4]Michael B. Monagan, Roman Pearce:
POLY: a new polynomial data structure for Maple 17. ACM Commun. Comput. Algebra 46(3/4): 164-167 (2012) - [c6]Michael B. Monagan, Roman Pearce:
POLY: A New Polynomial Data Structure for Maple 17. ASCM 2012: 325-348 - [c5]Michael B. Monagan, Roman Pearce:
Sparse Polynomial Powering Using Heaps. CASC 2012: 236-247 - 2011
- [j3]Michael B. Monagan, Roman Pearce:
Sparse polynomial division using a heap. J. Symb. Comput. 46(7): 807-822 (2011) - 2010
- [j2]Michael B. Monagan, Roman Pearce:
Sparse polynomial multiplication and division in Maple 14. ACM Commun. Comput. Algebra 44(3/4): 205-209 (2010) - [c4]Michael B. Monagan, Roman Pearce:
Parallel sparse polynomial division using heaps. PASCO 2010: 105-111
2000 – 2009
- 2009
- [c3]Michael B. Monagan, Roman Pearce:
Parallel sparse polynomial multiplication using heaps. ISSAC 2009: 263-270 - 2007
- [j1]Roman Pearce, Michael B. Monagan:
A maple library for high performance sparse polynomial arithmetic. ACM Commun. Comput. Algebra 41(3): 110-111 (2007) - [c2]Michael B. Monagan, Roman Pearce:
Polynomial Division Using Dynamic Arrays, Heaps, and Packed Exponent Vectors. CASC 2007: 295-315 - 2006
- [c1]Michael B. Monagan, Roman Pearce:
Rational simplification modulo a polynomial ideal. ISSAC 2006: 239-245
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 22:49 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:
