David W. Boyd The Asymptotic Number of Solutions of a Diophantine Equation from Coding Theory. [Citation Graph (0, 0)][DBLP] J. Comb. Theory, Ser. A, 1975, v:18, n:2, pp:210-215 [Journal]
David W. Boyd Bounds for the Height of a Factor of a Polynomial in Terms of Bombieri's Norms: I. The Largest Factor. [Citation Graph (0, 0)][DBLP] J. Symb. Comput., 1993, v:16, n:2, pp:115-130 [Journal]
David W. Boyd Bounds for the Height of a Factor of a Polynomial in Terms of Bombieri's Norms: II. The Smallest Factor. [Citation Graph (0, 0)][DBLP] J. Symb. Comput., 1993, v:16, n:2, pp:131-145 [Journal]
David W. Boyd On a problem of Byrnes concerning polynomials with restricted coefficients, II. [Citation Graph (0, 0)][DBLP] Math. Comput., 2002, v:71, n:239, pp:1205-1217 [Journal]
David W. Boyd On a problem of Byrnes concerning polynomials with restricted coefficients. [Citation Graph (0, 0)][DBLP] Math. Comput., 1997, v:66, n:220, pp:1697-1703 [Journal]
Search in 0.001secs, Finished in 0.002secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP