default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMichael J. Mossinghoff
Person information
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j26]Michael J. Mossinghoff:
In Memoriam: Peter Benjamin Borwein (1953-2020). J. Approx. Theory 303: 106074 (2024)- [j25]Christian Bingane, Michael J. Mossinghoff
:
Small polygons with large area. J. Glob. Optim. 88(4): 1035-1050 (2024) - 2023
- [j24]Don Coppersmith, Michael J. Mossinghoff, Danny Scheinerman, Jeffrey M. Vanderkam:
Ideal solutions in the Prouhet-Tarry-Escott problem. Math. Comput. 93(349): 2473-2501 (2023) - 2021
- [j23]Todd Cochrane, Michael J. Mossinghoff, Chris Pinner, C. J. Richardson:
A Generalization of the Goresky-Klapper Conjecture, Part II. Exp. Math. 30(2): 209-220 (2021) - [j22]Michael J. Mossinghoff, Tomás Oliveira e Silva, Timothy S. Trudgian:
The distribution of k-free numbers. Math. Comput. 90(328): 907-929 (2021) - 2020
- [p1]Michael J. Mossinghoff, Timothy S. Trudgian:
A tale of two omegas. 75 Years of Mathematics of Computation 2020
2010 – 2019
- 2019
- [j21]Dilum De Silva, Michael J. Mossinghoff, Vincent Pigno, Christopher G. Pinner:
The Lind-Lehmer constant for certain p-groups. Math. Comput. 88(316): 949-972 (2019) - 2018
- [j20]Badria Alsulmi, Todd Cochrane, Michael J. Mossinghoff, Vincent Pigno, Chris Pinner, C. J. Richardson, Ian Thompson:
A Generalization of the Goresky-Klapper Conjecture, Part I. SIAM J. Discret. Math. 32(4): 2973-3002 (2018) - 2014
- [j19]Peter B. Borwein, Michael J. Mossinghoff:
Wieferich pairs and Barker sequences, II. LMS J. Comput. Math. 17(1): 24-32 (2014) - 2013
- [j18]Kevin G. Hare, Michael J. Mossinghoff:
Sporadic Reinhardt Polygons. Discret. Comput. Geom. 49(3): 540-557 (2013) - 2012
- [j17]Michael Filaseta, Michael J. Mossinghoff:
The distance to an irreducible polynomial, II. Math. Comput. 81(279): 1571-1585 (2012) - 2011
- [j16]Michael J. Mossinghoff:
Enumerating isodiametric and isoperimetric polygons. J. Comb. Theory A 118(6): 1801-1815 (2011)
2000 – 2009
- 2009
- [j15]Michael J. Mossinghoff:
Wieferich pairs and Barker sequences. Des. Codes Cryptogr. 53(3): 149-163 (2009) - [j14]Arturas Dubickas, Michael J. Mossinghoff:
Lower bounds for Z-numbers. Math. Comput. 78(267): 1837-1851 (2009) - 2008
- [b2]John M. Harris, Jeffry L. Hirst, Michael J. Mossinghoff:
Combinatorics and Graph Theory, Second Edition. Undergraduate Texts in Mathematics, Springer 2008, ISBN 978-0-387-79710-6, pp. I-XV, 1-381 - [j13]Michael J. Mossinghoff, Georges Rhin, Qiang Wu:
Minimal Mahler Measures. Exp. Math. 17(4): 451-458 (2008) - [j12]Peter B. Borwein, Ron Ferguson, Michael J. Mossinghoff:
Sign changes in sums of the Liouville function. Math. Comput. 77(263): 1681-1694 (2008) - 2007
- [j11]Peter B. Borwein, Erich L. Kaltofen, Michael J. Mossinghoff:
Irreducible polynomials and barker sequences. ACM Commun. Comput. Algebra 41(4): 118-121 (2007) - 2006
- [j10]Michael J. Mossinghoff:
Isodiametric Problems for Polygons. Discret. Comput. Geom. 36(2): 363-379 (2006) - [j9]Michael J. Mossinghoff:
A $1 Problem. Am. Math. Mon. 113(5): 385-402 (2006) - 2005
- [j8]David W. Boyd, Michael J. Mossinghoff:
Small Limit Points of Mahler's Measure. Exp. Math. 14(4): 403-414 (2005) - 2003
- [j7]Michael J. Mossinghoff:
Polynomials with Restricted Coefficients and Prescribed Noncyclotomic Factors. LMS J. Comput. Math. 6: 314-325 (2003) - [j6]Peter B. Borwein, Michael J. Mossinghoff:
Newman polynomials with prescribed vanishing and integer sets with distinct subset sums. Math. Comput. 72(242): 787-800 (2003) - 2002
- [j5]John M. Harris, Michael J. Mossinghoff:
Traceability in Small Claw-Free Graphs. Electron. Notes Discret. Math. 11: 358-364 (2002) - 2000
- [j4]Peter B. Borwein, Michael J. Mossinghoff:
Polynomials with Height 1 and Prescribed Vanishing at 1. Exp. Math. 9(3): 425-433 (2000) - [j3]Peter B. Borwein, Michael J. Mossinghoff:
Rudin-Shapiro-like polynomials in L4. Math. Comput. 69(231): 1157-1166 (2000)
1990 – 1999
- 1998
- [j2]Michael J. Mossinghoff:
Polynomials with small Mahler measure. Math. Comput. 67(224): 1697-1705 (1998) - [j1]Michael J. Mossinghoff, Christopher G. Pinner, Jeffrey D. Vaaler:
Perturbing polynomials with all their roots on the unit circle. Math. Comput. 67(224): 1707-1726 (1998) - 1995
- [b1]Nancy Blachman, Michael J. Mossinghoff:
Maple griffbereit - alle Versionen bis Maple V3. Vieweg 1995, ISBN 978-3-528-06529-4, pp. I-VII, 1-365
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 2025-01-09 13:20 CET 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:
