Peter B. Borwein

Affiliations:
  • Simon Fraser University, IRMACS Centre, Vancouver, BC, Canada


According to our database1, Peter B. Borwein authored at least 31 papers between 1982 and 2014.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2014
High-Level Simulation Model of a Criminal Justice System.
Proceedings of the Theories and Simulations of Complex Social Systems, 2014

Wieferich pairs and Barker sequences, II.
LMS J. Comput. Math., 2014

2012
The Extraordinary Power of Division in Straight Line Programs.
Am. Math. Mon., 2012

Fuzzy cognitive maps and cellular automata: An evolutionary approach for social systems modelling.
Appl. Soft Comput., 2012

2011
The social impact in a high-risk community: A cellular automata model.
J. Comput. Sci., 2011

2008
Sign changes in sums of the Liouville function.
Math. Comput., 2008

2007
Zeros of Partial Sums of the Riemann Zeta Function.
Exp. Math., 2007

Irreducible polynomials and barker sequences.
ACM Commun. Comput. Algebra, 2007

2006
An old conjecture of Erdos-Turán on additive bases.
Math. Comput., 2006

2005
Polyphase sequences with low autocorrelation.
IEEE Trans. Inf. Theory, 2005

Explicit construction of general multivariate Padé approximants to an Appell function.
Adv. Comput. Math., 2005

2004
Binary sequences with merit factor greater than 6.34.
IEEE Trans. Inf. Theory, 2004

A complete description of Golay pairs for lengths up to 100.
Math. Comput., 2004

2003
Monic integer Chebyshev problem.
Math. Comput., 2003

Newman polynomials with prescribed vanishing and integer sets with distinct subset sums.
Math. Comput., 2003

Computational investigations of the Prouhet-Tarry-Escott Problem.
Math. Comput., 2003

Lower bounds for the merit factors of trigonometric polynomials from Littlewood classes.
J. Approx. Theory, 2003

2002
Some computations on the spectra of Pisot and Salem numbers.
Math. Comput., 2002

2001
Visible Structures in Number Theory.
Am. Math. Mon., 2001

Challenges in mathematical computing.
Comput. Sci. Eng., 2001

2000
Rudin-Shapiro-like polynomials in L<sub>4</sub>.
Math. Comput., 2000

Polynomials with Height 1 and Prescribed Vanishing at 1.
Exp. Math., 2000

1999
On Cyclotomic Polynomials with ± 1 Coefficients.
Exp. Math., 1999

1998
Power series with restricted coefficients and a root on a given ray.
Math. Comput., 1998

1997
On the rapid computation of various polylogarithmic constants.
Math. Comput., 1997

1996
The integer Chebyshev problem.
Math. Comput., 1996

1990
A Functional Equation (David W. Wilson).
SIAM Rev., 1990

1985
On the Complexity of Calculating Factorials.
J. Algorithms, 1985

1984
On Monochromatic Triangles.
J. Comb. Theory A, 1984

1983
The Desmic Conjecture.
J. Comb. Theory A, 1983

1982
On Monochrome Lines and Hyperplanes.
J. Comb. Theory A, 1982


  Loading...