![]() | ![]() |
2002 | ||
---|---|---|
10 | David W. Boyd: On a problem of Byrnes concerning polynomials with restricted coefficients, II. Math. Comput. 71(239): 1205-1217 (2002) | |
2000 | ||
9 | EE | David W. Boyd, Roger H. Lamprey: Computing as a general education requirement. ACM Southeast Regional Conference 2000: 135-138 |
1998 | ||
8 | Franck Beaucoup, Peter B. Borwein, David W. Boyd, Christopher Pinner: Power series with restricted coefficients and a root on a given ray. Math. Comput. 67(222): 715-736 (1998) | |
1997 | ||
7 | David W. Boyd: On a problem of Byrnes concerning polynomials with restricted coefficients. Math. Comput. 66(220): 1697-1703 (1997) | |
1996 | ||
6 | David W. Boyd: On beta expansions for Pisot numbers. Math. Comput. 65(214): 841-860 (1996) | |
5 | David W. Boyd: On the beta expansion for Salem numbers of degree 6. Math. Comput. 65(214): 861-875 (1996) | |
1993 | ||
4 | David W. Boyd: Bounds for the Height of a Factor of a Polynomial in Terms of Bombieri's Norms: I. The Largest Factor. J. Symb. Comput. 16(2): 115-130 (1993) | |
3 | David W. Boyd: Bounds for the Height of a Factor of a Polynomial in Terms of Bombieri's Norms: II. The Smallest Factor. J. Symb. Comput. 16(2): 131-145 (1993) | |
1990 | ||
2 | EE | David W. Boyd: The C preprocessor and Jensen's device. ACM Southeast Regional Conference 1990: 125-129 |
1975 | ||
1 | David W. Boyd: The Asymptotic Number of Solutions of a Diophantine Equation from Coding Theory. J. Comb. Theory, Ser. A 18(2): 210-215 (1975) |
1 | Franck Beaucoup | [8] |
2 | Peter B. Borwein | [8] |
3 | Roger H. Lamprey | [9] |
4 | Christopher Pinner (Chris Pinner, C. G. Pinner) | [8] |