Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDPeter B. Borwein
Person information
- affiliation: Simon Fraser University, IRMACS Centre, Vancouver, BC, Canada
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2014
[j30]Peter B. Borwein, Michael J. Mossinghoff:
Wieferich pairs and Barker sequences, II. LMS J. Comput. Math. 17(1): 24-32 (2014)- 2012
- [j29]Vijay Kumar Mago, Laurens Bakker, Elpiniki I. Papageorgiou
, Azadeh Alimadad, Peter B. Borwein, Vahid Dabbaghian:
Fuzzy cognitive maps and cellular automata: An evolutionary approach for social systems modelling. Appl. Soft Comput. 12(12): 3771-3784 (2012) - [j28]Peter B. Borwein, Joe Hobart:
The Extraordinary Power of Division in Straight Line Programs. Am. Math. Mon. 119(7): 584-592 (2012) - 2011
- [j27]Vahid Dabbaghian, Valerie Spicer, Suraj K. Singh, Peter B. Borwein, Patricia L. Brantingham:
The social impact in a high-risk community: A cellular automata model. J. Comput. Sci. 2(3): 238-246 (2011) - 2008
- [j26]Peter B. Borwein, Ron Ferguson, Michael J. Mossinghoff:
Sign changes in sums of the Liouville function. Math. Comput. 77(263): 1681-1694 (2008) - 2007
- [j25]Peter B. Borwein, Erich L. Kaltofen, Michael J. Mossinghoff:
Irreducible polynomials and barker sequences. ACM Commun. Comput. Algebra 41(4): 118-121 (2007) - [j24]Peter B. Borwein, Greg Fee, Ron Ferguson, Alexa van der Waall:
Zeros of Partial Sums of the Riemann Zeta Function. Exp. Math. 16(1): 21-39 (2007) - 2006
- [j23]Peter B. Borwein, Kwok-Kwong Stephen Choi, Frank Chu:
An old conjecture of Erdos-Turán on additive bases. Math. Comput. 75(253): 475-484 (2006) - 2005
- [j22]Peter B. Borwein, Annie A. M. Cuyt, Ping Zhou:
Explicit construction of general multivariate Padé approximants to an Appell function. Adv. Comput. Math. 22(3): 249-273 (2005) - [j21]Peter B. Borwein, R. A. Ferguson:
Polyphase sequences with low autocorrelation. IEEE Trans. Inf. Theory 51(4): 1564-1567 (2005) - 2004
- [j20]Peter B. Borwein, R. A. Ferguson:
A complete description of Golay pairs for lengths up to 100. Math. Comput. 73(246): 967-985 (2004) - [j19]Peter B. Borwein, Kwok-Kwong Stephen Choi, Jonathan Jedwab:
Binary sequences with merit factor greater than 6.34. IEEE Trans. Inf. Theory 50(12): 3234-3249 (2004) - 2003
- [j18]Peter B. Borwein, Tamás Erdélyi:
Lower bounds for the merit factors of trigonometric polynomials from Littlewood classes. J. Approx. Theory 125(2): 190-197 (2003) - [j17]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) - [j16]Peter B. Borwein, Christopher G. Pinner, Igor E. Pritsker:
Monic integer Chebyshev problem. Math. Comput. 72(244): 1901-1916 (2003) - [j15]Peter B. Borwein, Petr Lisonek, Colin Percival:
Computational investigations of the Prouhet-Tarry-Escott Problem. Math. Comput. 72(244): 2063-2070 (2003) - 2002
- [j14]Peter B. Borwein, Kevin G. Hare:
Some computations on the spectra of Pisot and Salem numbers. Math. Comput. 71(238): 767-780 (2002) - 2001
- [j13]Jonathan M. Borwein, Peter B. Borwein:
Challenges in mathematical computing. Comput. Sci. Eng. 3(3): 48-53 (2001) - [j12]Peter B. Borwein, Loki Jörgenson:
Visible Structures in Number Theory. Am. Math. Mon. 108(10): 897-910 (2001) - 2000
- [j11]Peter B. Borwein, Michael J. Mossinghoff:
Polynomials with Height 1 and Prescribed Vanishing at 1. Exp. Math. 9(3): 425-433 (2000) - [j10]Peter B. Borwein, Michael J. Mossinghoff:
Rudin-Shapiro-like polynomials in L4. Math. Comput. 69(231): 1157-1166 (2000) - 1999
- [j9]Peter B. Borwein, Kwok-Kwong Stephen Choi:
On Cyclotomic Polynomials with ± 1 Coefficients. Exp. Math. 8(4): 399-407 (1999) - 1998
- [j8]Franck Beaucoup, Peter B. Borwein, David W. Boyd, Christopher G. Pinner:
Power series with restricted coefficients and a root on a given ray. Math. Comput. 67(222): 715-736 (1998) - 1997
- [j7]David Bailey, Peter B. Borwein, Simon Plouffe:
On the rapid computation of various polylogarithmic constants. Math. Comput. 66(218): 903-913 (1997) - 1996
- [j6]Peter B. Borwein, Tamás Erdélyi:
The integer Chebyshev problem. Math. Comput. 65(214): 661-681 (1996) - 1990
- [j5]Douglas G. Rogers, Peter B. Borwein:
A Functional Equation (David W. Wilson). SIAM Rev. 32(4): 684-686 (1990) - 1985
- [j4]Peter B. Borwein:
On the Complexity of Calculating Factorials. J. Algorithms 6(3): 376-380 (1985) - 1984
- [j3]Peter B. Borwein:
On Monochromatic Triangles. J. Comb. Theory A 37(2): 200-204 (1984) - 1983
- [j2]Peter B. Borwein:
The Desmic Conjecture. J. Comb. Theory A 35(1): 1-9 (1983) - 1982
- [j1]Peter B. Borwein:
On Monochrome Lines and Hyperplanes. J. Comb. Theory A 33(1): 76-81 (1982)
Parts in Books or Collections
- 2014
- [p1]Vahid Dabbaghian, Payman Jula, Peter B. Borwein, E. Fowler, Christopher Giles, N. Richardson, Alexander R. Rutherford, Alexa van der Waall:
High-Level Simulation Model of a Criminal Justice System. Theories and Simulations of Complex Social Systems 2014: 61-78
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-06-10 20:28 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:
